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 181–210 of 1080 results
- BloombergMediumSoftware EngineerPredict most likely next word from training data
This problem tests your ability to process textual data into an N-gram model, requiring efficient counting of sequence frequencies to predict the most probable subsequent word.
Coding & AlgorithmsOnsiteHash MapsNLPData Structures - BloombergMediumSoftware EngineerSolve Number of Islands
This question evaluates understanding of graph and grid traversal concepts, specifically identifying connected components in a binary matrix and familiarity with traversal strategies such as BFS and DFS.
Coding & AlgorithmsOnsite - BloombergMediumSoftware EngineerSolve three coding tasks from onsite
This problem tests your ability to handle three distinct algorithmic scenarios: greedy logic for circular traversal, stack-based syntax validation, and state-space exploration on a 2D grid.
Coding & AlgorithmsOnsiteGreedyStackGraph Search - BloombergMediumSoftware EngineerSolve two array and string problems
This two-part question evaluates combinatorial enumeration and subset-generation concepts for arrays alongside string parsing and parentheses-sequence validation for noisy input, measuring algorithm design, correctness, and complexity reasoning in array and string contexts.
Coding & AlgorithmsOnsite - BnsfHardSoftware EngineerMaximize Valid Trains from Shared Equipment
Form the maximum number of valid trains from a shared pool of locomotives and railcars, breaking ties by maximizing total railcar length.
Coding & AlgorithmsOnsiteBitmask DPBacktrackingBranch and Bound - Booking.comMediumSoftware EngineerMatch Bookings to Payments
This question evaluates skill in matching records across unsorted collections, focusing on data structures, aggregation and handling one-to-one and one-to-many relationships between bookings and payments.
Coding & AlgorithmsOnsite - BoxMediumSoftware EngineerCompute Top-K word frequencies under a path
Compute Top-K word frequencies under a path 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 & AlgorithmsOnsite - BoxMediumSoftware EngineerDesign out-of-order windowed stream processor
Design out-of-order windowed stream processor 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 & AlgorithmsOnsite - BoxMediumSoftware EngineerFlip a specific bit in an integer
This question evaluates a candidate's understanding of bitwise operations and low-level integer manipulation, along with the ability to reason about the time and space complexity of bit-level operations.
Coding & AlgorithmsOnsite - BoxEasySoftware EngineerImplement a Leaky Bucket Rate Limiter
This question evaluates understanding of rate-limiting algorithms, time-based state management, and concurrent programming concepts, including synchronization and test design for boundary and timing behaviors.
Coding & AlgorithmsOnsite - BoxHardSoftware EngineerImplement a leaky-bucket rate limiter
Implement a leaky-bucket rate limiter evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout 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 & AlgorithmsOnsite - BoxMediumSoftware EngineerSolve classic troubleshooting & algorithm tasks
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve classic troubleshooting & algorithm tasks states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerBuild a validated add-sub calculator
This question evaluates skills in string parsing, tokenization, input validation, and safe integer arithmetic handling, with emphasis on enforcing format rules such as operator placement, prevention of leading zeros, and 32-bit signed integer bounds.
Coding & AlgorithmsOnsite - ByteDanceMediumData EngineerConnect Points With Minimum Total Distance
This problem tests your ability to model a geometric optimization task as a Minimum Spanning Tree (MST) problem and implement it efficiently using Kruskal's or Prim's algorithm.
Coding & AlgorithmsOnsiteGraphsMSTGeometry - ByteDanceHardMachine Learning EngineerCount Special Subarrays by Modular Frequency
This question evaluates the ability to apply modular arithmetic, frequency tracking, and prefix-count reasoning to efficiently count subarrays that satisfy a congruence condition, testing algorithmic problem-solving and scalable complexity management.
Coding & AlgorithmsOnsite - ByteDanceHardSoftware EngineerCourse Schedule Feasibility
This problem tests the ability to detect cycles in a directed graph using topological sorting or Depth First Search, ensuring all task dependencies can be resolved.
Coding & AlgorithmsOnsiteGraphTopological SortDFS - ByteDanceMediumSoftware EngineerDetect a Pythagorean Triple in an Integer Array
This problem tests the ability to optimize a brute-force approach into an efficient search using sorting and the two-pointer technique to satisfy a geometric condition.
Coding & AlgorithmsOnsiteArraysTwo PointersSorting - ByteDanceMediumSoftware EngineerFind Maximum Candies With Two Types
This question evaluates algorithmic problem-solving with arrays, focusing on managing constraints on the number of distinct element types in a contiguous sequence and maintaining element frequency/state during a traversal.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerFind Words in a Character Grid
This question evaluates algorithm design for efficient multi-word search in a character grid, testing competencies in constrained graph traversal, managing large dictionaries, and selecting data structures for efficient lookup.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerFind the Minimum Window Containing a Multiset of Characters
This problem tests your ability to use the two-pointer sliding window technique combined with a frequency map to identify the smallest valid substring efficiently.
Coding & AlgorithmsOnsiteSliding WindowHash MapStrings - ByteDanceMediumSoftware EngineerFind the N-th Highest Bid in an Auction Log Without a Heap
Given an unordered list of auction bids, return the n-th highest one, treating two equal bid amounts as distinct entries, while a heap-based solution is off the table. Tests selection algorithms faster than full sorting, correct handling of duplicate values, and justifying the achieved time complexity.
Coding & AlgorithmsOnsitequickselectarraysselection - ByteDanceMediumSoftware EngineerImplement Sliding Windows and LRU Cache
This question evaluates algorithmic problem-solving and data-structure design, testing sliding-window and 2D submatrix reasoning for maximizing contiguous ones with bounded flips and the design of an LRU cache that enforces O(1) get/put semantics.
Coding & AlgorithmsOnsite - ByteDanceHardData ScientistImplement stack variants and upward path sum
A four-part ByteDance Data Scientist onsite coding question: implement an O(1) MinStack, a MaxStack with peekMax/popMax, a streaming median finder, and a binary-tree upward (node-to-ancestor) path-sum check. It tests data-structure augmentation, streaming order statistics, and prefix-sum tree reasoning.
Coding & AlgorithmsOnsite - ByteDanceHardSoftware EngineerLeast Frequently Used (LFU) Cache
This problem tests the ability to design an O(1) time complexity cache that evicts the least frequently used items, using recency as a tie-breaker.
Coding & AlgorithmsOnsiteHash MapLinked ListData Structures - ByteDanceMediumSoftware EngineerMerge overlapping closed intervals into a sorted list of disjoint intervals
Coding problem: given closed integer intervals in any order, merge every group of overlapping or touching intervals and return the disjoint result sorted by start. It tests interval reasoning, correct handling of shared endpoints, duplicates and nested intervals, and a well-defined output order.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerOrder Named Tasks by Dependencies, Choosing the Alphabetically Smallest Order
Given named tasks and before-and-after dependency pairs, return an order that satisfies every dependency, choosing the alphabetically smallest valid order, or an empty list when the dependencies contain a cycle. It tests topological sorting, cycle detection and deterministic tie-breaking.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerReport the winner after each move on an n-by-n tic-tac-toe board
Coding problem: replay an n-by-n tic-tac-toe game from a list of moves and report after every move whether the player who just moved has filled a row, a column or either diagonal. It tests efficient win detection on large boards and careful handling of diagonal and anti-diagonal cells.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerRunning Median After Each Number in a Data Stream
Numbers arrive one at a time from a stream; after each arrival, return the median of everything received so far, averaging the two middle values when the count is even. The problem tests keeping order statistics up to date efficiently as a data stream grows.
Coding & AlgorithmsOnsite - ByteDanceMediumSoftware EngineerSolve Search Speed and String Product
This pair of problems evaluates algorithm design and implementation skills, focusing on efficient search/optimization for constrained processing speed and manual arbitrary-precision string multiplication for very large integers.
Coding & AlgorithmsOnsite - C3 AIMediumData ScientistDecompress an encoded string
Decompress an encoded string 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 & AlgorithmsOnsite
Bloomberg
Booking.com
Box
C3 AI