practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 421–450 of 1706 results
- CoinbaseMediumSoftware EngineerImplement a Flappy Bird Jump Agent
This problem tests your ability to design a simple heuristic-based agent that navigates a 2D environment by calculating clearance intervals and applying physics-based jump logic.
Coding & AlgorithmsTechnical ScreenSimulationHeuristicsPhysics - CoinbaseMediumSoftware EngineerImplement bank account with cashback
This question evaluates implementation skills in sequential operation processing, integer arithmetic, control flow, edge-case handling, and overflow awareness within algorithmic constraints.
Coding & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerImplement bank balance operations
This question evaluates object-oriented programming, state management, input validation, and arithmetic correctness when implementing account operations and maintaining transactional invariants.
Coding & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerImplement basic pagination for a list
This question evaluates a candidate's competence in array indexing, boundary-condition handling, and simple pagination logic, focusing on correct subarray extraction and off-by-one considerations within given size constraints.
Coding & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerImplement 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 & AlgorithmsTechnical Screen - CoinbaseMediumSoftware EngineerPaginate 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.
Coding & AlgorithmsTechnical Screen - CollegevineMediumSoftware EngineerFind the Highest-Cost Top-Level Job
This question evaluates the ability to process hierarchical JSON data, aggregate durations across tree-structured job relationships, and reason about robustness and scalability concerns such as malformed input handling and performance for large datasets.
Coding & AlgorithmsTechnical Screen - CommureHardSoftware EngineerFilter People by Optional Criteria
Implement stable filtering for person records across optional inclusive age and salary bounds plus an optional occupation set. Every enabled criterion must match, disabled bounds use None, and neither the input list nor its records may be mutated.
Coding & AlgorithmsTechnical Screen - ConfluentMediumSoftware EngineerImplement tail N lines
Confluent software-engineer technical-screen coding question: implement tail(path, N) to print the last N lines of a possibly multi-GB file or an unbounded stream without loading it into memory. It tests a backward block scan for seekable files versus an O(N) ring buffer for non-seekable streams, plus correct handling of \n/\r\n/\r newlines, UTF-8 multibyte characters, missing trailing newlines, and extremely long lines, with follow-ups on tail -f, log rotation/truncation, and the -c last-N-bytes option.
Coding & AlgorithmsTechnical Screen - ConfluentEasySoftware EngineerProcess pod logs with global increments and pop-min
This problem tests your ability to manage a collection of values under global update operations while maintaining the ability to efficiently extract the minimum value.
Coding & AlgorithmsTechnical ScreenHeapsData StructuresAlgorithms - ConfluentMediumSoftware EngineerSolve constrained monster traversal
Solve constrained monster traversal 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.
Coding & AlgorithmsTechnical Screen - CortexMediumSoftware EngineerParse API JSON and print org chart
This question evaluates HTTP and JSON parsing, CSV processing, hierarchical data modeling, sorting, and algorithmic efficiency for building and printing an organizational chart.
Coding & AlgorithmsTechnical Screen - CoupangEasySoftware EngineerFind the Closest Value in a Binary Search Tree
This question tests your ability to traverse a binary search tree efficiently by leveraging its ordering property to find the node value closest to a given target number.
Coding & AlgorithmsTechnical ScreenBinary Search TreeBinary TreeTree Traversal - CourseraHardSoftware EngineerImplement Plurality and Runoff Voting
This question evaluates understanding of voting algorithms, tie-breaking rules, ballot processing, and correctness under edge cases such as incomplete or exhausted ballots, and is commonly asked to assess algorithmic implementation, state simulation, and careful handling of corner cases in interview settings.
Coding & AlgorithmsTechnical Screen - CourseraHardBackend EngineerImplement Popular and Ranked Voting
This question evaluates algorithmic implementation skills and understanding of voting systems, including aggregation of first-place preferences and the conceptual mechanics of elimination-based ranked-choice counting.
Coding & AlgorithmsTechnical Screen - Credit GenieMediumSoftware EngineerImplement and analyze number-pattern function
This question evaluates algorithmic thinking and implementation skills related to string construction, time and auxiliary space complexity analysis, and handling boundary/edge-case off-by-one errors.
Coding & AlgorithmsTechnical Screen - CrusoeMediumSoftware EngineerCalculate charge with a single price override
This problem tests your ability to handle overlapping time intervals and apply conditional overrides to calculate the total charge for a billing period.
Coding & AlgorithmsTechnical ScreenIntervalsArraysLogic - CubistMediumSoftware EngineerRebuild a binary search tree from its postorder traversal in linear time
Rebuild a binary search tree with distinct values from its postorder traversal and return the rebuilt tree's preorder traversal. The problem tests BST ordering properties, traversal orders, and meeting a strict O(n) time bound on inputs that include deeply skewed trees.
Coding & AlgorithmsTechnical Screen - CursorHardSoftware EngineerImplement a Merkle-tree repo diff
This question evaluates a candidate's understanding of Merkle trees, filesystem-aware hashing, directory traversal, and diff algorithms for detecting file-level changes.
Coding & AlgorithmsTechnical Screen - DRWEasySoftware EngineerFewest Expenses to Defer to Year End So the Running Balance Never Goes Negative
Given a year's transactions in order, with income as positive values, expenses as negative values and a non-negative total, find the fewest expenses to move to the end of the year so the running balance never drops below zero. It tests reasoning over prefix sums for inputs of up to 100,000 transactions.
Coding & AlgorithmsTechnical Screen - DRWEasySoftware EngineerLongest Substring in Which Every Present Letter Occurs Equally Often
Given a string of lowercase letters, find the length of the longest substring in which every letter that appears occurs the same number of times. It tests substring enumeration with incremental frequency tracking and a precise definition of what counts as balanced.
Coding & AlgorithmsTechnical Screen - DRWEasySoftware EngineerMinimize the Max-Min Gap of an Array After Changing Up to Three Elements
Given an integer array, you may change up to three elements to any values; return the smallest possible difference between the largest and smallest values afterward. It tests reasoning about which extreme values are worth changing and careful handling of short arrays.
Coding & AlgorithmsTechnical Screen - Dark Alpha CapitalMediumSoftware EngineerMinimize Total Assignment Distance
This question evaluates competency in combinatorial optimization, assignment/matching problems, and reasoning about Manhattan distance cost metrics. Commonly asked to assess algorithmic reasoning about constrained assignments, search and complexity trade-offs, it belongs to the Coding & Algorithms domain and emphasizes practical application of algorithm design and implementation rather than purely conceptual theory.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerCheck if CIDR is fully canceled by rules
This question evaluates understanding of IPv4 CIDR arithmetic, set operations on IP ranges (overlap detection and subtraction), and ordered rule semantics for allow/deny processing.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerChoose fastest transportation mode on city grid
This problem tests your ability to model a grid-based transportation network as a graph and apply Dijkstra's algorithm to find the optimal path under multiple constraints.
Coding & AlgorithmsTechnical ScreenGraphsDijkstraShortest Path - DatabricksMediumSoftware EngineerCompute 5-minute rolling average load
This problem tests your ability to maintain a rolling window average over a high-throughput stream of events using an efficient data structure that balances memory usage and query time complexity.
Coding & AlgorithmsTechnical ScreenSliding WindowData StructuresTime Series - DatabricksMediumSoftware EngineerCompute last-5-minute QPS in memory
This question evaluates design of in-memory data structures and sliding-window time-series aggregation for real-time metrics, testing understanding of space/time trade-offs, streaming algorithms, and handling monotonic timestamps.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerDesign BFS to detect forced win in Tic-Tac-Toe
This question evaluates algorithm design and search-space reasoning, focusing on BFS-based game-tree exploration, state representation, symmetry reduction and hashing, win/draw detection, pruning and move-ordering heuristics, and time/space complexity analysis in terms of n, k, t, and the branching factor within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - DatabricksMediumSoftware EngineerDesign IP/CIDR rule matcher
This question evaluates understanding of IPv4 addressing, CIDR and numeric range representations, plus competency in designing efficient data structures and algorithms for low-latency rule matching with dynamic updates.
Coding & AlgorithmsTechnical Screen - DatabricksMediumMachine Learning EngineerDesign In-Memory QPS Counter
This question evaluates the ability to design and implement an in-memory time-series counter and sliding-window aggregation, emphasizing efficient data structures, handling high-frequency events, and memory-time trade-offs.
Coding & AlgorithmsTechnical Screen
Coinbase
Confluent
Coupang
Cursor
DRW
Databricks