Generated by Codex with GPT-5
MEDIUMArray, Depth-First Search, Breadth-First Search, MatrixEach cell in the grid is a height. Water can flow from a cell to one of its four neighbors if the neighbor is at the same height or lower.
Continue ...Generated by Codex with GPT-5
MEDIUMArray, Dynamic Programming, Backtracking22.1Each number in nums must receive either a plus sign or a minus sign.
After choosing a sign for every element, the final expression must evaluate to target.
Generated by Codex with GPT-5
MEDIUMLinked List, Two Pointers25.6The input is a singly linked list and a non-negative integer k.
Rotating the list to the right by k means taking the last k nodes, preserving their order, and moving them to the front.
Generated by Codex with GPT-5
MEDIUMStringThe input is a string, and the task is to extract the integer prefix that follows a very specific parsing rule:
+ or -So this is not a math problem. It is a parsing problem with a few edge cases that must be handled in the correct order.
Continue ...Generated by Codex with GPT-5
MEDIUMArray, Backtracking, Bit ManipulationThis is the power set problem with one extra constraint that changes everything: the input can contain duplicate values, but the output cannot contain duplicate subsets.
If the array were all distinct, the job would be straightforward. At each position, either include the number or skip it, and every path through that decision tree would produce a unique subset.
Continue ...Generated by Codex with GPT-5
MEDIUMArray, Dynamic Programming, Stack, Monotonic Stack22.1For every contiguous subarray, take its minimum value. Then add all of those minimums together.
That sounds simple until the number of subarrays is considered. An array of length n has about n^2 / 2 subarrays, so listing each one and recomputing its minimum quickly becomes too slow.
Generated by Codex with GPT-5
HARDDynamic Programming, Tree, Depth-First Search, Binary TreeThis problem is easy to misread at first.
The path does not have to start at the root, and it does not have to end at a leaf. It can start anywhere and end anywhere, as long as it follows parent-child edges and does not reuse a node.
Continue ...Generated by Codex with GPT-5
HARDString, Dynamic Programming, GreedyThe pattern contains two special characters:
? matches exactly one character* matches any sequence of characters, including the empty sequenceThe match must cover the entire string. That is the part that makes the problem interesting.
Continue ...Generated by Codex with GPT-5
HARDMath, RecursionThe numbers 1 through n can form n! different permutations in lexicographic order.
The problem asks for the kth permutation in that ordering without generating all the earlier ones first.
Generated by Codex with GPT-5
HARDArray, String, SimulationThe input is a list of words and a fixed line width. The task is to break the words into lines and return the exact text layout that a formatter would produce.
Continue ...