Generated by Claude with claude-opus-4-7

Quick facts

• Problem: Kth Largest Element in a Stream
• Topics: Design, Heap (Priority Queue), Data Stream

Problem gist

Design a collection that supports two operations in any interleaving:

• insert(num) — add a number to the collection.
• find_kth_largest(k) — return the k-th largest element currently in the collection.

The twist versus the original LeetCode 703 is that k is a parameter of every query and may change from call to call. The classic min-heap-of-size-k solution relied on k being fixed at construction so it could safely discard everything below the running k-th largest. Once k can grow on a later call, no element is safe to throw away, and the whole strategy has to change.

Generated by Codex with GPT-5

Quick facts

• Difficulty: HARD
• Problem: Custom LeetCode-style prompt: Encode Any Input to JSON String
• Topics: Serialization, Depth-First Search, Hash Table, Graph, Design

Problem gist

The task is to write an encoder that accepts an input value and returns the same kind of string a normal JSON serializer would return:

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Sum of Two Integers
• Topics: Math, Bit Manipulation

Problem gist

The task is to return the sum of two signed integers without using the + or - operators. The important constraint is not about math knowledge; it is about understanding how binary addition works under the hood.

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Remove K Digits
• Topics: String, Stack, Greedy, Monotonic Stack

Problem gist

The problem gives a non-negative integer as a string and asks for the smallest possible number after removing exactly k digits. The answer must not keep unnecessary leading zeroes, and if every digit is removed or the remaining digits are all zeroes, the answer is "0".

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Custom LeetCode-style prompt: Two-Color Necklace Splitting
• Topics: Array, Sliding Window, Prefix Sum, Greedy, Math

Problem gist

This is a special case of the necklace splitting problem: two people, two bead types, and therefore at most two cuts. The input is a necklace represented as an array containing only X and Y. Suppose the full array has:

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Search a 2D Matrix II
• Topics: Array, Binary Search, Divide and Conquer, Matrix

Problem gist

The matrix is sorted in two directions at once. Every row is sorted from left to right, and every column is sorted from top to bottom. Given a target value, the task is to decide whether the target appears anywhere in the matrix.

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Perfect Squares
• Topics: Math, Dynamic Programming, Breadth-First Search

Problem gist

Given a positive integer n, the task is to return the fewest perfect square numbers whose sum is exactly n. A perfect square is a number such as 1, 4, 9, 16, and so on.

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Range Sum Query 2D - Immutable
• Topics: Array, Design, Matrix, Prefix Sum

Problem gist

The class receives a fixed 2D matrix and must answer many rectangle-sum queries. Each query gives the top-left cell (row1, col1) and the bottom-right cell (row2, col2), and asks for the sum of every matrix value inside that inclusive rectangle.

Generated by Codex with GPT-5

Quick facts

• Difficulty: MEDIUM
• Problem: Time Based Key-Value Store
• Topics: Hash Table, String, Binary Search, Design

Problem gist

Design a key-value store that remembers history. A normal hash map answers “what is the current value for this key?” This problem asks “what was the value for this key at this timestamp?”

Generated by Codex with GPT-5

Difficulty: MEDIUM
Problem: Binary Tree Zigzag Level Order Traversal

Problem gist

The input is the root of a binary tree. The task is to return the node values level by level, but the direction alternates:

• The root level is read from left to right.
• The next level is read from right to left.
• The next level flips back to left to right, and so on.

For example, a tree with levels [3], [9, 20], and [15, 7] should return three rows: [3], then [20, 9], then [15, 7].