Coding & Algorithms interview questions

Showing 601–630 of 3276 results

• Build a Removable Timestamp-Ordered Task SchedulerMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a validated add-sub calculatorMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Build the Largest Allowed Number Below a LimitHard

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check Whether Every Course Can Be Completed Under Prerequisite RulesMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check Whether an n x n Tic-Tac-Toe Game Is Over (Win or Draw)Medium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Clockwise Spiral Traversal of a Matrix With O(1) Extra Space and No MutationMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Combined Median of Two Sorted Integer Lists in Logarithmic TimeHard

  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.

  ByteDanceMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Compute Minimum Parentheses AdditionsMedium

  This question evaluates proficiency in string processing and algorithmic reasoning for balancing parentheses, testing understanding of invariants and edge-case handling.

  ByteDanceData ScientistCoding & AlgorithmsTechnical Screen
• Compute root-to-leaf number sumMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Connect Points With Minimum Total DistanceMedium

  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.

  ByteDanceData EngineerCoding & AlgorithmsOnsite
• Count House Segments After Sequential DemolitionsMedium

  Track the number of consecutive house segments after each requested demolition on an integer line. Each removal can eliminate an isolated segment, trim an endpoint, or split a run, so the solution must update the count efficiently across many distinct positions.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Numbers with an Even Number of DigitsMedium

  Count how many positive integers in an array have an even number of decimal digits. Respect ordinary representations without leading zeroes, count repeated values independently, and handle boundaries such as 10 and 10000 correctly.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Same-Day Registered PostersMedium

  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.

  ByteDanceData ScientistCoding & AlgorithmsTechnical Screen
• Count Similar Photo GroupsMedium

  This question evaluates understanding of graph connectivity and equivalence relations, requiring recognition of connected components from an adjacency-matrix representation of pairwise similarity.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Special Subarrays by Modular FrequencyHard

  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.

  ByteDanceMachine Learning EngineerCoding & AlgorithmsOnsite
• Count Target-Sum Paths in an N-ary TreeHard

  This problem tests the ability to navigate tree structures and use hash maps to track cumulative path sums efficiently, specifically in the context of an N-ary tree.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Course Schedule FeasibilityHard

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Detect a Pythagorean Triple in an Integer ArrayMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Determine Whether an Integer Is a PalindromeMedium

  This problem tests your ability to manipulate integers mathematically to detect palindromic sequences without converting the number into a string, requiring careful handling of edge cases and integer overflow.

  ByteDanceData ScientistCoding & AlgorithmsTechnical Screen
• Determine whether squares can fitHard

  This question evaluates spatial reasoning, combinatorial packing, and constraint-satisfaction skills in the context of placing integer-aligned squares within an m x n rectangle.

  ByteDanceSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Elements Occurring More Than n/3 Times in a Sorted ArrayMedium

  This problem tests your ability to optimize frequency counting in a sorted array by leveraging binary search to achieve logarithmic time complexity, rather than a linear scan.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Enumerate All Simple Directed CyclesMedium

  This problem tests graph traversal skills, specifically the ability to identify unique simple cycles in a directed graph using canonical representations to avoid duplicates.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Enumerate All Simple Directed PathsMedium

  This problem tests graph traversal techniques, specifically depth-first search (DFS) with backtracking to identify all unique simple paths in a directed graph.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Equalize Root-to-Leaf Sums in an N-ary TreeEasy

  Find the minimum total increments needed to make every root-to-leaf path in a nonnegative-valued N-ary tree have the same sum. The parent-array input may contain 200,000 nodes and a depth beyond Python's recursion limit.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate an Integer Arithmetic Expression with ParenthesesMedium

  This problem tests the ability to evaluate arithmetic expressions containing addition, subtraction, multiplication, and division, while correctly handling parentheses, operator precedence, and unary operators without using recursion.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Maximum Candies With Two TypesMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Find Missing Ranges with BoundsEasy

  This question evaluates understanding of sorted array manipulation, interval arithmetic, detection of maximal missing ranges, and careful handling of boundary and edge cases in integer intervals.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Unique One-Use Combination Sums with Negative ValuesHard

  Tests backtracking and branch-and-bound optimization when searching for subsets that sum to a target with duplicate and negative values.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Words in a Character GridMedium

  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.

  ByteDanceSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Word for a Query SuffixHard

  This problem tests your ability to efficiently query a dictionary for the longest word ending with a specific suffix, requiring optimal data structure usage for prefix/suffix operations.

  ByteDanceSoftware EngineerCoding & AlgorithmsTechnical Screen