NOTE 01

• Array
• Linked List
• Stack and Queue

NOTE 02

• Hash Table
• Binary Tree
• Binary Search Tree (BST)
• Heap

NOTE 03

• Recursion
• Divide and Conquer
• Backtrack

NOTE 04

• Graph
• Depth-first search (DFS)
• Breadth-first search (BFS)
• A-Star Search

NOTE 05

• Sorting Algorithms
• Searching Algorithms

NOTE 06

• Dynamic Programming
• Greedy

NOTE 07

• Skip List
• Trie
• Disjoint-set
• Self-balancing BST (AVL tree, Red-Black tree, B- tree, B+ tree)

NOTE 08

• Primitives
• Bloom Filter
• LRU Cache

NOTE 09

• String
• String Searching algorithms (Naive, Rabin-Karp, KMP, Boyer-Moore)

NOTE 10

• System Design