LintCode
Personal Solutions of some questions of LintCode
| No. | Name | Language | Difficulty | Star | Tags |
|---|---|---|---|---|---|
| 0001 | A + B Problem | Python | Easy | ||
| 0002 | Trailing Zeros | Python | Easy | ||
| 0003 | Digit Counts | Python | Medium | Enumeration | |
| 0004 | Ugly Number II | Python | Medium | ☆ | Enumeration |
| 0005 | Kth Largets Element | Python | Medium | ☆ | Quick Sort |
| 0006 | Merge Two Sorted Arrays | Python | Easy | Array | |
| 0007 | Serialize and Deserialize Binary Tree | Python | Medium | Binary Tree | |
| 0008 | Rotate String | Python | Easy | String | |
| 0009 | Fizz Buzz | Python | Easy | Enumeration | |
| 0011 | Search Range in Binary Search Tree | Python | Medium | Binary Tree | |
| 0012 | Min Stack | Python | Medium | Stack | |
| 0013 | Implement strStr() | Python | Easy | String | |
| 0014 | First Position of Target | Python | Easy | Array, Binary Search | |
| 0015 | Permutations | Python | Medium | ★ | Recursion |
| 0016 | Permutations II | Python | Medium | Recursion, DFS | |
| 0017 | Subsets | Python | Medium | ★ | Recursion |
| 0018 | Subsets II | Python | Medium | ★ | Recursion, Backtracking |
| 0020 | Dices Sum | Python | Hard | DP | |
| 0022 | Flatten List | Python | Easy | Recursion | |
| 0024 | LFU Cache | Python | Hard | Recursion | |
| 0028 | Search a 2D Matrix | Python | Easy | Binary Tree | |
| 0029 | Interlieaving String | Python | Medium | DP | |
| 0030 | Insert Interval | Python | Medium | Interval | |
| 0031 | Partition Array | Python | Medium | Array, Sort | |
| 0032 | Minimum Window Substring | Python | Easy | Hash Table | |
| 0033 | N-Queens | Python | Medium | ★ | DFS, Recursion |
| 0034 | N-Queens II | Python | Medium | ★ | DFS, Recursion |
| 0035 | Reverse Linked List | Python | Easy | Linked List | |
| 0036 | Reverse Linked List II | Python | Medium | Linked List | |
| 0037 | Reverse 3-digit Integer | Python | Naive | ||
| 0038 | Search a 2D Matrix II | Python | Medium | Sorted Matrix | |
| 0039 | Recover Rotated Sorted Array | Python | Easy | Sorted Array | |
| 0040 | Implement Queue by Two Stacks | Python | Meidum | Stack, Queue | |
| 0041 | Maximum Subarray | Python | Easy | ★ | Array |
| 0042 | Maximum Subarray II | Python | Medium | ★ | Forward-Backward Traversal, Enumeration, Greedy, Array |
| 0043 | Maximum Subarray III | Python | Hard | ★ | DP, Array |
| 0044 | Minimum Subarray | Python | Easy | ★ | Greedy, Subarray |
| 0045 | Maximum Subarray Difference | Python | Medium | ★ | DP, Greedy, Subarray |
| 0046 | Majority Element | Python | Easy | ★ | Greedy, Enumeration |
| 0047 | Majority Element II | Python | Medium | Enumeration, Greedy | |
| 0048 | Majority Number III | Python | Medium | Hash Table, Linked List | |
| 0049 | Sort Letters by Case | Python | Medium | Sort, String | |
| 0050 | Product of Array Exclude Itself | Python | Easy | Forward-Backward Traversal | |
| 0053 | Reverse Words in a String | Python | Easy | String | |
| 0054 | String to Integer (atoi) | Python | Hard | ★ | String |
| 0055 | Compare Strings | Python | Easy | ★ | String |
| 0056 | Two Sum | Python | Easy | Hash Table, String | |
| 0059 | 3Sum Closest | Python | Medium | Sort, Array, Two Pointers | |
| 0061 | Search for a Range | Python | Medium | Array, Binary Search | |
| 0065 | Median of Two Sorted Arrays | Python | Hard | Array | |
| 0069 | Binary Tree Level Order Traversal | Python | Medium | Binary Tree | |
| 0075 | Find Peak Element | Python | Medium | Array, Binary Search | |
| 0076 | Longest Increasing Subsequence | Python | Medium | Binary Search, DP | |
| 0077 | Longest Common Subsequence | Python | Medium | DP | |
| 0078 | Longest Common Prefix | Python | Medium | Enumeration | |
| 0079 | Longest Common Substring | Python | Medium | String | |
| 0080 | Median | Python | Easy | ||
| 0082 | Single Number | Python | Easy | Quick Sort, Array | |
| 0083 | Signle Number II | Python | Medum | Greedy | |
| 0084 | Signle Number III | Python | Medum | Greedy | |
| 0085 | Insert Node in a Binary Tree | Python | Easy | BST | |
| 0086 | Binary Search Tree Iterator | Python | Medium | BST, Binary Tree | |
| 0088 | Lowest Common Ancestor of a Binary Tree | Python | Medium | Binary Tree | |
| 0089 | k Sum | Python | Hard | DP | |
| 0091 | Minimum Adjustment Cost | Python | Medium | Backpack, DP | |
| 0092 | Backpack | Python | Medium | Backpack, DP | |
| 0096 | Partition List | Python | Easy | ★ | Linked List |
| 0098 | Sort List | Python | Medium | Linked List | |
| 0099 | Reorder List | Python | Medium | Linked List | |
| 0100 | Remove Duplicates from Sorted Array | Python | Easy | Array | |
| 0101 | Remove Duplicates from Sorted Array II | Python | Easy | Array | |
| 0102 | [Linked List Cycle] | ||||
| 0107 | Word Break | Python | Medium | ★ | DP |
| 0109 | [Triangle] | ||||
| 0110 | Minimum Path Sum | Python | Easy | ★ | |
| 0111 | Climbing Stars | ||||
| 0112 | Remove Duplicates from Sorted List | ||||
| 0114 | Unique Paths | ||||
| 0115 | Unique Paths II | ||||
| 0145 | |||||
| 0156 | Merge Intervals | ||||
| 0167 | Add Two Numbers | ||||
| 0172 | Remove Element | ||||
| 0189 | First Missing Positive | ||||
| 0190 | Next Permutation II | ||||
| 0191 | Maximum Product Subarray | ||||
| 0200 | Longest Parlindromic Substring | ||||
| 0212 | |||||
| 0219 | |||||
| 0366 | |||||
| 0384 | |||||
| 0408 | |||||
| 0433 | |||||
| 0454 | |||||
| 0463 | |||||
| 0466 | |||||
| 0484 | |||||
| 0632 | |||||
| 0797 | Reach a Number | Python | Easy | ★ | Greedy |
| 0826 | Computer Maintenance | Python | Hard | ★ | DP |
| 0830 | Sort String | Python | Easy | ||
| 0903 | Range Addition | Python | Medium | ★ | Array |
| 1393 | |||||
| 1394 | |||||
| 1479 | Can Reach The Endpoint | Python | Simple | ★ | BFS, DFS, Queue |
| 1510 | |||||
| 1535 | |||||
| 1667 | |||||
| 1678 | Train Compartment Problem | Python | Medium | ★ | Stack |
| 1728 | |||||
| 1797 |