Basics

Arrays

• [ ] Review the following documentation: Arrays
• [x] Review the following algorithm: Maximum Subarray
• [x] Complete the following LeetCode problems:
  • [x] Two Sum
  • [x] Best Time to Buy and Sell Stock
  • [x] Minimum Size Subarray Sum
  • [x] Contains Duplicate
  • [x] Product of Array Except Self
  • [x] Maximum Subarray
  • [ ] Two Sum II - Input Array Is Sorted
  • [ ] Maximum Product Subarray
  • [ ] Search in Rotated Sorted Array
  • [ ] Find Minimum in Rotated Sorted Array
  • [ ] 3Sum
  • [ ] Container With Most Water
  • [x] Sliding Window Maximum

Hash Tables

• [ ] Review the following documentation: Hash Tables
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Strings

• [ ] Review the following documentation: Strings
• [x] Review the following algorithm: Longest Common Subsequence (LCS)
• [x] Complete the following LeetCode problems:
  • [x] Longest Substring Without Repeating Characters
  • [x] Longest Repeating Character Replacement
  • [x] Longest Substring with At Most K Distinct Characters
  • [x] Permutation In String
  • [x] Minimum Window Substring
  • [x] Longest Common Subsequence

Recursion

• [ ] Review the following documentation: Recursion
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Searching

• [ ] Review the following documentation: Searching
• [x] Review the following algorithm: Binary Search
• [x] Review the following algorithm: Quickselect
• [x] Complete the following LeetCode problems:
  • [x] Binary Search
  • [x] Top K Frequent Elements

Sorting

• [ ] Review the following documentation: Sorting
• [ ] Review the following algorithm: Bucket Sort
• [ ] Review the following algorithm: Cycle Sort
• [ ] Review the following algorithm: Topological Sort
• [x] Review the following algorithm: Merge Sort
• [x] Review the following algorithm: Quicksort
• [x] Complete the following LeetCode problems:
  • [x] Merge Two Sorted Lists

---

Data Structures

Linked Lists

• [x] Review the following documentation: Linked Lists
• [x] Review the following algorithm: Cycle Detection
• [x] Complete the following LeetCode problems:
  • [x] Linked List Cycle
  • [x] Middle of the Linked List
  • [x] Reverse a Linked List
  • [x] Merge Two Sorted Lists
  • [x] Remove Nth Node From End Of List
  • [x] Reorder List
  • [x] Merge k Sorted Lists

Queues

• [ ] Review the following documentation: Queues
• [ ] Review the following data structure: Queue
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Stacks

• [ ] Review the following documentation: Stacks
• [ ] Review the following data structure: Stack
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Deques

• [ ] Review the following documentation: Deques
• [ ] Review the following data structure: Deque
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Matrices

• [ ] Review the following documentation: Matrices
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Intervals

• [ ] Review the following documentation: Intervals
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

---

Advanced Data Structures

Trees

• [x] Review the following documentation: Trees
• [x] Review the following algorithm: Breadth-first Search (BFS)
• [x] Review the following algorithm: Depth-first Search (DFS)
• [x] Review the following algorithm: Tree Traversal
• [x] Review the following algorithm: Tree Operations
• [x] Complete the following LeetCode problems:
  • [x] Maximum Depth of Binary Tree
  • [x] Invert Binary Tree
  • [x] Same Tree
  • [x] Subtree of Another Tree
  • [x] Validate Binary Search Tree
  • [x] Binary Tree Level Order Traversal
  • [x] Lowest Common Ancestor of a Binary Search Tree
  • [x] Lowest Common Ancestor of a Binary Tree
  • [x] Binary Tree Right Side View
  • [x] Construct Binary Tree from Preorder and Inorder Traversal
  • [x] Kth Smallest Element in a BST
  • [x] Binary Tree Maximum Path Sum
  • [x] Serialize and Deserialize Binary Tree

Tries

• [ ] Review the following documentation: Tries
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Graphs

• [ ] Review the following documentation: Graphs
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Heaps

• [x] Review the following documentation: Heaps
• [ ] Review the following documentation: Priority Queues
• [x] Review the following data structure: Heap
• [x] Review the following algorithm: Heapsort
• [x] Review the following algorithm: k-way Merge
• [x] Review the following algorithm: kth Smallest (Largest)
• [x] Complete the following LeetCode problems:
  • [x] Merge k Sorted Lists
  • [x] K Closest Points to Origin
  • [x] Top K Frequent Elements
  • [x] Find Median from Data Stream

Union-find

• [ ] Review the following documentation: Union-find
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

---

Advanced

Dynamic Programming

• [ ] Review the following documentation: Dynamic Programming
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Backtracking

• [ ] Review the following documentation: Backtracking
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Greedy

• [ ] Review the following documentation: Greedy
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Binary

• [ ] Review the following documentation: Binary
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Math

• [ ] Review the following documentation: Math
• [ ] Complete the following LeetCode problems:
  • [ ] TBD

Geometry

• [ ] Review the following documentation: Geometry
• [ ] Complete the following LeetCode problems:
  • [ ] TBD