LintCode
📝 C++11 Solutions of All 289 LintCode Problems (No More Updates)
Install / Use
/learn @kamyu104/LintCodeREADME
LintCode

Up to date (2016-08-22), there are 289 problems on LintCode Online Judge.
The number of problems is increasing recently.
Here is the classification of all 289 problems.
For more problems and solutions, you can see my LeetCode-Solutions repository.
I'll keep updating for full summary and better solutions. Stay tuned for updates.
Algorithms
- Bit Manipulation
- Array
- String
- Linked List
- Math
- Tree
- Stack
- Queue
- Heap
- Hash Tables
- Data Structure
- Sort
- Recursion
- Binary Search
- Breadth-First Search
- Depth-First Search
- Backtracking
- Binary Search Trees
- Dynamic Programming
- Greedy
- OO Design
- System Design
Bit Manipulation
| # | Title | Solution | Time | Space | Difficulty | Tag | Note | |---| ----- | -------- | ---- | ----- | ---------- | --- | ---- | |1|A + B Problem| C++| O(1) | O(1) | Medium | | | |82|Single Number| C++| O(n) | O(1) | Easy | LeetCode| | |83|Single Number II| C++| O(n) | O(1) | Easy | LeetCode | | |84|Single Number III| C++| O(n) | O(1) | Medium | CTCI | | |142|O(1) Check Power of 2| C++| O(1) | O(1) | Easy | | | |179|Update Bits| C++| O(1) | O(1) | Medium | CTCI | | |181|Flip Bits| C++| O(1) | O(1) | Easy | CTCI | | |196|Find the Missing Number| C++| O(n) | O(1) | Medium | | | |365|Count 1 in Binary| C++| O(1) | O(1) | Easy | CTCI | |
Array
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---| ----- | -------- | ---- | ----- | ---------- | --- | ---- |
|6|Merge Sorted Array| C++| O(m + n) | O(1) | Easy | LeetCode | Two Pointers |
|8|Rotate String| C++| O(n) | O(1) | Easy | LeetCode | |
|9|Fizz Buzz| C++| O(n) | O(1) | Easy | | |
|30|Insert Interval| C++| O(n) | O(1) | Easy | LeetCode, EPI | |
|31|Partition Array| C++| O(n) | O(1) | Medium | | Two Pointers |
|32|Minimum Window Substring| C++| O(n) | O(1) | Medium | LeetCode | |
|38|Search a 2D Matrix II| C++| O(m + n) | O(1) | Medium | EPI | |
|39|Recover Rotated Sorted Array| C++| O(n) | O(1) | Easy | | |
|46|Majority Number| C++| O(n) | O(1) | Easy | LeetCode | |
|47|Majority Number II| C++| O(n) | O(1) | Medium | EPI | |
|48|Majority Number III| C++| O(n) | O(k) | Medium | EPI | |
|49|Sort Letters by Case| C++| O(n) | O(1) | Medium | | Two Pointers |
|50|Product of Array Exclude Itself| C++| O(n) | O(1) | Easy | | |
|51|Previous Permutation| C++| O(n) | O(1) | Medium | | |
|52|Next Permutation| C++| O(n) | O(1) | Medium | LeetCode | |
|57|3 Sum| C++| O(n^2) | O(1) | Medium | LeetCode | Two Pointers, Sort |
|58|4 Sum| C++| O(n^3) | O(1) | Medium | LeetCode | Hash |
|59|3 Sum Closest| C++| O(n^2) | O(1) | Medium | LeetCode | Two Pointers, Sort |
|64|Merge Sorted Array II| C++| O(m + n) | O(1) | Easy | LeetCode | Two Pointers |
|100|Remove Duplicates from Sorted Array| C++| O(n) | O(1) | Easy | LeetCode | Two Pointers |
|101|Remove Duplicates from Sorted Array II| C++| O(n) | O(1) | Easy | LeetCode | Two Pointers |
|133|Longest Words| C++| O(n) | O(n) | Easy | | |
|144|Interleaving Positive and Negative Numbers| C++| O(n) | O(1) | Medium | | Two Pointers |
|161|Rotate Image| C++| O(n^2) | O(1) | Medium | LeetCode | |
|162|Set Matrix Zeroes| C++| O(m * n) | O(1) | Medium | LeetCode | |
|172|Remove Element| C++| O(n) | O(1) | Easy | LeetCode | Two Pointers |
|185|Matrix Zigzag Traversal| C++| O(m * n) | O(1) | Easy | | |
|189|First Missing Positive| C++| O(n) | O(1) | Easy | LeetCode, EPI | Hash |
|190|Next Permutation II| C++| O(n) | O(1) | Medium | LeetCode | |
|200|Longest Palindromic Substring| C++| O(n) | O(n) | Medium | LeetCode | Manacher's Algorithm |
|363|Trapping Rain Water| C++| O(n) | O(1) | Medium | LeetCode | Two Pointers, Tricky |
|373|Partition Array by Odd and Even| C++| O(n) | O(1) | Easy | | Two Pointers |
|374| Spiral Matrix | C++ | O(m * n) | O(1) | Medium | LeetCode | |
|381| Spiral Matrix II | C++ | O(n^2) | O(1) | Medium | LeetCode | |
|382|Triangle Count| C++| O(n^2) | O(1) | Medium | | Two Pointers |
|383|Container With Most Water| C++| O(n) | O(1) | Medium | LeetCode, EPI | Two Pointers |
|388|Permutation Sequence| C++| O(n^2) | O(n) | Medium | LeetCode | |
|389|Valid Sudoku| C++| O(9^2) | O(9) | Easy | LeetCode | |
|404|[Subarray Sum II](http://lintcode.com/en/problem/subarra
