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

  1. Coding questions · Databricks

    Implement a snapshotable set with iterators

    This question evaluates understanding of persistent/versioned data structures, iterator semantics, concurrency control, and complexity-aware design for mutable sets, and is categorized under Coding & Algorithms.

  2. Coding questions · Aeonea

    Implement a tennis score tracker

    This question evaluates a candidate's ability to implement stateful scoring logic and choose appropriate data structures for tracking sequential events, specifically handling tennis scoring rules such as 0/15/30/40 progression, Deuce, Advantage, and the two-point lead requirement.

  3. Coding questions · Revolut

    Implement a thread-safe money transfer

    This question evaluates a candidate's mastery of concurrent programming and data-integrity principles, focusing on thread safety, atomic state updates, and deadlock avoidance when transferring funds between shared accounts.

  4. Coding questions · Snapchat

    Implement a thread-safe rate limiter

    This question evaluates a candidate's ability to design and implement a thread-safe per-user API rate limiter, focusing on concurrency control, synchronization techniques, and time-based request accounting in the Coding & Algorithms domain.

  5. Coding questions · Microsoft

    Implement a Tic-Tac-Toe game class

    This question evaluates a candidate's competence in designing efficient stateful data structures and algorithmic optimization for an n×n game implementation, focusing on time-space trade-offs and robust API design.

  6. Coding questions · Klaviyo

    Implement a Transactional Parcel-Tracking Store

    Implement a transactional in-memory parcel store with event totals, modification-based ranking, courier assignments, release, undo, and sign-out. Follow the exact blocking, snapshot, deletion, ownership, return-value, and counter rules across up to 100,000 operations.

  7. Coding questions · Lead Bank

    Implement a versioned hash map with snapshot

    This question evaluates understanding of versioned hash maps, time-travel key-value stores, temporal retrieval semantics, and snapshot creation, testing algorithms and data-structure design in the Coding & Algorithms domain and emphasizing practical implementation with conceptual reasoning about correctness and timestamp semantics.

  8. Coding questions · Meta

    Implement a versioned in-memory DB with CAS and history

    This question evaluates a candidate's ability to design and implement time-versioned in-memory data structures, conditional concurrency primitives (compare-and-set and compare-and-delete), TTL expiration semantics, and efficient historical reads.

  9. Coding questions · Persona

    Implement a Versioned Key-Value File Store

    Practice a Persona coding interview problem focused on implement a versioned key-value file store. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

  10. Coding questions · Netflix

    Implement a Versioned Key-Value Store

    This question evaluates understanding of time-versioned data storage, related data-structure selection, handling of overwrite semantics at equal timestamps, and the ability to reason about correctness and complexity trade-offs.

  11. Coding questions · Atlassian

    Implement agent voting with average and sorting

    This question evaluates the ability to design in-memory data structures and algorithms for recording and aggregating agent votes, including computing average ratings, sorting by aggregate score with tie-breaking, handling update semantics for repeated votes, and accounting for items with no votes.

  12. Coding questions · Asana

    Implement an ASCII Art Printer

    This question evaluates the ability to implement text rendering and string/array manipulation concepts, including glyph concatenation with inter-character spacing, newline-preserved blocks, blank glyph rendering for spaces, and handling of unsupported characters.

  13. Coding questions · OpenAI

    Implement an expiring GPU-credit manager

    This question evaluates understanding of efficient data structures, algorithmic complexity, concurrency control, and time-based resource accounting required to implement an expiring GPU-credit manager.

  14. Coding questions · OpenAI

    Implement an expiring GPU credits ledger

    This question evaluates understanding of time-based resource accounting, design of data structures for expiring balances, atomic update semantics for concurrent operations, and algorithmic time/space complexity within the Coding & Algorithms domain.

  15. Coding questions · Meta

    Implement an Expiring Record Store

    This question evaluates skills in designing and implementing an in-memory, level-based key-field-value store with lexicographic scanning, time-based versioning, TTL semantics, and efficient mutation operations.

  16. Coding questions · Anthropic

    Implement an extensible prefix tree

    This question evaluates the ability to design and implement an extensible prefix tree (trie), covering competencies in Unicode-aware string handling, memory and time optimization, concurrency or thread-safety considerations, and support for operations like insert, search, startsWith, countPrefix and erase.

  17. Coding questions · xAI

    Implement an in-memory database with TTL and backup

    This question evaluates proficiency in designing and implementing mutable in-memory data structures, field-level CRUD and scanning, timestamped operations with TTL semantics, and backup/restore snapshot management, focusing on data structures, temporal reasoning, and state management in the Coding & Algorithms domain.

  18. Coding questions · Instacart

    Implement an In-Memory File Storage System

    This question evaluates the ability to design and implement efficient in-memory data structures and algorithms for stateful file management, covering string-keyed storage, size accounting, querying and sorting, and user quota enforcement.

  19. Coding questions · Meta

    Implement an in-memory key-field-value DB with TTL

    This question evaluates implementation skills in efficient in-memory data structures, time-to-live (TTL) expiration semantics, ordered and prefix scans, and snapshot backup/restore mechanisms.

  20. Coding questions · OneMain Financial

    Implement an LRU cache with O(1) ops

    This question evaluates proficiency in data structures, algorithmic complexity analysis, and system-level concerns such as concurrency, eviction semantics, and optional per-key TTL behavior when implementing an efficient cache.

  21. Coding questions · Bloomberg

    Implement anagram check and odd-even linked list

    This multi-part question evaluates string-processing and frequency-counting skills for anagram detection and linked-list pointer manipulation for reordering nodes by index parity, testing competency in algorithmic implementation and in-place data structure updates.

  22. Coding questions · DoorDash

    Implement and compare round-robin and consistent hashing

    This question evaluates a candidate's ability to implement and reason about load balancing algorithms (round-robin and consistent hashing), covering competencies in data structures, hashing, concurrency, correctness, and unit testing.

  23. Coding questions · Nextdoor

    Implement and use a version comparator

    Implement and use a version comparator 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.

  24. Coding questions · Warner Bros Discovery

    Implement array rotations and CSV keyword search

    This question evaluates array manipulation and string parsing competencies, focusing on rotating arrays via modular index arithmetic and locating substring occurrences within a simple CSV while mapping each match to row, column, and character position.