READ. UNDERSTAND. PRACTICE.
Interview questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,290 resources · Page 40 of 54
Interview questions · Anthropic
Implement crawler, dedup, and persistent LRU
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 crawler, dedup, and persistent LRU states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Coinbase
Implement custom iterator classes
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 custom iterator classes states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Upstart
Implement decay simulation and trailing-zero counting
This Coding & Algorithms question for a Data Scientist role evaluates stochastic simulation and probability modeling for radioactive decay alongside combinatorics and number-theoretic reasoning for factorial trailing-zero computation, requiring implementation-level algorithmic thinking in Python.
Interview questions · Apple
Implement deep clone for complex objects
This question evaluates mastery of deep object cloning, reference and memory management, and knowledge of language runtime details such as prototypes, property descriptors, symbol-keyed and non-enumerable properties, and built-in types like Maps, Sets, Dates, RegExps, and typed arrays.
Interview questions · Qube Research & Technologies
Implement flat_map, redistribute wealth evenly
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 flat_map, redistribute wealth evenly states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Interview questions · Meta
Implement four coding challenges
This set of four problems evaluates algorithmic problem-solving and implementation skills across deterministic simulation (grid-based placement), dynamic interval/segment maintenance, incremental numeric tracking, and greedy array transformation, emphasizing correctness, state management, and complexity reasoning.
Interview questions · DoorDash
Implement image carousel with comments and upvotes
This question evaluates a candidate's ability to design scalable data structures and efficient algorithms for interactive features, including API design, pagination, and consistency/concurrency handling for upvotes and per-image comment threads.
Interview questions · Coinbase
Implement iterators and write tests in Java
Implement iterators and write tests in Java 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.
Interview questions · Tubi
Implement K-Means and compare with GMM
This question evaluates understanding and practical implementation of clustering algorithms, specifically K-Means centroid initialization, assignment and update mechanics, convergence criteria and edge-case handling, along with comparative knowledge of Gaussian Mixture Models and the Expectation-Maximization training framework.
Interview questions
Implement KNN from scratch
This question evaluates understanding of the k-Nearest Neighbors algorithm, distance metrics (Euclidean and cosine), tie-breaking with class priors, weighted voting, complexity analysis, and scalability strategies, testing competencies in algorithm implementation, model behavior, and computational trade-offs.
Interview questions · Meta
Implement list cloning and k-frequency finder
The first part evaluates understanding of linked data structures and deep-copy semantics, focusing on preserving node values and both next and arbitrary random pointer relationships while reasoning about node identity and cycles, and is commonly asked to assess correctness in memory/reference handling and structural preservation.
Interview questions · Elastic
Implement log aggregation in React
This question evaluates a candidate's front-end development and real-time data-aggregation skills, specifically React component state management, handling streaming updates, choosing appropriate in-memory data structures (e.g., Map), and timestamp parsing/comparison for per-category frequency and last-update tracking.
Interview questions · Snapchat
Implement LRU cache and prime products array
This question evaluates proficiency in implementing efficient mutable data structures and in enumerating combinatorial results, specifically testing understanding of LRU cache eviction behavior and generation of all non-empty subset products from a set of primes.
Interview questions · CloudKitchens
Implement menu parser and serializer
This question evaluates proficiency in text parsing, hierarchical data modeling, tree construction and serialization, string manipulation, and algorithmic complexity (linear time/space).
Interview questions · Meta
Implement merge-in-place and group cyclic-equivalent strings
This question evaluates array-manipulation and string-normalization competencies, specifically in-place merging of sorted arrays without extra space and grouping strings by cyclic-shift equivalence.
Interview questions · TikTok
Implement O(1) randomized multiset
Implement O(1) randomized multiset 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.
Interview questions · Citadel
Implement Piecewise Linear Interpolation and Extrapolation
Implement piecewise linear interpolation from unsorted knots, including exact-knot behavior and endpoint extrapolation. Practice paired sorting, binary search, and numerical edge cases.
Interview questions · Coursera
Implement plurality and majority voting
This question evaluates skills in frequency-based selection and majority detection, including handling tie-breaking rules and applying linear-time, constant-space algorithms such as the Boyer–Moore majority vote.
Interview questions · Instacart
Implement prefix and suffix file search
This question evaluates the ability to design and implement efficient string-indexing data structures and APIs for prefix-and-suffix matching, demonstrating competency with tries, suffix-related structures, inverted indexes, and time/space complexity trade-offs.
Interview questions · Amazon
Implement robust debounce and throttle in JavaScript
This question evaluates a developer's ability to implement debounce and throttle utilities in JavaScript, testing competencies in asynchronous timing, timer management, cancellation/flush semantics, error propagation, and handling edge cases such as rapid bursts, timer drift, and re-entrancy.
Interview questions · Amazon
Implement robust word counts and min/max
This question evaluates proficiency in large-scale text processing, Unicode-aware tokenization and normalization, memory-efficient streaming and frequency counting (including implementing counting with plain dicts), and designing robust safe_min/safe_max semantics to handle NaNs, mixed comparable types, and stability concerns.
Interview questions · Bloomberg
Implement RotatingFileSink in hierarchy
This question evaluates a candidate's proficiency in Python object-oriented design, file I/O and JSON serialization, concurrency control via locking, context manager protocols, custom exception handling, and adherence to Liskov substitution when implementing a rotating file sink.
Interview questions · ByteDance
Implement several OA simulation problems
This set of problems evaluates skills in string processing, memory simulation and allocation logic, and online data-structure maintenance for dynamic contiguous segment counting, testing algorithmic design and attention to stateful invariants.
Interview questions · DRW
Implement simulation-based portfolio optimizer in Python
Implement simulation-based portfolio optimizer in Python evaluates SQL or pandas logic, joins, grouping, window functions, null handling, edge cases, and validation in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.