BASICS & DSA

• Object Oriented Programming

• Time && Space Complexity

• Conditions & Loops

• Arrays

  • Linear Arrays
  • Circular Arrays
  • Matrices & Grids
  • Searching
  • Sorting

• Strings

  • Subsets
  • Subsequences

• Math

  • Modular Arithmetic
  • Number Theory
  • Combinations
  • Permutations
  • Determinants
  • Probability
  • Geometry
  • Primes
  • GCD

• Linked List

• Stacks and Queues

  • Monotonic Stack
  • Monotonic Queue
  • Priority Queues

• Min Max Heaps

• Hashing, Sets, Multisets

• Trees

  • Binary Search Tree (BST)
  • Tries, Segment Tree, Fenwick Tree (or Binary Indexed Tree)
  • Minimum Spanning Tree, Suffix Tree
  • Disjoint Set (or Union-Find)
  • Trie

• Graphs

  • Simple Nodes (numbers)
  • Complex Nodes (objects)

POPULAR CONCEPTS

• Arrays:

  • Bit Masking
  • Bit Manipulations
  • Prefix Sum — Precomputations
  • Sliding Window — Two pointers
  • Kadane's Algorithm
  • Josephus Algorithm
  • Square Root Decomposition
  • MO Algorithm

• String

  • Rabin-Karp Algorithm
  • Manacher's Algorithm
  • Z algorithm

• Greedy Approach, Bruteforce

  • Recursion
  • Backtracking

• Optimization

  • Memoization
  • Dynamic Programming
  • Binary Search — Divide and Conquer

• Math

  • Binary hyperparameter search
  • Logarithmic Exponentiation
  • Chinese Remainder Theorem
  • Convex Hull Construction
  • Stable marriage problem
  • Fast-Fourier Transform
  • Sieve of Eratosthenes
  • Binary Exponentiation
  • Euclidean Algorithm
  • Sweep Line Algorithm
  • Gaussian Elimination
  • Manhattan Distance
  • Catalan Numbers
  • Pigeonhole

• Graph

  • Breadth First Search
  • Depth First Search
  • Flood Fill
  • Shortest Path
  • Dijkstra Algorithm
  • Floyd Warshall Algorithm
  • Bellman Ford Algorithm
  • Prims Algorithm
  • Krushal Algorithm
  • Topological Sort
  • Lowest Common Ancestor
  • Euler Tour of Tree
  • Bipartite Graph
  • Strongly Connected Component
  • Heavy-light Decomposition