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 61 of 80

  1. Coding questions · TikTok

    Optimize Job Routing in Parallel Machine Scheduling

    This question evaluates understanding of online scheduling and algorithmic decision-making, specifically skills in minimizing average flow-time when routing jobs to parallel machines.

  2. Coding questions · Meta

    Optimize Oculus Data Streaming with Bandwidth Constraints

    This question evaluates a candidate's ability in algorithm design and problem decomposition for array segmentation and interval coverage, focusing on reasoning about cumulative constraints for streaming data and geometric interval intersections.

  3. Coding questions · Citadel

    Optimize password transform and discount scheduling

    Optimize password transform and discount scheduling 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.

  4. Coding questions · Meta

    Optimize repeated-value vectors and compute exclusive times

    This question evaluates proficiency in data-structure and algorithmic concepts such as run-length encoding for compressed vectors and interval/nesting reasoning for computing exclusive execution times.

  5. Coding questions · Meta

    Optimize ribbon piece length by binary search

    This question evaluates understanding of binary-search-on-answer techniques and monotonic predicates, complexity analysis, and implementation-level handling of integer overflow and extreme edge cases in numeric partitioning, situated in the coding and algorithms domain and emphasizing practical implementation considerations rather than purely theoretical proofs. It is commonly asked because it reveals whether an interviewee can reason about monotonicity and design an O(n log max(lengths)) solution that remains robust under very large k, large element values, and potential integer overflow.

  6. Coding questions · Meta

    Optimize SQL to minimize scans

    This question evaluates proficiency in SQL query optimization, specifically minimizing table scans, choosing between CTEs and derived tables, applying aggregation strategies, and interpreting execution plans.

  7. Coding questions · TikTok

    Optimize Station Sequence for Maximum Car Output in Simulation

    This question evaluates a candidate's skills in scheduling and throughput optimization, including queue management and simulation-based performance analysis within constrained buffering and station sequencing.

  8. Coding questions · Meta

    Optimize Travel Costs and Generate Rotational Symmetric Numbers

    This question evaluates algorithmic optimization and complexity-analysis skills by combining array-based time-dependent pricing for round-trip cost minimization with combinatorial generation of rotationally symmetric (strobogrammatic) k-digit numbers.

  9. Coding questions · Vanta

    Order Classes by Prerequisites with Recursive DFS

    Build a deterministic prerequisite ordering with recursive depth-first search. Handle disconnected classes and detect dependency cycles by tracking both active and completed nodes.

  10. Coding questions · OpenAI

    Order Tasks with Dependencies Using a Deterministic Topological Sort

    Return the lexicographically smallest valid task order from a directed acyclic dependency graph, including disconnected and prerequisite-free tasks.

  11. Coding questions · Reevo

    Output lexicographically largest DFS traversal

    This question evaluates understanding of graph traversal algorithms and combinatorial reasoning about node visitation order, specifically assessing the ability to manipulate depth-first search choices to produce a lexicographically maximal global sequence.

  12. Coding questions · LinkedIn

    Overlay two binary trees into one by summing values at shared positions

    Merge two binary trees by overlaying them from the root: positions present in both trees become one node holding the sum of the two values, and positions present in only one tree keep that tree's node. It tests simultaneous tree traversal, handling of missing children and level-order serialization.

  13. Coding questions · Coinbase

    Paginate forward and backward through results

    This question evaluates understanding of pagination mechanics, cursor/token design, array indexing, and state management for bidirectional (forward and backward) navigation.

  14. Coding questions · Instacart

    Parse a password from a matrix

    This question evaluates proficiency in grid traversal, sequence-driven state tracking, string manipulation, and boundary/obstacle validation while requiring time and space complexity reasoning.

  15. Coding questions · Microsoft

    Parse a Signed Integer in an Arbitrary Base

    Parse signed integers in bases 2–36 with explicit syntax, negative-boundary handling, pre-arithmetic overflow checks, and deterministic error precedence.

  16. Coding questions · Uber

    Parse and evaluate nested expressions with validation

    This question evaluates a developer's ability to design and implement a robust parser and evaluator for a parenthesized expression language, testing parsing, lexical scoping and variable binding, operator semantics, error detection, and safe integer arithmetic.

  17. Coding questions · Liftoff

    Parse and expand an IPv6 address

    This question evaluates proficiency in IPv6 address parsing, string validation, and canonicalization, testing understanding of hexadecimal hextets and the zero-compression (::) rule within the Coding & Algorithms domain.

  18. Coding questions · Anthropic

    Parse and Reconstruct Stack Trace

    This question evaluates parsing and string-processing skills, hierarchical data structure design for call-tree reconstruction, exception trace analysis, and algorithmic complexity reasoning for robust log handling.

  19. Coding questions · TikTok

    Parse chemical formula with multipliers

    Parse chemical formula with multipliers 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.

  20. Coding questions · Kikoff

    Parse CSV and format transactions

    This question evaluates a candidate's ability to parse and format structured transactional data, emphasizing CSV parsing, trimming whitespace, numeric formatting to two decimal places, and preserving input row order.

  21. Coding questions · Oracle

    Parse logs and query by time

    This question evaluates competency in parsing and structuring log lines, interpreting timestamps and time zones, handling malformed input, designing insert/query APIs, reasoning about scalability and indexing, performing time/space complexity analysis, and planning basic tests.

  22. Coding questions · eBay

    Pass functions and analyze basic data structures

    This question evaluates proficiency with higher-order functions, passing functions or delegates, closures, and reasoning about side effects, alongside the ability to analyze fundamental data structures and their performance characteristics.

  23. Coding questions · Databricks

    Path Between Two Preorder-Numbered Nodes of an Implicit Fibonacci Tree

    Given the order of a recursively defined Fibonacci tree and two nodes labeled by preorder number, return the path between them without building a tree that can hold trillions of nodes. Tests recursive subtree-size reasoning, implicit tree navigation and 64-bit index arithmetic.

  24. Coding questions · Ramp

    Per-IP Sliding-Window Rate Limiter: Accept or Reject Each Request

    Implement a per-IP sliding-window rate limiter: given request timestamps, IP addresses, a request limit and a window length, decide in order whether each request is accepted or rejected. Tests exact window-boundary semantics, per-IP state, and processing a request log efficiently.