cswork / libraryOpen practice workspace

READ. UNDERSTAND. PRACTICE.

Coding questions

Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.

1,899 resources · Page 16 of 80

  1. Coding questions · TikTok

    Compute pipeline order from dependencies

    This question evaluates understanding of graph algorithms and dependency resolution, specifically topological sorting and cycle detection, along with competence in choosing appropriate data structures and analyzing time/space complexity.

  2. Coding questions · Coinbase

    Compute prices, distances, and Top-K for orders

    Compute prices, distances, and Top-K for orders evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  3. Coding questions · Schonfeld

    Compute probability last passenger gets own seat

    This question evaluates a candidate's understanding of probability theory, combinatorics, and reasoning about sequential random processes, with emphasis on symmetry and conditional dependence.

  4. Coding questions · Amazon

    Compute product excluding index without division

    This question evaluates array-manipulation and algorithmic problem-solving skills, focusing on computing a product-for-each-index using prefix and postfix accumulation concepts while reasoning about edge cases such as zeros, negative numbers, and integer overflow.

  5. Coding questions · Tools For Humanity

    Compute reply-based engagement metrics

    This question evaluates proficiency in data manipulation and analytics, emphasizing SQL/Python skills for temporal filtering, joins between posts and users, deduplication, aggregation (distinct counts), and percentage calculations used to compute reply-based engagement metrics.

  6. Coding questions · Meta

    Compute reply-based user metrics in 7 days

    This question evaluates competency in SQL-based data manipulation and temporal user-metric calculation, focusing on aggregations and distinct-user counts derived from reply relationships within defined time windows.

  7. Coding questions · Meta

    Compute reservation diff for largest member

    This question evaluates competency in relational data manipulation and aggregation using SQL or Python, including joins, grouping, and handling missing referrer relationships.

  8. Coding questions · Amazon

    Compute rightmost-smaller delay times

    This question evaluates proficiency in efficient array-processing algorithms, reasoning about time and space complexity, and correct handling of duplicates and edge cases when computing distances to rightmost smaller elements.

  9. Coding questions · J.P. Morgan

    Compute ring window max and deletion indices

    This question evaluates algorithmic problem-solving across arrays and strings, covering concepts such as sliding-window techniques on circular arrays, wraparound handling, index recovery after single-character deletion, duplicate-character considerations, and time/space complexity analysis within the Coding & Algorithms domain.

  10. Coding questions · DoorDash

    Compute rolling cold-delivery rates with windows

    This question evaluates proficiency with SQL window functions, time-based joins, event deduplication and business-rule implementation for computing rolling metrics over temporal windows.

  11. Coding questions · DRW

    Compute rolling standard deviation in O(n)

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute rolling standard deviation in O(n) states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  12. Coding questions · Snapchat

    Compute same-day acceptance metrics last week

    This question evaluates proficiency in time-based data manipulation, SQL JOINs and aggregations, handling NULLs and missing reference rows, and computing acceptance and percentage metrics with careful UTC date boundary treatment.

  13. Coding questions · IBM

    Compute shared free time intervals

    This question evaluates skills in interval manipulation, schedule normalization, time parsing and time-zone handling, and scalable algorithm and data-structure selection for processing large sets of temporal intervals.

  14. Coding questions · Meta

    Compute SHOP spend share and model performance

    This question evaluates proficiency in SQL/Python data manipulation and analytics, focusing on aggregations, joins, time-window computations, handling missing or zero values, and deriving key metrics such as revenue share and revenue-per-conversion.

  15. Coding questions · Meta

    Compute shop visibility and intent metrics in SQL

    This question evaluates SQL-based data manipulation and analytical competencies in the Data Manipulation (SQL/Python) domain, focusing on deduplication, time-zone-aware timestamp handling, window functions, aggregation, and construction of visibility, CTR, and intent metrics for shops.

  16. Coding questions · Meta

    Compute Shop Visibility Rate Using SQL and Python

    This question evaluates proficiency in data manipulation and metric design using SQL and Python, focusing on event-level aggregation, user deduplication, and definition of a business visibility metric within the Data Manipulation (SQL/Python) domain.

  17. Coding questions · Snowflake

    Compute shortest path between tree nodes

    Given a binary tree and two node values u and v, return the shortest path between them as an ordered list of node values. This Snowflake onsite question tests lowest-common-ancestor logic, path reconstruction, iterative vs. recursive implementation, complexity analysis, and preprocessing strategies (parent pointers, binary lifting, Euler tour + RMQ) for answering many queries efficiently.

  18. Coding questions · Snapchat

    Compute shortest path in a 2D grid

    This question evaluates understanding of graph traversal and pathfinding concepts, including modeling a 2D grid as a graph and reasoning about shortest-path computations and obstacle handling.

  19. Coding questions · Airbnb

    Compute shortest path to collect all keys

    This question evaluates proficiency in state-space representation, graph search and shortest-path techniques, compact state encoding (such as bitmasking), and algorithmic time/space complexity analysis within the Coding & Algorithms domain.

  20. Coding questions · Amazon

    Compute shortest path with obstacles

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

  21. Coding questions · Snapchat

    Compute shortest recursive string encoding

    This question evaluates proficiency in string manipulation, pattern detection, recursion, and dynamic programming for efficient sequence compression in the Coding & Algorithms domain.

  22. Coding questions · OpenAI

    Compute signup rate and retention from raw logs

    This question evaluates the ability to manipulate event-level logs to compute cohort metrics—specifically signup rate and D30 retention—testing proficiency in SQL/Python, event-time windowing, joins, aggregation, and understanding of upstream logging semantics.

  23. Coding questions · Meta

    Compute sparse dot product and count islands

    This question evaluates competency in designing efficient algorithms for sparse data representations and for identifying connected components in grids, testing skills in handling large inputs, memory-efficient representations, and traversal/graph concepts.

  24. Coding questions · Airbnb

    Compute split-stay listing pairs

    This question evaluates the ability to manipulate interval availability data, reason about contiguous date ranges and split boundaries, and design efficient pairing algorithms with attention to time and space complexity.