|
Pacific Atlantic water flow: reverse flood-fill from the oceans
|
|
0
|
0
|
April 21, 2026
|
|
Number of islands: sink each land component once
|
|
0
|
0
|
April 21, 2026
|
|
Number of connected components in an undirected graph: union-find component merging
|
|
0
|
0
|
April 21, 2026
|
|
Number of 1 bits: drop-the-lowest-set-bit loop
|
|
0
|
0
|
April 21, 2026
|
|
Non-overlapping intervals: greedy keep-the-earliest-finish rule
|
|
0
|
0
|
April 21, 2026
|
|
Network delay time: Dijkstra shortest paths from the source
|
|
0
|
0
|
April 21, 2026
|
|
N queens: row-by-row backtracking with attack sets
|
|
0
|
0
|
April 21, 2026
|
|
Multiply strings: grade-school multiplication in an array
|
|
0
|
0
|
April 21, 2026
|
|
Missing number: XOR cancellation over values and indices
|
|
0
|
0
|
April 21, 2026
|
|
Minimum window substring: two-pointer cover-and-shrink window
|
|
0
|
0
|
April 21, 2026
|
|
Minimum interval to include each query: sort queries and maintain active min-heap
|
|
0
|
0
|
April 21, 2026
|
|
Min stack: stack entries paired with running minima
|
|
0
|
0
|
April 21, 2026
|
|
Min cost to connect all points: Prim minimum spanning tree
|
|
0
|
0
|
April 21, 2026
|
|
Min cost climbing stairs: bottom-up one-step-or-two-step DP
|
|
0
|
0
|
April 21, 2026
|
|
Merge two sorted lists: dummy-head linear merge
|
|
0
|
0
|
April 21, 2026
|
|
Merge triplets to form target triplet: filter dominated triplets and cover target coordinates
|
|
0
|
0
|
April 21, 2026
|
|
Merge k sorted lists: min-heap over the current heads
|
|
0
|
0
|
April 21, 2026
|
|
Merge intervals: sort by start and fold overlaps
|
|
0
|
0
|
April 21, 2026
|
|
Meeting rooms II: min-heap of current end times
|
|
0
|
0
|
April 21, 2026
|
|
Meeting rooms: sort by start time and check adjacent conflicts
|
|
0
|
1
|
April 21, 2026
|
|
Median of two sorted arrays: binary-search partition across both arrays
|
|
0
|
0
|
April 21, 2026
|
|
Maximum subarray: Kadane dynamic programming
|
|
0
|
0
|
April 21, 2026
|
|
Maximum product subarray: dual max-min rolling state
|
|
0
|
0
|
April 21, 2026
|
|
Maximum depth of binary tree: postorder height recursion
|
|
0
|
0
|
April 21, 2026
|
|
Max area of island: flood-fill connected component sizing
|
|
0
|
0
|
April 21, 2026
|
|
LRU cache: hash map plus doubly linked recency list
|
|
0
|
0
|
April 21, 2026
|
|
Lowest common ancestor of a BST: walk down using BST ordering
|
|
0
|
0
|
April 21, 2026
|
|
Longest substring without repeating characters: sliding window with last-seen indices
|
|
0
|
0
|
April 21, 2026
|
|
Longest repeating character replacement: sliding window with dominant-frequency tracking
|
|
0
|
0
|
April 21, 2026
|
|
Longest palindromic substring: expand around every center
|
|
0
|
0
|
April 21, 2026
|