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

  1. Coding questions · TikTok

    Implement K-means and run two iterations

    This question evaluates understanding of k-means clustering concepts (k-means++ initialization, Lloyd iterations, and SSE) and proficiency in numerical implementation and vectorized array operations.

  2. Coding questions · Amazon

    Implement K-means and solve interval/frequency tasks

    This multi-part question evaluates understanding of K-means clustering, interval-merging algorithms, and frequency-based top-k retrieval, assessing competencies in unsupervised learning concepts, algorithmic problem solving, data structures, and complexity analysis.

  3. Coding questions · Zillow

    Implement k-th largest in a number stream

    This question evaluates proficiency with data structures and order-statistics in a streaming context, focusing on API design and time/space complexity trade-offs within the Coding & Algorithms domain.

  4. Coding questions · Voleon

    Implement Kac ring with O(1) color and kstep

    This question evaluates understanding of algorithmic state representation, modular arithmetic, and efficient update/query design by requiring a Kac ring implementation that supports constant-time k-step advancement and O(1) aggregate color reporting.

  5. Coding questions · Apple

    Implement Kubernetes Service Dependency Queries

    This question evaluates proficiency with data structures and algorithms for service inventory operations, including deterministic filtering, attribute matching, graph traversal for transitive dependency resolution, and status propagation across service graphs.

  6. Coding questions · OpenAI

    Implement KV store and plan type conversions

    This question evaluates proficiency in designing scalable, time-versioned key-value data structures and in graph-based shortest-path planning for costed type conversions, assessing algorithmic thinking, complexity analysis, and robustness under large-scale constraints in the Coding & Algorithms domain.

  7. Coding questions · OpenAI

    Implement KV store serialization

    This question evaluates skills in binary serialization and deserialization, data encoding and layout, type tagging, endianness, checksumming, versioning for forward/backward compatibility, and algorithmic efficiency and space usage for an in-memory key-value store; it falls under the Coding & Algorithms domain.

  8. Coding questions · Citadel

    Implement lazy unique-merge generator for sorted streams

    This question evaluates knowledge of lazy evaluation, Python generators/iterators, merging nondecreasing streams with duplicate elimination, and considerations of time and space complexity in streaming contexts.

  9. Coding questions · Citadel

    Implement left join on Python lists, no packages

    This question evaluates a candidate's ability to implement SQL-style left join semantics using pure Python lists and dictionaries, testing skills in hashing, handling duplicate and missing keys, and reasoning about algorithmic time and space complexity.

  10. Coding questions · Citadel

    Implement Left Join Using Python Dictionaries Efficiently

    This question evaluates competency in tabular data manipulation and join semantics using Python dictionaries, emphasizing understanding of hashing-based lookups and algorithmic complexity such as O(N+M).

  11. Coding questions · Walmart Labs

    Implement lexicographically smallest Two Sum

    This question evaluates array manipulation, index-level reasoning, and algorithmic efficiency for locating pair sums under lexicographic tie-breaking, testing attention to ordering constraints and correct index selection.

  12. Coding questions · Amazon

    Implement list overlap and dense-ranked word frequencies

    This question evaluates a data scientist's ability to implement efficient multiset intersection and streaming top-k word-frequency computations, covering duplicate-aware counting, dense-ranking, Unicode handling, and strict time/space constraints.

  13. Coding questions · Rippling

    Implement logger and card ranking

    This question evaluates API and system design, configurable string processing and state management for a logger (including search and complexity considerations), as well as algorithmic reasoning for card-hand ranking, sorting, and tie-breaking logic.

  14. Coding questions · Netflix

    Implement longest increasing subarray with one deletion

    This question evaluates proficiency in array algorithms and algorithmic optimization, focusing on handling boundary cases, reconstructing index ranges, and meeting strict O(n) time and O(1) extra-space constraints.

  15. Coding questions · Amazon

    Implement LRU cache with O(1) ops

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement LRU cache with O(1) ops states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  16. Coding questions · Intuit

    Implement LRU, Extend to LFU, Analyze Complexity

    This question evaluates understanding of cache eviction policies (LRU and LFU), frequency tracking, and the design of data structures that support efficient get/put operations while meeting time and space complexity constraints.

  17. Coding questions · Pinterest

    Implement LRUCache with O(1) Operations and Thread Safety

    This question evaluates a candidate's ability to implement a constant-time LRU cache and reason about thread-safety and concurrent access, testing data structure design and concurrency competencies in the Coding & Algorithms domain.

  18. Coding questions · Stripe

    Implement Luhn-based card validation and inference

    A Stripe software-engineer take-home that builds up a credit-card validation suite using the Luhn checksum and VISA/MASTERCARD/AMEX brand patterns. It progresses from exact validation and brand identification to an UNKNOWN fallback, analytic wildcard counting per brand, and single-error correction that enumerates all valid original numbers.

  19. Coding questions · OpenAI

    Implement map serialization and deserialization

    This question evaluates understanding of serialization, string encoding and parsing, data structure invariants (invertibility), and efficiency when representing maps with arbitrary string keys and values.

  20. Coding questions · Instacart

    Implement matrix-indexing and expression resolver

    This question evaluates a candidate's ability to parse structured text files, perform matrix indexing with a nonstandard origin convention, reconstruct data across multiple blocks, and resolve symbolic variable expressions and dependencies for arithmetic evaluation in the Coding & Algorithms domain.

  21. Coding questions · WeRide

    Implement matrix multiplication and fast exponentiation

    This question evaluates competency in matrix multiplication, modular arithmetic, and exponentiation algorithms as applied to large-scale numeric computations such as sequence generation.

  22. Coding questions · Citadel

    Implement max profit with K transactions (DP)

    This question evaluates dynamic programming, algorithmic optimization, and complexity-analysis skills by requiring a bottom-up DP implementation that maximizes stock trading profit with at most k transactions while returning optimal buy-sell pairs under tie-breaking constraints.

  23. Coding questions · Two Sigma

    Implement merge sort and largest 1-rectangle

    This question evaluates proficiency in implementing and analyzing classic algorithms, specifically merge sort for array sorting and techniques for computing the largest all-ones rectangular submatrix in a binary matrix, testing algorithmic thinking, data structure manipulation, and time/space complexity reasoning.

  24. Coding questions · Thumbtack

    Implement min, mean, median robustly

    This question evaluates implementation skills in basic descriptive statistics (min, mean, median), numerical stability in online aggregation methods, robust handling of edge cases like None/NaN and extreme numeric ranges, and algorithmic complexity reasoning in the Coding & Algorithms domain for a Data Scientist role.