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 571–600 of 3276 results
- BloombergMediumSoftware EngineerSolve Grid Path and Unique Substring
This problem tests grid traversal via dynamic programming or recursion, combined with the sliding window technique to identify unique character patterns within string segments.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingSliding WindowGrid - BloombergMediumSoftware EngineerSolve Magic Dictionary and unknown traversal
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 Magic Dictionary and unknown traversal states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - 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 common string/tree/grid interview tasks
This problem tests your ability to perform a vertical-order traversal of a binary tree by mapping nodes to relative column indices and sorting them by their depth and value.
Coding & AlgorithmsTechnical ScreenTreesBFSSorting - BloombergEasySoftware EngineerSolve meeting and tree problems
This problem tests your ability to manipulate overlapping intervals and perform specific tree traversals to extract structural information.
Coding & AlgorithmsTechnical ScreenSortingIntervalsBinary Tree - BloombergMediumSoftware EngineerSolve sliding-window, flattening, decode, and O(1) random set
This problem tests your ability to handle nested data structures through recursive parsing, maintain efficient state using hash maps and dynamic arrays, and implement sliding window techniques to manage constraints in a stream.
Coding & AlgorithmsTechnical ScreenStackRecursionHash Map - BloombergMediumSoftware EngineerSolve string dictionary and tree ordering
This question evaluates design and analysis skills for string-matching data structures that support one-edit queries and for binary tree traversal with coordinate-based ordering, testing understanding of data structures, search algorithms, sorting, and complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - 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 - BloombergMediumSoftware EngineerValidate whether brackets are properly nested
This problem tests your ability to use a stack data structure to maintain LIFO ordering for matching paired symbols within a string.
Coding & AlgorithmsTechnical ScreenStackStringData Structures - 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 - BnsfMediumSoftware EngineerMinimize Car Removals for a Two-Car Bridge
Determine the minimum number of cars to remove from a queue so that no single retained car nor any adjacent retained pair exceeds a bridge's weight limit.
Coding & AlgorithmsOnline AssessmentDynamic ProgrammingBinary Indexed TreeSegment Tree - BobyardMediumSoftware EngineerImplement comment sorting and nesting
This question evaluates skills in frontend data handling and UI behavior, including implementing sortable lists, maintaining user-selected sort field and direction across refreshes, constructing nested comment trees from flat parentId references, and filtering content while preserving descendant visibility.
Coding & AlgorithmsTechnical Screen - BoeingEasySoftware EngineerCompute unique-substring length and first unique index
This problem tests your ability to manage character frequency counts and sliding window techniques to identify properties of unique substrings and characters.
Coding & AlgorithmsTechnical ScreenStringSliding WindowHash Map - 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 - Booking.comMediumSoftware EngineerSolve three OA coding questions
This 90-minute assessment evaluates algorithmic problem-solving skills including string manipulation and grouping for anagram detection, digit-level reasoning for one-swap maximization, and text tokenization with aggregation and ranking for sentiment-based scoring.
Coding & AlgorithmsOnline Assessment - Boston Consulting GroupMediumData ScientistAnalyze Python Functions: Improve Readability and Efficiency
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Analyze Python Functions: Improve Readability and Efficiency states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - 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 - BrexMediumSoftware EngineerDebug and Explain Fixes
This question evaluates a candidate's debugging and root-cause analysis skills, familiarity with unit testing and regression prevention, and ability to modify a small codebase to fix defects within the coding and algorithms domain.
Coding & AlgorithmsTechnical Screen - BrexEasySoftware EngineerImplement discounted card purchases
This question evaluates implementation-level skills in resource accounting and state management, specifically handling gem-cost mappings, per-color discounts, bounded arithmetic, and transactional updates to player state.
Coding & AlgorithmsTechnical Screen - BridgeMediumSoftware EngineerDesign Minesweeper and Optimize Click Performance
This question evaluates a candidate's competence in data structures, graph traversal and flood-fill concepts, complexity analysis, and scalable system design for sparse board representations.
Coding & AlgorithmsTechnical Screen - BridgeMediumSoftware EngineerSolve path normalization and nested iterator
This question evaluates proficiency in string/path normalization, manipulation of hierarchical data structures, stack-based iterator design, lazy versus eager flattening strategies, and algorithmic time/space complexity analysis in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - ByteDanceEasySoftware EngineerAdd Two Signed Decimal Character Arrays
This problem tests string manipulation, handling of sign logic, and carrying operations for large integer arithmetic without utilizing large integer libraries.
Coding & AlgorithmsTechnical ScreenStringsMathTwo Pointers - ByteDanceHardSoftware EngineerAssign Meetings and Find the Most-Used Room
Practice an interval-scheduling problem where meetings may be delayed and room-number tie rules affect the final count. The prompt tests precise simulation, large-input complexity, integer safety, and careful handling of simultaneous room availability.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerBuild a Binary Tree from Descriptions
This problem tests tree traversal, hash map utilization for parent-child relationship tracking, and identification of the root node in a graph-based structure.
Coding & AlgorithmsTechnical ScreenTreesHash MapGraph
Bloomberg
Booking.com
Boston Consulting Group
Box
Brex