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 361–390 of 1706 results
- ByteDanceMediumSoftware EngineerShortest Path in a Grid with Limited Obstacle Removal
This problem tests your ability to adapt Breadth-First Search (BFS) to a state-space graph where the state includes both spatial coordinates and a remaining resource constraint.
Coding & AlgorithmsTechnical ScreenBFSShortest PathState Space Search - ByteDanceHardSoftware EngineerSimulate a fixed-capacity least-recently-used cache over get and put operations
Implement a fixed-capacity cache that evicts the least recently used key, processing a sequence of get and put operations and returning the result of every get. Tests recency bookkeeping, update versus insert semantics, eviction order and constant-time operations.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSite Reliability EngineerSolve Stack and String Shift Problems
This problem tests your ability to handle nested validation using stacks and coordinate transformation using modular arithmetic on strings.
Coding & AlgorithmsTechnical ScreenStackStringsModulo Arithmetic - ByteDanceMediumSoftware EngineerSolve interval merging and histogram area
This question evaluates algorithmic problem-solving skills focused on interval manipulation and histogram-based area computation, emphasizing data structures, ordering, and reasoning about time and space complexity.
Coding & AlgorithmsTechnical Screen - ByteDanceHardSoftware EngineerSplit n People Into Two Groups So No Pair Who Dislike Each Other Shares a Group
Given n people and a list of pairs who dislike each other, decide whether everyone can be divided into two groups of any size so that no disliking pair shares a group. The problem tests reasoning about pairwise constraints, people with no constraints, and a solution that runs in time linear in the number of people and pairs.
Coding & AlgorithmsTechnical Screen - ByteDanceEasySite Reliability EngineerValidate Matching Brackets
Tests stack-based parsing fundamentals, early mismatch detection, and linear-time string validation for balanced bracket sequences.
Coding & AlgorithmsTechnical Screenstackstringsparsing - C3 AIHardData ScientistFind longest substring with at least k repeats
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find longest substring with at least k repeats states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - C3 AIMediumData ScientistLongest Substring Where Every Character Appears at Least K Times
Find the longest substring in which every present character appears at least k times. Practice divide-and-conquer splitting, frequency reasoning, and fixed-alphabet complexity.
Coding & AlgorithmsTechnical Screen - CadenceMediumMachine Learning EngineerImplement Depth-First Search Traversal
This problem tests your ability to implement a recursive or iterative depth-first search (DFS) while managing state to handle cycles in a graph represented as an adjacency list.
Coding & AlgorithmsTechnical ScreenGraphsDFSRecursion - Capital OneMediumSoftware EngineerCount Numbers With Odd Zeros
This question evaluates proficiency in numeric digit analysis and parity-based counting, testing the competency to reason about decimal representations of integers within the Coding & Algorithms domain at a practical application level. It is commonly asked to assess basic algorithmic thinking, efficient iteration and counting skills, and careful handling of edge cases in technical interviews.
Coding & AlgorithmsTechnical Screen - Capital OneMediumData ScientistCritique and Test Python Preprocessing Utilities Effectively
This question evaluates a candidate's ability to review and critique Python preprocessing utilities, covering competencies in software design patterns (fit/transform separation), coding style and import hygiene, and unit-test specification for data-science pipelines.
Coding & AlgorithmsTechnical Screen - Capital OneMediumData ScientistExplain Shell Script Line-by-Line for Data Science Workflows
This question evaluates familiarity with shell scripting for reproducible data-science workflows, Python object-oriented design including transformer patterns (fit/transform separation), outlier detection and imputation strategies, code-style critique, and unit testing competency.
Coding & AlgorithmsTechnical Screen - Capital OneMediumData ScientistExplain Shell Script for Python Virtual Environment Setup
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain Shell Script for Python Virtual Environment Setup states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Capital OneMediumData ScientistFix failing tests and refactor code
This question evaluates a candidate's ability to debug, test, and refactor Python code with attention to state management, mutable default arguments, deterministic unit testing, API design, and type-safety.
Coding & AlgorithmsTechnical Screen - Capital OneMediumSoftware EngineerRemove nodes with a given value
This problem tests your ability to manipulate singly linked lists, specifically handling edge cases like removing head nodes and reassigning pointers in a single pass.
Coding & AlgorithmsTechnical ScreenLinked ListPointersRecursion - Capital OneMediumSoftware EngineerSort Matrix Diagonals By Their Values
Tests matrix traversal along anti-diagonals, string formation, and custom multi-key sorting with deterministic tie-breaking.
Coding & AlgorithmsTechnical Screenmatrixsortingstrings - CargurusMediumData ScientistReverse a Character Array In Place
This problem tests the ability to manipulate array elements in-place using two-pointer logic while adhering to strict space complexity constraints.
Coding & AlgorithmsTechnical ScreenArraysTwo PointersIn-place - CerebrasMediumSoftware EngineerImplement Binary Search in C++
This question evaluates proficiency in implementing binary search in C++, focusing on iterative control flow, correct handling of not-found cases, boundary conditions, and understanding of algorithmic correctness.
Coding & AlgorithmsTechnical Screen - CerebrasMediumSoftware EngineerImplement and Optimize Vector Multiplication
This question evaluates a candidate's ability to implement vector–vector multiplication and to reason about performance optimizations and sparse data structures, assessing competencies in algorithm design, parallel computing, memory hierarchy, and numerical operations.
Coding & AlgorithmsTechnical Screen - ChalkMediumSoftware EngineerCompute rainwater accumulation on a height grid
Tests the ability to simulate 2D fluid accumulation using priority-queue-based graph traversal (similar to Dijkstra's algorithm) to track spilling boundaries.
Coding & AlgorithmsTechnical Screenheapbfsgraph - Character.AIMediumSoftware EngineerFind Shortest Covering Substring
This problem tests your ability to use the sliding window technique and hash maps to find the smallest window in a string that contains all characters of a target pattern.
Coding & AlgorithmsTechnical ScreenSliding WindowHash MapTwo Pointers - ChariotMediumSoftware EngineerExplore an HTTP Maze
This question evaluates the ability to integrate HTTP-based APIs with graph traversal and state management, covering concepts such as breadth-first exploration for shallow-first search, cycle avoidance, transient error handling, and key-lock resource constraints.
Coding & AlgorithmsTechnical Screen - Chicago Trading CompanyMediumSoftware EngineerBuild an Ordered Latest-Quote Container
Build an insertion-ordered container that stores only the latest quote for each stock symbol. Support expected O(1) push, pop, and size operations while updating bid and ask values without changing a symbol's original position and safely rejecting malformed commands.
Coding & AlgorithmsTechnical Screen - Chicago Trading CompanyMediumSoftware EngineerImplement a Constant-Time Simple Moving Average
Implement a fixed-window simple moving average with O(1) processing for every valid add and query. Maintain a rolling sum and bounded queue, average the samples available before the window fills, and return deterministic results for empty, malformed, or unknown operations.
Coding & AlgorithmsTechnical Screen - ChimeMediumSoftware EngineerImplement single-tab browser history navigation
This question evaluates understanding of data structures, stateful API behavior, amortized time complexity, set membership tracking, and edge-case handling for implementing browser-like history navigation in the coding & algorithms domain.
Coding & AlgorithmsTechnical Screen - ChimeMediumBackend EngineerSolve classic backend coding problems
This problem tests your ability to handle string manipulation, recursion with backtracking, and mapping logic by generating all valid word combinations from a numeric keypad sequence.
Coding & AlgorithmsTechnical ScreenBacktrackingRecursionStrings - CircleHardSoftware EngineerImplement Recipe Storage CRUD
This question evaluates the ability to design and implement in-memory data structures and APIs for CRUD operations, covering skills such as ID generation and parsing, string handling for case-insensitive uniqueness constraints, data modeling, and preserving original value casing.
Coding & AlgorithmsTechnical Screen - CiscoHardSoftware EngineerImplement an LFU Cache
This problem tests your ability to design a data structure that supports O(1) insertions and lookups while managing cache eviction based on access frequency and recency.
Coding & AlgorithmsTechnical ScreenHash TableLinked ListDesign - CiscoEasySoftware EngineerLongest Substring Without Repeated Characters
This problem tests string manipulation, hash map usage, and the sliding window technique to find a specific substring based on unique character constraints.
Coding & AlgorithmsTechnical ScreenSliding WindowStringsHash Map - CitadelMediumSoftware EngineerCompute BBO and NBBO from order data
This question evaluates a candidate's skill in designing efficient data structures and algorithms for aggregating and querying order-book data, including computing best bid/ask prices and summing quantities at those prices.
Coding & AlgorithmsTechnical Screen
C3 AI
Capital One
Cerebras
Chime
Circle
Citadel