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 301–330 of 1706 results
- BloombergMediumSoftware EngineerImplement sliding-window timestamped average
This question evaluates understanding of time-based sliding-window data structures, streaming aggregation, and the handling of timestamped records with efficient incremental updates and evictions.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerImplement streaming enrichment aggregator
This problem tests your ability to design a stateful stream processor that aggregates fragmented event data based on a shared correlation ID within a sliding time window.
Coding & AlgorithmsTechnical ScreenHashMapsStream ProcessingConcurrency - BloombergMediumSoftware EngineerMinimize Travel Assignment Cost
This problem tests your ability to minimize costs when assigning workers to multiple destinations, requiring an application of dynamic programming to manage fixed capacity constraints.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBitmaskingOptimization - BloombergMediumSoftware EngineerMinimum Character Replacements to Make One String an Anagram of Another
Given two strings of equal length made of lowercase letters, find the fewest single-character replacements in the second string that turn it into an anagram of the first. This phone-screen coding problem tests character frequency counting and precise reasoning about which letters must change.
Coding & AlgorithmsTechnical Screen - 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 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 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 - 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 - 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 - 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 - ByteDanceMediumSoftware EngineerBuild a Removable Timestamp-Ordered Task Scheduler
Design a task scheduler supporting task insertion/update, cancellation by ID, and retrieving ready tasks up to a given time limit using a min-heap with lazy deletion.
Coding & AlgorithmsTechnical Screenheaphash-tabledesign - ByteDanceHardSoftware EngineerBuild the Largest Allowed Number Below a Limit
This problem tests greedy algorithm design, string-based numeric comparison, and backtracking/recursive state management to construct the largest possible number under a given limit.
Coding & AlgorithmsTechnical ScreenGreedyStringsRecursion - ByteDanceMediumSoftware EngineerCheck Whether Every Course Can Be Completed Under Prerequisite Rules
A graph feasibility problem: given n courses and pairs stating which course must be completed before another, decide whether every course can be finished. It tests modeling dependencies as a directed graph, recognizing circular requirements, and handling courses that fall into separate, disconnected groups.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerCheck Whether an n x n Tic-Tac-Toe Game Is Over (Win or Draw)
Given an n x n tic-tac-toe board holding empty cells and two players' marks, decide whether the game is over because one player occupies an entire row, column or diagonal, or because the board is full with no winner. It tests complete line checks, draw detection and edge cases such as all-empty lines and a 1 x 1 board.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerClockwise Spiral Traversal of a Matrix With O(1) Extra Space and No Mutation
From a TikTok backend intern interview: return the elements of an m x n matrix in clockwise spiral order using only constant extra space beyond the output, without a visited marker and without modifying the matrix. It tests careful traversal logic and off-by-one handling when a single row or column remains.
Coding & AlgorithmsTechnical Screen - ByteDanceHardMachine Learning EngineerCombined Median of Two Sorted Integer Lists in Logarithmic Time
From a ByteDance technical screen for a machine learning engineer role: given two sorted integer arrays, return the median of all their elements combined, averaging the two middle values when the total count is even. It tests reasoning about sorted order under a logarithmic time target and edge cases such as an empty array.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumData ScientistCompute Minimum Parentheses Additions
This question evaluates proficiency in string processing and algorithmic reasoning for balancing parentheses, testing understanding of invariants and edge-case handling.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerCompute root-to-leaf number sum
This problem tests your ability to perform depth-first search on a binary tree and maintain state (the current path sum) during the traversal to compute a cumulative total.
Coding & AlgorithmsTechnical ScreenTreesDFSRecursion - ByteDanceMediumData ScientistCount Same-Day Registered Posters
This question evaluates SQL querying skills, including joining relational tables, date handling, aggregation, and deduplicating users across events. Commonly asked in Coding & Algorithms interviews for data scientists, it assesses practical relational database querying and analytics tasks—filtering, grouping, and counting distinct users across tables—and tests practical application of SQL rather than purely conceptual database theory; this summary is in English.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerCount Similar Photo Groups
This question evaluates understanding of graph connectivity and equivalence relations, requiring recognition of connected components from an adjacency-matrix representation of pairwise similarity.
Coding & AlgorithmsTechnical Screen
Bloomberg
Boston Consulting Group
Brex