Algo

  1. [ALGO][DS] Max Flow Algorithm 2 min
  2. [ALGO][DS] Eulerian Path/Cycle 1 min
  3. [ALGO][DS] Dijkstra vs Prims 3 min
  4. [ALGO][DS] Dijkstra and Bellman-Ford 3 min
  5. [ALGO][DS] Monotonic Stack 1 min

Backtracking

  1. [LC] 52. N-Queens II 3 min

Balance

  1. [LC] 2488. Count Subarrays With Median K 3 min

BFS

  1. [LC] 959. Regions Cut By Slashes 4 min
  2. [LC] 2493. Divide Nodes Into the Maximum Number of Groups 3 min
  1. [LC] 4. Median of Two Sorted Arrays 3 min

CPP

  1. [CPP] Move Semantics 2 min
  2. [CPP] Variadic Template 2 min
  3. [CPP] Const in C++ 2 min
  4. [CPP] How C++ works 2 min
  5. [CS][CPP] Integer Representations 2 min
  6. [CS][CPP] Floating Point Numbers 2 min

CS

  1. [CS][DS] Fenwick Tree 2 min
  2. [CS][CPP] Integer Representations 2 min
  3. [CS][CPP] Floating Point Numbers 2 min

DFS

  1. [LC] 959. Regions Cut By Slashes 4 min
  2. [LC] 2493. Divide Nodes Into the Maximum Number of Groups 3 min
  3. [LC] 2477. Minimum Fuel Cost to Report to the Capital 2 min

Divide-and-Conquer

  1. [Math] Karatsuba Multiplication 3 min

DP

  1. [LC] 818. Race Car 5 min
  2. [LC] 1035. Uncrossed Lines 2 min

DS

  1. [ALGO][DS] Max Flow Algorithm 2 min
  2. [ALGO][DS] Eulerian Path/Cycle 1 min
  3. [ALGO][DS] Dijkstra vs Prims 3 min
  4. [ALGO][DS] Dijkstra and Bellman-Ford 3 min
  5. [ALGO][DS] Monotonic Stack 1 min
  6. [CS][DS] Fenwick Tree 2 min

Graph

  1. [CSES] Flight Discount 5 min
  2. [LC] 2493. Divide Nodes Into the Maximum Number of Groups 3 min

Hashmap

  1. [LC] 2488. Count Subarrays With Median K 3 min

Math

  1. [Math] How to check if two lines intersect 1 min
  2. [Math] Catalan Numbers 2 min
  3. [Math] Karatsuba Multiplication 3 min

Prefix

  1. [LC] 2488. Count Subarrays With Median K 3 min

Recursion

  1. [LC] 2477. Minimum Fuel Cost to Report to the Capital 2 min

Sliding-Window

  1. [LC] 30. Substring with Concatenation of All Words 3 min

Sorting

  1. [CSES] Stick Lengths 2 min
  2. [CSES] Missing Coin Sum 2 min

System design

  1. [SD] Vertical Scaling vs Horizontal Scaling 1 min
  2. [SD] Latency vs Throughput 2 min

Union-Find

  1. [LC] 959. Regions Cut By Slashes 4 min