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 841–870 of 3276 results
- Concentric AiMediumSoftware EngineerMaximize Profit Under a Bitwise-OR Limit
Find a subset of items whose cumulative bitwise OR does not exceed a given limit such that the total profit is maximized.
Coding & AlgorithmsOnline Assessmentbit-manipulationgreedyarrays - Concentric AiMediumSoftware EngineerMinimize Population-Weighted Manhattan Travel Cost
This problem tests the ability to optimize a weighted distance metric by leveraging the independent nature of x and y coordinates in Manhattan geometry.
Coding & AlgorithmsOnline AssessmentArraysSortingMath - ConfluentMediumSoftware EngineerCheck Whether a Partially Filled 9x9 Sudoku Board Is Valid
A coding problem that asks whether a partially filled 9x9 Sudoku board is consistent, meaning no row, column or 3x3 box repeats a digit among its filled cells. It tests careful bookkeeping of row, column and box membership without attempting to solve the puzzle.
Coding & AlgorithmsOnsite - ConfluentMediumSoftware EngineerImplement File Tail and Sensor Health
This problem tests your ability to efficiently read the end of a growing file using file pointers and to implement a sliding time-window check for sensor heartbeat events.
Coding & AlgorithmsOnsiteI/OHash MapStreaming - ConfluentMediumSoftware EngineerImplement Tail and Find Monster Cost
This question evaluates competency in efficient file I/O and streaming techniques for implementing tail, and in graph search and shortest-path algorithms with path reconstruction for computing minimum monster cost in a grid.
Coding & AlgorithmsOnsite - 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 - ConfluentMediumSoftware EngineerMatch Argument Type Lists Against Function Signatures with Variadic Parameters
A coding problem about resolving function calls: given a library of function signatures, some variadic in their last parameter, return every function that accepts each queried list of argument types. It tests precise matching rules, indexing signatures for many queries and deterministic output ordering.
Coding & AlgorithmsOnsite - 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 EngineerRank songs by pairwise user preferences
This question evaluates the ability to aggregate pairwise user preferences, implement majority-based comparison rules with deterministic tie-breakers, and compute a global ranking via beat counts.
Coding & AlgorithmsOnline Assessment - ConfluentMediumSoftware EngineerSolve Signature, File, and Queue Problems
This multi-part prompt evaluates skills in function signature and type matching, resource-constrained file I/O and streaming for large files, and data-structure design for randomized queues including multiset equality, synchronization, and compact run-length encodings.
Coding & AlgorithmsOnsite - 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 - ConfluentMediumSoftware EngineerValidate and Complete a Partially Filled 9x9 Sudoku Board
A coding problem that checks a partially filled 9x9 Sudoku board and completes it when possible. Solutions must detect givens that already break the row, column or box rules, recognize boards with no valid completion, and return a canonical completed grid, testing constraint checking and search.
Coding & AlgorithmsOnsite - CoreweaveMediumSoftware EngineerImplement web data fetch and storage tool
This question evaluates proficiency in HTTP client communication with token-based authentication, parsing structured responses into data models, relational database interaction including handling duplicate records, configuration management, and robust error handling and testing.
Coding & AlgorithmsOnsite - CoreweaveMediumSite Reliability EngineerQuery Machines and Mark Them Offline
This problem tests the ability to interact with external APIs, handle asynchronous operations with retries, and implement conditional filtering based on system metadata.
Coding & AlgorithmsOnsiteAPIAutomationError Handling - 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 - CoupangMediumSoftware EngineerFind shortest distance between two islands
This question evaluates understanding of grid-graph traversal and shortest-path concepts, including identification of connected components and reasoning about minimal bridging distance between regions.
Coding & AlgorithmsOnsite - 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 - CrestaMediumSoftware EngineerCount the Leaves Left on a Grid After a Sequence of Wind Gusts
Simulate wind gusts over a grid in which every cell holds a number of leaves: each gust shifts all leaves one cell in its direction, and leaves pushed off the edge are lost for good. Return how many leaves remain, testing careful two-dimensional state updates and boundary handling under time pressure.
Coding & AlgorithmsOnline Assessment - CrestaMediumSoftware EngineerLongest Overlap Between the End of One String and the Start of Another
Given two strings, return the length of the longest suffix of the first string that is also a prefix of the second. The problem tests precise string indexing, the direction of the overlap, and boundary cases such as no overlap at all or an overlap covering the whole shorter string.
Coding & AlgorithmsOnline Assessment - CrowdstrikeMediumSoftware EngineerCount connected components in a binary grid
This problem tests your ability to model a 2D grid as a graph and use graph traversal algorithms like DFS or BFS to count distinct connected components.
Coding & AlgorithmsOnsiteGraphsDFSBFS - CrowdstrikeMediumSoftware EngineerMaximize the minimum value along a grid path
This problem tests your ability to combine binary search on the answer with graph traversal techniques (BFS/DFS/Union-Find) to solve optimization problems on a 2D grid.
Coding & AlgorithmsOnsiteBinary SearchBFSDFS - 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 - CrusoeEasySoftware EngineerImplement Interval Overrides and Top-K Strings
Implement interval override logic for half-open ranges and calculate the top-k labels based on total active duration with lexicographical tie-breaking.
Coding & AlgorithmsOnsiteintervalssortinghash-table - 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 - DRWEasyData EngineerCompute a Year-End Balance with Monthly Card Fees
This problem tests logic implementation and data structure traversal, requiring the integration of conditional logic (fee waivers) into a sequential processing pipeline.
Coding & AlgorithmsOnline AssessmentData ProcessingLogicAggregation - DRWEasyData EngineerDelete the Fewest Characters to Avoid Triple Repeats
This problem tests string manipulation, greedy algorithm logic, and the ability to track character frequency counts to identify and prune violations of a constraint.
Coding & AlgorithmsOnline AssessmentStringsGreedyArrays
Confluent
Coreweave
Coupang
Cresta
Crowdstrike
Cursor
DRW