Coderust 3.0: Faster Coding Interview Preparation -- Leetcode 题目整理

Coderust 3.0: Faster Coding Interview Preparation


Array:
    1.Binary Search
    2.Find Maximum in Sliding Window —> LC 239
    3.Search rotated array —> LC 33
    4.Find smallest common number —> 404
    5.Rotate Array —> LC 189
    6.Find low/high index —> 404
    7.Move zeros to left —> LC 283
    8.Find maximum single sell profit —> LC 121
    9.Implement Quicksort —> 404
    10.Merge Overlapping Intervals —> LC 56
    11.Sum of Two Values —> LC 1
Linked List:
    1.Reverse a singly linked list —> LC 206
    2.Remove Duplicates from a Linked List —> 83
    3.Insertion Sort of a Linked List —> LC147
    4.Intersection Point of Two Lists —> LC 160
    5.Nth from last node —> LC 19
    6.Swap Nth Node with Head —> 404
    7.Merge Two Sorted Linked Lists —> LC21
    8.Merge Sort —> LC 148
    9.Reverse even nodes —> LC 328
    10.Rotate a Linked list —> LC 61
    11.Reverse k Elements —>  LC 25
    12.Add Two Integers —> LC 2
    13.Copy linked list with arbitrary pointer —> LC 138
Math & Stats
    1.Find kth permutation —> LC 60
String
    1.Reverse words in a sentence —> LC 151
    2.Remove white spaces —> LC316
    3.Remove white spaces —> 404
    4.String Segmentation —> LC 139
    5.XML to Tree —> 404
    6.Find all palindrome substrings —> LC 647
    7.Regular Expression —> LC 10

Tree
1. Check if two binary trees are identical --> LC 100
2. Write an In-Order Iterator for a Binary Tree --> LC 94
3. Iterative Inorder Traversal --> LC 94 with out recursive
4. Inorder Successor BST --> LC 285
5. Level Order Traversal of Binary Tree -->LC 102
6. Is Binary Search Tree --> LC 94
7. Convert Binary Tree To Doubly Linked List —> 404 ***
8. Print Tree Perimeter —> LC 545 & LintCode 878
9. Connect Same Level Siblings —> LC 116
10. Serialize/Deserialize Binary Tree —> LC 297
11. Inorder Successor BST with parent pointers —> 404
12. Nth Highest in BST —> Similar LC 230
13. Mirror binary tree nodes —> LC 226
14. Delete zero sum sub-trees —> 404
15. N-ary Tree to Binary Tree —> LC 431

Stacks and Queues
1. Stack using Queues —> LC 225
2. Queue using Stacks --> LLC 232
3. Expression Evaluation --> LC 150

Graphic
1. Clone a Directed Graph --> LC 113
2. Minimum Spanning Tree --> 404
3. Word Chaining --> 404

Back Tracking
1. Boggle —> LC 212



还没有整理完，剩下的还会继续发出来～～～

另外求米呀

支持一下lz 很有用

感谢楼主整理 这个课程确实非常好

关注关注，感谢lz！

谢谢lz！  我也买了这个，但是我不推荐大家买，直接用lz给的题去leetcode做就好了。
coderust上test case超级不全，我写个错的也说我pass, 还好我多想想发现了自己写错。
而且coderust上graph illustration也做得不好，因为它用的例子常常是简单的，没代表性的例子。遇到难点的题还是要求助leetcode  youtube 之类。