LeetCode Biweekly Contest 28
A biweekly review of monotonic stacks, rectangle updates, two non-overlapping target subarrays and interval DP, plus a memo bug and TLE.
A biweekly review of monotonic stacks, rectangle updates, two non-overlapping target subarrays and interval DP, plus a memo bug and TLE.
A weekly review of prefix sums, greedy frequency removal, answer-space binary search and the tree binary-lifting idea learned afterward.
A weekly review of array interleaving, median-based strength sorting, browser-history simulation and paint-house DP, with two final-problem TLEs.
A speed-contest review of array reversal as sorting, fixed-window binary patterns, memoized prerequisite DFS and a two-robot cherry-grid DP.
A weekly review of maximum products, widest cake cuts, tree-road redirection and the two-box probability and combinatorics problem missed in contest.
Why XOR is a weak way to hash C++ pairs, and a reusable hash_combine template for unordered_map, unordered_set, tuples, and custom types.
A collision-prone pair hash caused TLE, leading me back to hash_combine and a broader lesson about copied snippets versus understanding classic references.
Post-contest notes on sentence prefixes, vowel windows, pseudo-palindromic tree paths and maximum dot products after a minor injury.
Four solutions find a descending pattern, build a dependency wall, identify square-valued subarrays and maintain alternating weighted candy queries.
How to align an editor's include paths with GCC's real search order so the universal C++ header is indexed without false errors.