• Knowledge of basic Data Structure and Algorithm
• Understand the implementation of various data structures
• Know how to implement algorithms using data structures

Array -> Linked List -> Stack -> Queue -> Recursion -> Sort -> Binary Search -> Hash -> String -> Binary Tree -> Heap -> Map -> Back Tracking -> Divid-and-Conquer -> Dynamic Programming

• STAGE ONE

  • Task 1 (2 Days): Array
  • Task 2 (2 Days): Linked List
  • Task 3 (2 Days): Stack
  • Task 4 (3 Days): Queue + Recursion
  • Task 5 (3 Days): Sorting
  • Task 6 (2 Days): Binary Search

• STAGE TWO

  • Task 7 (3 Days): Hash
  • Task 8 (2 Days): String
  • Task 9 (2 Days): Binary Tree
  • Task 10 (2 Days): Heap

• STAGE THREE

  • Task 11 (4 Days): Map
  • Task 12 (3 Days): Recursion + Back Tracking + Divide-and-Conquer

• Implement an Array, which supports expansion of storage capacity, dynamically ▸
• Combine two sorted arrays into a sorted one ▸

• Three Sum
• Majority Element
• Missing Positive

• Implement a LinkedList ▸
• To Reverse a LinkedList ▸
• Merge two sorted LinkedList to a sorted one ▸
• Find the middle value of a LinkedList ▸

• Linked List Cycle I
• Merge k Sorted Lists

• Implement a Stack ▸
• Simulate browser's forward and backward function ,using stack ▸

• Valid Parentheses
• Longest Valid Parentheses
• Evaluate Reverse Polish Notatio

• Queue
  • Implement a Queue ▸
  • Implement a Cycle Queue
• Recursion
  • Write an algorithm to calculate Fibonacci number: f(n)=f(n-1)+f(n-2) ▸
  • Calculate n factorial: n! ▸

• Queue
  • Design Circular Deque
  • Sliding Window Maximum
• Recursion
  • Climbing Stairs

• Implement Bubble Sort ▸
• Implement Selection Sort ▸
• Implement Insersion Sort ▸
• Implement Merge Sort ▸
• Implement Quick Sort ▸
• (*)Implement Heap Sort

• (review)Sliding Window Maximum
• Find the k-th Largest Number with O(n) Complexity

• Implement Binary Search on sorted list ▸
• Implement a fuzzy Binary Search algorithm (Search the first item that is larger than or equal to the given item) ▸

• (review) Sliding Window Maximum
• Sqrt(x)

• Implement a Hash table using LinkedList to solve hash collision ▸
• Implement a LRU cache elimination algorithm ▸

• Two Sum

• Implement a Character Repertoire containing 26 english letters using Trie tree ▸
• Implement a simple string matching algorithm ▸

• Reverse String
• Reverse Words in a String
• String to Integer (atoi)

• Implement a Binary Tree, supporting insert, delete and search methods ▸
• Find the successor/predecessor node of a node in a tree
• Implement the preorder, indorder, postorder and layer traversal ▸
• Complete leecode 98, 102, 107

• Invert Binary Tree
• Maximum Depth of Binary Tree
• Validate Binary Search Tree

• Implement a Min Heap or Max Heap or Priority Queue ▸
• Write a heap sort algorithm ▸
• Merge k sorted list using priority queue ▸
• Find the top-k largest number in a collection of numbers ▸

• Path Sum

• Implement a Graph using adjacent list representation ▸
• Implement the following two searching algorithms on a graph
  • the Breadth First Search (BFS) ▸
  • the Depth First Search (DFS) ▸
• Implement the Dijkstra Algorithm ▸
• Implement Topological Sorting ▸

• Number of Islands
• Valid Sudoku

• Recursion
  • Climb Stairs ▸
• Backtracking
  • The Eight Queen Puzzle ▸
  • 0/1 Knapsack Problem ▸
• Divide & Conquer
  • Calculate the number of reversed order pairs in a set of data

• Letter Combinations of a Phone Number
• permutations
• Regular Expression Matching