practice a little every day, paws crossed ♡
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 1861–1890 of 9403 results
- ByteDanceMediumMachine Learning EngineerMaximize total catch over K hours from ponds whose yield drops after each hour
Given the current hourly catch of each fishing pond and a budget of K hours, where every hour fished at a pond lowers its catch by one, compute the maximum total number of fish. It tests modeling the declining yields, choosing an optimal schedule, and meeting a time bound better than O(K log N) when K is very large.
Coding & AlgorithmsTechnical Screen - ByteDanceHardData EngineerMaximize watch time under adjacency constraint
This Coding & Algorithms question for a Data Engineer role evaluates dynamic programming and sequence-optimization skills by requiring selection of a subsequence under a pairwise adjacency constraint on video durations, at a moderate-to-advanced algorithmic abstraction level.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerMerge Overlapping Closed Intervals
This problem tests your ability to manipulate sorted data structures and manage interval boundaries to optimize overlapping segments in linear or log-linear time.
Coding & AlgorithmsTechnical ScreenSortingGreedyArray - ByteDanceMediumSoftware EngineerMerge Overlapping Time Windows
Merge unsorted half-open time windows into sorted, non-overlapping intervals while leaving merely adjacent windows separate. Handle duplicate and nested ranges, large timestamps, large input, and empty collections under exact boundary semantics.
Coding & AlgorithmsTechnical Screen - 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 EngineerMinimize Increments to Equalize Path Costs
This problem tests your ability to manipulate tree node values to satisfy a global constraint using a bottom-up dynamic programming or greedy approach.
Coding & AlgorithmsTechnical ScreenTreesGreedyRecursion - ByteDanceHardMachine Learning EngineerMinimum Number of Rooms to Host a Set of Possibly Overlapping Meetings
Given meetings as half-open start and end time intervals, compute the minimum number of rooms needed so that no room ever hosts two overlapping meetings. Tests interval reasoning, correct handling of back-to-back meetings that share an endpoint, and an efficient approach for up to 100,000 meetings.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerModel Campaigns, Targeting, and Edit History for a Demand-Side Ad Platform
Model a demand-side ad platform with advertisers, campaigns, ad groups, ads, and creatives, including audience rules, edit history, and versioned publishing.
System DesignOnsite - ByteDanceMediumData EngineerModel Data for Analytics, Reporting, and Applications
Tests your ability to process raw semi-structured event logs into a clean, dimensional metric table suitable for downstream analytics and reporting.
Data Manipulation (SQL/Python)HR ScreenData ManipulationData ModelingPython - 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 - ByteDanceHardSite Reliability EngineerPlace Non-Attacking Queens
This question evaluates a candidate's competency in combinatorial search, constraint reasoning, and algorithmic design for arranging non-attacking pieces on a grid.
Coding & AlgorithmsTechnical Screen - ByteDanceHardData ScientistPredict Short-Video Engagement with Skewed Data
Design a short-video engagement model with explicit targets, leakage-safe features, heavy-tail handling, exposure awareness, and temporal evaluation.
Machine LearningTechnical Screen - ByteDanceEasySoftware EngineerPrepare for an SRE Systems Fundamentals Round
This question tests your understanding of Linux process management, memory utilization, and the practical troubleshooting steps required to handle a production service experiencing memory exhaustion.
Software Engineering FundamentalsOnsiteLinuxSREMemory Management - ByteDanceMediumApplied ScientistPresent a Past Project and Defend Its Motivation Under Challenge
A behavioral question for a new-grad research role: present one of your own projects in about 15 minutes and defend its motivation when the interviewer challenges it early. It tests how you frame a problem, back it with evidence and baselines, and respond to pushback calmly.
Behavioral & LeadershipTechnical Screen - ByteDanceMediumSoftware EngineerPrevent a Cache Stampede on a Hot Key
This question tests the ability to design robust cache-aside mechanisms to prevent database overload during cache expiration events for high-traffic keys.
System DesignTechnical ScreenCachingDistributed SystemsHigh Availability - ByteDanceMediumData ScientistProbability That One Fair Die Beats Another
Solve a coding interview problem about the probability that one fair die beats another when the dice may have different sizes and duplicate face values. The challenge emphasizes strict tie handling and an efficient approach that avoids comparing every possible pair of faces.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerRemove Duplicate Letters Lexicographically
This problem tests your ability to use a monotonic stack combined with frequency tracking to construct a specific subsequence while maintaining lexicographical order.
Coding & AlgorithmsTechnical ScreenStackStringGreedy - 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 EngineerResolve a Meaningful Disagreement
This question assesses the candidate's ability to navigate professional conflict through evidence-based reasoning, emotional intelligence, and a focus on collective project success.
Behavioral & LeadershipOnsiteConflict ResolutionCommunicationLeadership - ByteDanceEasySoftware EngineerReturn the Most Frequent Integer with a Stable Tie-Breaker
Implement a frequency-based selection over a large integer array: return the most common value, using the numerically smallest value to break ties. Preserve the input and return the value itself rather than its count or position.
Coding & AlgorithmsTechnical Screen - ByteDanceMediumSoftware EngineerReverse Nodes in K-Sized Groups
This problem tests your ability to manipulate linked list pointers by reversing sub-segments of a list while maintaining structural integrity.
Coding & AlgorithmsTechnical ScreenLinked ListPointersRecursion - ByteDanceMediumMachine Learning EngineerReverse a Linked List in Groups of K
This problem tests your ability to manipulate pointers in a linked list structure and manage iterative or recursive state transitions for fixed-size segments.
Coding & AlgorithmsTechnical ScreenLinked ListPointersAlgorithms - 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 - ByteDanceHardBackend EngineerSQL: Students Above Average and Passing Every Subject
This problem tests advanced SQL skills, including the use of window functions, conditional aggregation, and multi-level filtering to identify subsets of data that satisfy both global and per-category criteria.
Data Manipulation (SQL/Python)Technical ScreenSQLAggregationWindow-Functions - ByteDanceMediumSite Reliability EngineerSRE Background: Development vs. Stability Focus and Your Most Memorable Project
This question assesses a candidate's ability to balance rapid feature delivery with system reliability, while evaluating their depth of technical ownership and ability to articulate the impact of their engineering decisions.
Behavioral & LeadershipTechnical ScreenBehavioralSRESystem Design - ByteDanceMediumSoftware EngineerSet Boundaries and Priorities in a High-Intensity Environment
This question assesses a candidate's ability to navigate high-pressure work environments by balancing personal sustainability with business objectives, focusing on prioritization strategies and escalation frameworks.
Behavioral & LeadershipOnsiteLeadershipPrioritizationCommunication - 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 - ByteDanceHardBackend EngineerSolve Bracket Matching and Tree Width
This problem tests string manipulation and tree traversal techniques by requiring the validation of complex bracket sequences and the calculation of the maximum horizontal distance between nodes at the same level of a binary tree.
Coding & AlgorithmsHR ScreenStacksBFSTrees - 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