Katkat

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 961–990 of 1080 results

  • TikTokHardSoftware Engineer
    Schedule Seller Tasks with Tier-Weighted Round Robin

    Design a task scheduler that dispenses seller tasks using tier-weighted round-robin across sellers while strictly preserving per-seller priority and FIFO order.

    Coding & AlgorithmsOnsiteQueueHeapDesign
  • TikTokMediumSoftware Engineer
    Solve intervals and distinct islands

    This question evaluates skills in interval manipulation and identification of distinct connected components in grids, testing competencies in data structure usage, algorithmic reasoning, and spatial pattern recognition within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite
  • TrexquantMediumSoftware Engineer
    Implement Trie search with wildcard matching

    This question evaluates understanding of trie data structures, string pattern matching with wildcard characters, and efficient algorithm design for large-scale add/search operations.

    Coding & AlgorithmsOnsite
  • TrexquantMediumSoftware Engineer
    Maintain median of a data stream

    This question evaluates proficiency in streaming data aggregation, dynamic order-statistics maintenance, and algorithmic complexity analysis for insertion and query operations.

    Coding & AlgorithmsOnsite
  • TruefoundryMediumSoftware Engineer
    Query a Versioned Array

    This problem tests your ability to design a data structure that supports efficient state snapshots and point queries, specifically focusing on space-time trade-offs.

    Coding & AlgorithmsOnsiteData StructuresBinary SearchArrays
  • TruefoundryMediumSoftware Engineer
    Verify Ordering Under a Scrambled Alphabet

    This problem tests string manipulation, hash map usage for indexing, and the ability to compare two strings based on custom character priority.

    Coding & AlgorithmsOnsiteStringsSortingHash Map
  • TwitchMediumSoftware Engineer
    Solve four design-leaning coding problems

    This multi-part question evaluates algorithmic problem-solving, data structure design and manipulation (such as LRU cache semantics), stateful simulation and scoring logic, chronological quota accounting for billing, and set/map operations for detecting overlaps.

    Coding & AlgorithmsOnsite
  • Two SigmaHardData Scientist
    Count Distinct Island Shapes in a Binary Grid

    This question evaluates a candidate's understanding of grid-based connected components and spatial equivalence, measuring competency in representing and distinguishing island shapes regardless of their location.

    Coding & AlgorithmsOnsite
  • Two SigmaHardData Scientist
    Implement Univariate Linear Regression with Ordinary Least Squares

    This question evaluates understanding of univariate linear regression and the ordinary least squares (OLS) closed-form estimator, probing competencies in basic statistical estimation, interpretation of slope and intercept, numerical stability, and floating-point arithmetic.

    Coding & AlgorithmsOnsite
  • Two SigmaHardData Scientist
    Maximum-Product Simple Path in a Complete Directed Graph

    This question evaluates skills in graph algorithms, multiplicative path optimization, and combinatorial dynamic programming, testing competency in reasoning about simple paths and product-based scoring in directed weighted graphs.

    Coding & AlgorithmsOnsite
  • Two SigmaMediumSoftware Engineer
    Solve capital selection and grid escape

    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 capital selection and grid escape states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Answer Repeated Shortest Increasing-Path Queries

    Preprocess shortest strictly increasing grid paths for repeated target queries, with deterministic BFS ties, predecessor reconstruction, and memory trade-offs.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Assign Meetings to the Minimum Number of Rooms

    Assign meetings to the minimum number of rooms using deterministic room ID allocation, returning the room assigned to each meeting in original input order.

    Coding & AlgorithmsOnsiteheapintervalssorting
  • UberHardSoftware Engineer
    Build Quadtree and Find Grid Words

    This problem tests your ability to implement a spatial partitioning data structure (Quadtree) for a grid and perform recursive searches to locate words within that grid efficiently.

    Coding & AlgorithmsOnsiteQuadtreeBacktrackingTrie
  • UberHardSoftware Engineer
    Check feasibility of AI course schedule

    This question evaluates competency in analyzing directed graphs and dependency resolution, focusing on cycle detection and the feasibility of ordering prerequisites for course completion.

    Coding & AlgorithmsOnsite
  • UberMediumMachine Learning Engineer
    Choose K pickup locations minimizing L1 distance

    This question evaluates facility-location and spatial optimization skills under the Manhattan (L1) metric, testing algorithm design, combinatorial optimization, and handling geometric data.

    Coding & AlgorithmsOnsite
  • UberMediumMachine Learning Engineer
    Compute minimal time to finish dependent tasks

    This question evaluates understanding of graph algorithms and scheduling, specifically reasoning about task dependencies, parallel execution, and cycle detection in directed graphs.

    Coding & AlgorithmsOnsite
  • UberHardSoftware Engineer
    Count Islands After Each Land Addition to an All-Water Grid

    A grid coding problem where land cells are added one at a time to an initially all-water grid and you must report the number of islands after every addition. It tests incremental connectivity, efficient merging of islands as they join, and correct handling of repeated additions.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Count Islands After Land Additions

    This question tests the ability to manage connected components in a grid dynamically, specifically requiring an efficient approach to track changes after incremental land additions.

    Coding & AlgorithmsOnsiteGraphsDSUData Structures
  • UberHardSoftware Engineer
    Count Islands of Connected Land Cells in a Binary Grid

    A classic grid coding problem asking you to count the islands formed by horizontally or vertically connected land cells in a binary grid. It tests grid traversal, connected-component counting, and careful handling of grid boundaries and already visited cells.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Count Valid Infection Orders

    This problem tests your ability to use combinatorial counting and dynamic programming to determine the number of valid sequences in which a population can be infected under specific adjacency constraints.

    Coding & AlgorithmsOnsiteDynamic ProgrammingCombinatoricsAlgorithms
  • UberMediumMachine Learning Engineer
    Count connected delivery zones

    This question evaluates graph traversal and connected-components detection on grids, measuring competence in grid-based algorithms, neighbor connectivity, and algorithmic analysis of time and space complexity.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Design top-K frequency structure

    This question evaluates ability to design efficient in-memory data structures for frequency tracking, including handling recency-based tie-breaking, memory bounds under churn, and concurrency implications.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Design top-K tracker with linked lists

    Design top-K tracker with linked lists 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
  • UberMediumSoftware Engineer
    Evaluate an Arithmetic Expression

    This problem tests your ability to parse and evaluate mathematical expressions involving integers, addition, subtraction, multiplication, division, and parentheses using stacks or recursion.

    Coding & AlgorithmsOnsiteStackParsingString Manipulation
  • UberMediumSoftware Engineer
    Find Any Available Meeting Room

    This question evaluates a candidate's competence in handling interval-based scheduling problems, specifically managing interval data and performing efficient searches within sorted bookings to detect potential overlaps.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Find a Bounded Subarray and Largest Square

    This question evaluates array manipulation and algorithmic problem-solving skills across two tasks: enforcing bounded value ranges within contiguous subarrays and identifying largest uniform square regions in binary matrices, exercising concepts such as range-tracking, efficient data structures, and dynamic programming.

    Coding & AlgorithmsOnsite
  • UberMediumSoftware Engineer
    Find earliest common meeting slot

    This problem tests interval management and the ability to find a common free window across multiple disjoint sets of busy times while respecting daily working constraints.

    Coding & AlgorithmsOnsiteIntervalsSortingGreedy
  • UberHardSoftware Engineer
    Find earliest time all riders become connected

    Assesses understanding of graph connectivity, temporal event processing, and dynamic graph data-structures for determining when a set of nodes becomes a single connected component.

    Coding & AlgorithmsOnsite
  • UberEasySoftware Engineer
    Find smallest start index avoiding left exit

    This question evaluates a candidate's ability to analyze reachability and cycle behavior in array-based functional graphs, testing competency in array manipulation, traversal, loop detection, and runtime optimization within the Coding & Algorithms domain.

    Coding & AlgorithmsOnsite