READ. UNDERSTAND. PRACTICE.
Coding questions
Explore algorithm tutorials, coding and system design questions, interview experiences, and computer science study guides.
1,899 resources · Page 48 of 80
Coding questions · Bloomberg
Implement classes within an abstract Python framework
This question evaluates a candidate's skills in object-oriented design, implementing concrete classes from abstract interfaces, file I/O and streaming data transformations, error handling, and integration with a registry and CLI within a Python codebase.
Coding questions · Coinbase
Implement cloud storage with quotas and compression
This question evaluates the ability to design and implement in-memory state management and algorithmic logic for user-scoped storage, including capacity tracking, deterministic eviction policies, file metadata manipulation, and integer/string operations.
Coding questions · Anthropic
Implement cluster status tracker
This question evaluates a candidate's competence in data structures and algorithms for time-ordered state tracking, time-series indexing, conflict resolution (last-write-wins), memory-efficient storage, and concurrent system behavior under high update rates.
Coding questions · UiPath
Implement cocktail shaker sort and analyze
This question evaluates a candidate's understanding of sorting algorithms and algorithmic optimization, specifically implementation and enhancement of cocktail shaker sort, plus analysis of time and space complexity, stability, and counts of comparisons and swaps.
Coding questions · OpenAI
Implement compile-time function type verification
This question evaluates proficiency in C++ template metaprogramming, type traits, SFINAE and Concepts for compile-time callable signature verification, including handling of noexcept, cv/ref qualifiers and implicit conversions.
Coding questions · Airbnb
Implement Connect Four game
This question evaluates implementation skills for game state management, move handling, and efficient winner-detection algorithms, testing competence in data structures, algorithmic complexity analysis, and correctness under edge cases.
Coding questions · Virtu Financial
Implement Connect Four Winner Detection
This question evaluates the ability to design and implement game-state logic for a Connect Four-style board, covering board data structures, coordinate and boundary handling, gravity-based token placement, and efficient pattern detection for consecutive tokens in the Coding & Algorithms domain.
Coding questions · Jane Street
Implement Connect Four with bottom push-up
This question evaluates proficiency in data structures, algorithm design, state management, and API design for game mechanics, focusing on board representation, move operations, win detection, and undo/redo functionality.
Coding questions · Shopify
Implement Cosine Similarity Function for String Vectors
This question evaluates understanding of vector-space similarity and text representation by asking for a cosine similarity computation over string-derived vectors, testing coding and algorithmic skills relevant to data science and text processing.
Coding questions · OpenAI
Implement credit ledger with out-of-order timestamps
This question evaluates the ability to implement stateful event processing with out-of-order timestamps, correct ledger/accounting semantics including timestamp ordering and explicit tie-breaking between adds and charges.
Coding questions · Coinbase
Implement cursor-based query pagination
This question evaluates understanding of cursor-based pagination, deterministic ordering with tie-breakers, cursor encoding, and in-memory data-structure management for efficient filtered queries.
Coding questions · Amazon
Implement decoder-only GPT-style transformer
This question evaluates implementation-level mastery of transformer architectures, including multi-head masked self-attention, position-wise feed-forward networks, residual connections, and precise tensor-shape reasoning for a decoder-only language model, within the Coding & Algorithms domain of deep learning and neural network engineering.
Coding questions · Roblox
Implement deduped CTR/RPM aggregator over event stream
This question evaluates competence in streaming event processing and deduplication, including stateful aggregation, time-window management, handling out-of-order and duplicate events, and computing CTR/RPM metrics.
Coding questions · Pinterest
Implement DelayQueue with Idempotent Task Execution
This question evaluates implementation skills in time-based task scheduling, idempotent execution semantics, and concurrency control, emphasizing data-structure selection and synchronization trade-offs.
Coding questions · Amazon
Implement DFS and tree algorithms
This question evaluates graph traversal and tree-algorithm competencies, specifically depth-first search for connected components and binary tree operations such as level-order traversal and height-balance checking, including complexity analysis and scalability considerations for very large sparse graphs.
Coding questions · Apple
Implement DFS for connected components
This question evaluates a candidate's ability to implement depth-first search for connected components, covering both recursive and iterative implementations while testing understanding of stack-safety, time and space complexity, and edge-case testing.
Coding questions · TikTok
Implement distinct islands and sliding maxima
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 distinct islands and sliding maxima states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding questions · Squarepoint
Implement drawdown, single-trade profit, coin change
This question evaluates a candidate's algorithmic problem-solving skills across array and time-series processing, greedy optimization, and dynamic programming, requiring implementation and complexity analysis of maximum drawdown, single-trade profit, and coin change problems within the Coding & Algorithms domain for a Data Scientist role.
Coding questions · Amplitude
Implement Employee Validation and Snake
This question evaluates recursion, graph traversal and cycle-detection concepts for hierarchical employee validation alongside state management, event-driven input handling and collision detection for a grid-based Snake game.
Coding questions · NVIDIA
Implement encode/decode for list of strings
This question evaluates a candidate's proficiency in string manipulation and serialization techniques, focusing on designing an invertible encode/decode scheme for lists of strings.
Coding questions · Pitchbook
Implement Euclidean distance and k-nearest neighbors
This question evaluates understanding of Euclidean distance metrics, vector arithmetic, and nearest-neighbor retrieval, testing implementation skills for computing distances and selecting the k closest points.
Coding questions · OpenAI
Implement expiring credit ledger
This question evaluates the ability to design efficient time-based data structures and algorithms for managing expiring credits with ordering and tie-breaking rules, testing competencies in event ordering, interval management, and retroactive update handling; it is in the Coding & Algorithms domain and emphasizes practical application of algorithmic and data-structure reasoning. It is commonly asked to verify correctness under out-of-order inserts and queries, to assess performance and complexity analysis for add/charge/get operations, and to require clear specification of time and space complexity for the proposed approach.
Coding questions · ByteDance
Implement Expiring LRU Cache
This question evaluates skill in designing and implementing efficient in-memory caching data structures, testing understanding of LRU eviction, per-entry TTL expiration, and the use of hash maps and linked lists for O(1) operations.
Coding questions · Meta
Implement exponentiation and link tree neighbors
This question evaluates numerical algorithm implementation and in-place tree traversal skills, specifically fast exponentiation with careful edge-case and precision handling and iterative linking of next pointers in a perfect binary tree.