Coding & Algorithms interview questions

Showing 631–660 of 3276 results

• Find the Earliest Contiguous Removal That Balances Index SumsMedium

  This problem tests array manipulation, prefix sums, and index tracking while handling state changes caused by subarray removal.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Minimum Window Containing a Multiset of CharactersMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Find the N-th Highest Bid in an Auction Log Without a HeapMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Generate combinations and permutationsMedium

  This problem tests your ability to implement recursive backtracking algorithms to generate all possible permutations and combinations of a given set of distinct integers.

  ByteDanceSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Implement Expiring LRU CacheHard

  This question evaluates skill in designing and implementing efficient in-memory caching data structures, testing understanding of LRU eviction, per-entry TTL expiration, and the use of hash maps and linked lists for O(1) operations.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Sliding Windows and LRU CacheMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Implement Sorted Search and Array UpdatesMedium

  This question evaluates proficiency in array manipulation and fundamental algorithmic techniques—specifically binary search for sorted arrays, digit-wise arithmetic with carry handling, and in-place stable reordering—within the Coding & Algorithms domain and with attention to time and space complexity.

  ByteDanceSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Implement an LRU CacheMedium

  This problem tests your ability to combine a hash map and a doubly linked list to achieve constant-time performance for cache operations.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement several OA simulation problemsEasy

  This set of problems evaluates skills in string processing, memory simulation and allocation logic, and online data-structure maintenance for dynamic contiguous segment counting, testing algorithmic design and attention to stateful invariants.

  ByteDanceData ScientistCoding & AlgorithmsOnline Assessment
• Implement stack variants and upward path sumHard

  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.

  ByteDanceData ScientistCoding & AlgorithmsOnsite
• Infer an Alien Alphabet from Sorted WordsMedium

  This problem tests graph theory knowledge, specifically topological sorting using Kahn's algorithm or DFS, applied to dependency resolution between characters.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Intersect Two Sorted Lists of Disjoint IntervalsMedium

  Intersect two sorted lists of disjoint closed intervals in linear time, retaining one-point endpoint overlaps and advancing whichever current interval ends first.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Least Frequently Used (LFU) CacheHard

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Maximize total catch over K hours from ponds whose yield drops after each hourMedium

  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.

  ByteDanceMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Maximize watch time under adjacency constraintHard

  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.

  ByteDanceData EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Closed IntervalsMedium

  This problem tests your ability to manipulate sorted data structures and manage interval boundaries to optimize overlapping segments in linear or log-linear time.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping Time WindowsMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge overlapping closed intervals into a sorted list of disjoint intervalsMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Minimize Increments to Equalize Path CostsMedium

  This problem tests your ability to manipulate tree node values to satisfy a global constraint using a bottom-up dynamic programming or greedy approach.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Number of Rooms to Host a Set of Possibly Overlapping MeetingsHard

  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.

  ByteDanceMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Order Named Tasks by Dependencies, Choosing the Alphabetically Smallest OrderMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Place Non-Attacking QueensHard

  This question evaluates a candidate's competency in combinatorial search, constraint reasoning, and algorithmic design for arranging non-attacking pieces on a grid.

  ByteDanceSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Probability That One Fair Die Beats AnotherMedium

  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.

  ByteDanceData ScientistCoding & AlgorithmsTechnical Screen
• Remove Duplicate Letters LexicographicallyMedium

  This problem tests your ability to use a monotonic stack combined with frequency tracking to construct a specific subsequence while maintaining lexicographical order.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Report the winner after each move on an n-by-n tic-tac-toe boardMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Return the Most Frequent Integer with a Stable Tie-BreakerEasy

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse Nodes in K-Sized GroupsMedium

  This problem tests your ability to manipulate linked list pointers by reversing sub-segments of a list while maintaining structural integrity.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reverse a Linked List in Groups of KMedium

  This problem tests your ability to manipulate pointers in a linked list structure and manage iterative or recursive state transitions for fixed-size segments.

  ByteDanceMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Running Median After Each Number in a Data StreamMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Shortest Path in a Grid with Limited Obstacle RemovalMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen