Discussion and pseudocode. Code is not executed; completion does not prove mastery.
60 matching prompts
Showing 12 of 60 · page starts at 1
Arrays & hashing
First repeated event
Given an event stream, identify the first value whose second occurrence appears earliest. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Given an event stream, identify the first value whose second occurrence appears earliest. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-01
Arrays & hashing
Inventory pair target
Find two inventory adjustments whose signed quantities equal a requested reconciliation target. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Find two inventory adjustments whose signed quantities equal a requested reconciliation target. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-02
Arrays & hashing
Normalized account groups
Group account labels that contain the same normalized characters while preserving original values. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Group account labels that contain the same normalized characters while preserving original values. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-03
Arrays & hashing
Longest consecutive identifiers
Find the longest consecutive run of integer identifiers without sorting the complete input. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Find the longest consecutive run of integer identifiers without sorting the complete input. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-04
Arrays & hashing
Product except current metric
Produce each metric's product contribution excluding itself without division. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Produce each metric's product contribution excluding itself without division. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-05
Arrays & hashing
Most frequent bounded values
Return the k most frequent bounded values with deterministic tie behavior. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Return the k most frequent bounded values with deterministic tie behavior. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-06
Two pointers
Sorted pair reconciliation
Determine whether a sorted list contains two values matching a requested reconciliation total. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Determine whether a sorted list contains two values matching a requested reconciliation total. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-07
Two pointers
Remove duplicate checkpoints
Compact sorted checkpoint identifiers in place while retaining one occurrence. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Compact sorted checkpoint identifiers in place while retaining one occurrence. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-08
Two pointers
Container capacity comparison
Choose two vertical boundaries that maximize contained capacity and justify pointer movement. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Choose two vertical boundaries that maximize contained capacity and justify pointer movement. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-09
Two pointers
Three-value zero balance
Return unique triples whose signed values balance to zero. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Return unique triples whose signed values balance to zero. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-10
Two pointers
Rainwater between elevations
Calculate retained water across an elevation profile with constant auxiliary space. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Calculate retained water across an elevation profile with constant auxiliary space. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-11
Sliding window
Smallest quota window
Find the shortest contiguous activity window containing every required event multiplicity. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
Full prompt & evidence
Find the shortest contiguous activity window containing every required event multiplicity. Explain inputs, constraints, edge cases, an algorithm in precise pseudocode, correctness reasoning, and time and space complexity. Do not execute code.
What to cover
- Clarifies inputs, constraints, examples, and edge cases before selecting an approach.
- Explains a correct invariant or proof and compares at least one credible alternative.
- States time and space complexity and names tests that would expose boundary failures.
Prompt reference: coding-12
Catalog details
Catalog coding-interview-60-v1 · schema technical-practice-library.v1 · content hash 8b01f4ad52bee8c2880b5a30f6f740b4a1ddfbdb953bb328bb4e87611a214e38. Prompts are original and language-neutral.