Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMArray, Heap (Priority Queue)Two sorted integer arrays are given. A pair is formed by choosing one value from the first array and one from the second, and its cost is their sum. The task is to return the k pairs with the smallest costs, or every possible pair when fewer than k pairs exist.
Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMDynamic Programming, Tree, Depth-First Search, Binary TreeEach node in a binary tree represents a house, and its value is the amount of money in that house. Robbing two houses connected by an edge triggers the alarm, so a robbed node rules out its parent and its immediate children. The goal is to choose a valid set of nodes with the largest possible total value.
Continue ...Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMLinked ListGiven a singly linked list, rearrange its existing nodes so that every node in an odd-numbered position comes first, followed by every node in an even-numbered position. The relative order inside each group must stay unchanged.
Continue ...Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMMath, BrainteaserThere are n bulbs, all initially off. The process runs for n rounds. On round 1, every bulb is toggled; on round 2, every second bulb is toggled; on round 3, every third bulb is toggled; and so on. The goal is to count how many bulbs remain on after the final round.
Generated by Codex with GPT 5.6 Sol XHigh
HARDTwo Pointers, Design, Sorting, Heap (Priority Queue), Data StreamDesign a data structure that receives integers one at a time and can report the median of everything seen so far. If the count is odd, the median is the single middle value after sorting. If the count is even, it is the average of the two middle values.
Continue ...Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMTree, Depth-First Search, Binary Search Tree, Binary TreeGiven a binary search tree and two different nodes p and q that are known to be in it, find their lowest common ancestor. This is the deepest node whose subtree contains both targets. A target may be its own ancestor, so if p is above q, the answer can be p itself.
Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMTree, Depth-First Search, Binary Search Tree, Binary TreeGiven the root of a binary search tree and a 1-indexed number k, return the value that would appear in position k if all node values were arranged from smallest to largest.
Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMArray, Hash Table, Sorting, CountingGiven an integer array of length n, return every value that appears more than floor(n / 3) times. The output can contain at most two values: three different values cannot each occur more than one third of the time because their combined count would exceed n.
Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMMath, String, StackThe input is a valid arithmetic expression containing non-negative integers, spaces, and the four operators +, -, *, and /. The task is to evaluate it without using eval or a similar built-in expression evaluator. Multiplication and division must happen before addition and subtraction, and integer division must truncate toward zero.
Generated by Codex with GPT 5.6 Sol XHigh
MEDIUMArray, Math, Enumeration, Number TheoryGiven an integer n, the task is to count how many prime numbers are strictly smaller than n. A prime is an integer greater than one whose only positive divisors are one and itself. The word strictly matters: if n is prime, n is not included in the answer.