|
Word search II: board DFS guided by a trie
|
|
0
|
0
|
April 21, 2026
|
|
Word ladder: BFS over one-letter transformations
|
|
0
|
0
|
April 21, 2026
|
|
Trapping rain water: two pointers with running side maxima
|
|
0
|
0
|
April 21, 2026
|
|
Swim in rising water: min-heap search on path bottleneck
|
|
0
|
0
|
April 21, 2026
|
|
Sliding window maximum: monotonic deque of candidate indices
|
|
0
|
0
|
April 21, 2026
|
|
Serialize and deserialize binary tree: preorder traversal with null sentinels
|
|
0
|
0
|
April 21, 2026
|
|
Reverse nodes in k group: count-ahead and reverse fixed blocks
|
|
0
|
0
|
April 21, 2026
|
|
Regular expression matching: DP for `.` and `*` operators
|
|
0
|
0
|
April 21, 2026
|
|
Reconstruct itinerary: Hierholzer traversal with lexical ordering
|
|
0
|
0
|
April 21, 2026
|
|
N queens: row-by-row backtracking with attack sets
|
|
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
|
|
Merge k sorted lists: min-heap over the current heads
|
|
0
|
0
|
April 21, 2026
|
|
Median of two sorted arrays: binary-search partition across both arrays
|
|
0
|
0
|
April 21, 2026
|
|
Longest increasing path in a matrix: DFS memoization on increasing edges
|
|
0
|
0
|
April 21, 2026
|
|
Largest rectangle in histogram: monotonic stack with deferred widths
|
|
0
|
0
|
April 21, 2026
|
|
Find median from data stream: two heaps that keep the halves balanced
|
|
0
|
0
|
April 21, 2026
|
|
Distinct subsequences: counting DP on source and target prefixes
|
|
0
|
0
|
April 21, 2026
|
|
Burst balloons: interval DP on the last balloon burst
|
|
0
|
0
|
April 21, 2026
|
|
Binary tree maximum path sum: postorder gain computation with negative-pruning
|
|
0
|
0
|
April 21, 2026
|
|
Alien dictionary: topological sort from adjacent-word constraints
|
|
0
|
0
|
April 21, 2026
|
|
Remove invalid parentheses: BFS for minimum removals
|
|
0
|
2
|
April 20, 2026
|
|
Regular expression matching: DP with dot and star
|
|
0
|
1
|
April 20, 2026
|
|
Largest team with a core employee: maximum clique containing a node
|
|
0
|
0
|
April 20, 2026
|
|
Simulate order-book matching with price-time priority
|
|
0
|
0
|
April 20, 2026
|
|
Validate a parent-child tree and build its lexicographically smallest S-expression
|
|
0
|
0
|
April 20, 2026
|
|
Find niceness: permute b to match a's up/down pattern, maximize sum of jumps
|
|
0
|
1
|
April 20, 2026
|