Leetcode-Lintcode Solutions
Here are leetcode-lintcode problem solutions. Here is a repo for you can play it and share your solution. Hope you enjoy it and contribute it.
Look here is a ladder for you. You can play it in leetcode.
How to make contributions
Please read and follow the steps in CONTRIBUTING.md.
1. Defeat the Algorithm Interview
Requried
| # | Title | Solution | Difficulty | Companies |
|---|---|---|---|---|
| 3 | Longest Substring Without Repeating Characters | Medium | Amazon|24|Facebook|20 | |
| 5 | Longest Palindromic Substring | Medium | Amazon | |
| 125 | Valid Palindrome | Easy | Facebook|44 | |
| 14 | Longest Common Prefix | Easy | ||
| 8 | String to Integer (atoi) | Medium | Facebook|17|Microsoft|10 |
Optional
| # | Title | Solution | Difficulty | Companies |
|---|---|---|---|---|
| 344 | Reverse String | Easy | Amazon | |
| 13 | Roman to Integer | Easy | Amazon|14 | |
| 10 | Regular Expression Matching | Hard | Facebook|12 |
2. Breadth First Search
Requried
| # | Title | Solution | Difficulty | Companies |
|---|---|---|---|---|
| 200 | Number of Islands | Medium | ||
| 102 | Binary Tree Level Order Traversal | Medium | ||
| 127 | Word Ladder | Medium | Amazon|32 Facebook|11 Google|11 | |
| 207 | Course Schedule | Medium | ||
| 210 | Course Schedule II | Medium | ||
| 133 | Clone Graph | Medium | ||
| 297 | Serialize and Deserialize Binary Tree | Hard | ||
3. Binary Search
Required
| # | Title | Solution | Difficultty | Companies |
|---|---|---|---|---|
| 658 | Find K Closest Elements | Medium | Facebook|13 | |
| 33 | Search in Rotated Sorted Array | Medium | Facebook|25 Amazon|18 | |
| 50 | Pow(x, n) | Medium | ||
| 4 | Median of Two Sorted Arrays | Hard | Amazon|13 | |
| 29 | Divide Two Integers | Medium | Facebook|23 | |
| 315 | Count of Smaller Numbers After Self | Hard | Google|9 | |
| 287 | Find the Duplicate Number | Medium | Amazon|7 Google|6 | |
| 167 | Two Sum II - Input array is sorted | Easy | Amazon|5 | |
| 658 | Find K Closest Elements | Medium | Facebook|12 |
Optional
| # | Title | Solution | Difficulty | Companies |
|---|---|---|---|---|
| 74 | Search a 2D Matrix | Easy | Amazon|11 | |
| 35 | Search Insert Position | Easy | Amazon | |
| 278 | First Bad Version | Easy | Facebook|50 | |
| 222 | Count Complete Tree Nodes | Medium | ||
| 69 | Sqrt(x) | Easy | Microsoft | |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | Amazon | |
| 300 | Longest Increasing Subsequence | Medium | ||
| 327 | Count of Range Sum | Hard | ||
| 363 | Max Sum of Rectangle No Larger Than K | Hard |
4. Binary Tree & Divide and Conquer
Required
| # | Title | Solution | Difficultty | Companies |
|---|---|---|---|---|
| 104 | Maximum Depth of Binary Tree | Easy | ||
| 226 | Invert Binary Tree | Easy | ||
| 617 | Merge Two Binary Trees | Easy | ||
| 96 | Unique Binary Search Trees | Medium | ||
| 173 | Binary Search Tree Iterator | Medium | ||
| 169 | Majority Element | Easy | ||
| 297 | Serialize and Deserialize Binary Tree | Hard | ||
| 53 | Maximum Subarray | Easy | ||
| 215 | Kth Largest Element in an Array | Medium |
Optional
5. Two Pointers
Required
6 . Implicit Graph DFS
Required
7 . Hash & Heap
Required
8 . Memoization Search & Dynamic Programming
Required
9 . 4 Key Points of DP and Coordinate DP
Required
License
Please see LICENSE.