Prepare for your next interview.

20,926 resources · Page 126 of 872

1. Coding questions · Airwallex

   Find All Index Quadruples Summing to a Target Without Losing Positions

   Given an integer array and a target, return every quadruple of original indices i < j < k < l whose values sum to the target, in lexicographic order. Tests an efficient search beyond brute force, index-based deduplication, overflow awareness and handling of repeated values without losing positions.

2. Coding questions · Amazon

   Find all pairs summing to target in sorted array

   This question evaluates skills in array manipulation, handling duplicates, and algorithmic efficiency with attention to time and space complexity analysis.

3. Coding questions · NVIDIA

   Find all unique triplets summing to zero

   This question evaluates array-based algorithm design, handling of duplicate results, and analysis of time and space complexity when producing unique triplets that sum to zero.

4. Coding questions · Anthropic

   Find and remove duplicate files

   This question evaluates the ability to design scalable file deduplication algorithms, specifically testing knowledge of hashing strategies, collision handling, memory and I/O optimization, handling very large files, incremental/resumable operation, and complexity and trade-off analysis.

5. Coding questions · Uber

   Find Any Available Meeting Room

   This question evaluates a candidate's competence in handling interval-based scheduling problems, specifically managing interval data and performing efficient searches within sorted bookings to detect potential overlaps.

6. Coding questions · Ethos

   Find Array Elements Uniquely Determined by Known Range Sums

   Given only the index ranges whose sums are known for a hidden integer array, list every position whose value is uniquely determined by those sums, or report -1 if none is. Tests reasoning about how overlapping and nested range sums combine, plus an efficient solution for 100,000 ranges.

7. Coding questions · Meta

   Find buildings with rightward view

   This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find buildings with rightward view states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

8. Coding questions · Intuit

   Find Business Degrees of Separation

   This question evaluates understanding of graph traversal and shortest-path computation, including modeling business relationships as undirected graphs and interpreting degrees of separation on the shortest path.

9. Coding questions · Meta

   Find closest BST value and remove parentheses

   This question evaluates understanding of binary search tree properties and numerical proximity reasoning alongside string parsing and parentheses validation, focusing on data structure manipulation and algorithmic reasoning.

10. Coding questions · DoorDash

    Find closest value to a target in a BST

    This question evaluates understanding of binary search tree properties and numeric approximation, measuring competence in tree traversal, comparison logic, and algorithmic efficiency under input-size constraints.

11. Coding questions · Verkada

    Find common active intervals across cameras

    This question evaluates competency in interval processing, temporal data aggregation, and multi-stream synchronization, within the Coding & Algorithms domain, and requires practical application-level understanding of interval intersection and time-stamped sensor data handling.

12. Coding questions · Meta

    Find connected region sizes in matrix

    This question evaluates proficiency in graph traversal and connected-component algorithms, specifically DFS-based region sizing and counting, along with algorithmic complexity analysis and considerations for recursion depth or iterative alternatives.

13. Coding questions · Meta

    Find customer with max rentals in consecutive weeks

    The question evaluates temporal data manipulation and aggregation competencies in SQL/Python, focusing on ISO week alignment, consecutive-week logic, and the ability to handle tied top results.

14. Coding questions · IBM

    Find Customers Whose Average Website Resource Usage Exceeds 50 Percent

    Practice PostgreSQL aggregation with HAVING, customer-level average resource utilization, strict thresholds, two-decimal rounding, and ascending email output.

15. Coding questions · Amazon

    Find daily first-order merchants with SQL

    This question evaluates proficiency with SQL window functions, set-based data manipulation, timestamp-based grouping and query optimization within the Data Manipulation (SQL/Python) domain for a Data Scientist role, emphasizing practical application rather than purely conceptual understanding.

16. Coding questions · Liftoff

    Find degrees of connection in a LinkedIn graph

    This question evaluates understanding of graph traversal, reachability and shortest-path concepts along with the ability to manage performance constraints on large sparse graphs.

17. Coding questions · Stripe

    Find deployable slots in a recurring week from allowed and freeze windows

    A coding exercise on a recurring 10,080-minute week: combine allowed and freeze deployment windows into deployable slots, then add per-window time-zone offsets, the current time, a lead time, a minimum slot length and a cap of k results. It tests interval merging and subtraction, wrap-around at the week boundary and careful edge-case handling.

18. Coding questions · Waymo

    Find Dictionary Words Represented by Repeated Letters

    Match dictionary words to a repeated-letter string using ordered run characters and count inequalities, with explicit stretch, duplicate, and empty-string semantics.

19. Coding questions · Anthropic

    Find Duplicate Files by Content

    This question evaluates the ability to parse file-system-style input, group files by identical content, and manage deduplication using appropriate data structures and algorithms.

20. Coding questions · Applied Intuition

    Find duplicate files by size

    This question evaluates file parsing, data deduplication and grouping skills along with algorithmic efficiency and space-time trade-offs when identifying duplicate files by size rather than by content.

21. Coding questions · DoorDash

    Find Each Cell's Nearest Source

    This question evaluates understanding of shortest-path computation and distance labeling in grid-based graphs, measuring competency in algorithmic problem solving and efficient traversal strategies.

22. Coding questions · Uber

    Find earliest common meeting slot

    An Uber Software Engineer onsite coding question: given N attendees' busy calendars as sorted half-open intervals plus per-attendee working hours, find the earliest time window of length d in which everyone is simultaneously free, or return -1. It covers the merge-busy/scan-gaps algorithm and complexity, then follow-ups on scaling to N participants, time zones and DST, very large fragmented inputs, clock-injection API design, and concurrency control for live calendar updates.

23. Coding questions · Uber

    Find Earliest Full Connectivity Timestamp

    This question evaluates understanding of graph connectivity and temporal event processing, examining how pairwise interactions over time can merge components into a single connected set.

24. Coding questions · OpenAI

    Find earliest supporting dependency version

    This question evaluates a candidate's ability to design efficient search algorithms and reason about algorithmic complexity under constraints such as non-monotonic predicate behavior and a rate-limited black-box API.