Katkat

Topic

Coding & Algorithms interview questions

3276 Coding & Algorithms questions from 366 companies, with hints, runnable code and solution walkthroughs.

Questions3276

273 easy2539 medium464 hard

Your progress0/3276

Coding & Algorithms interview questions by the numbers

Last updated

Katkat has 3,276 Coding & Algorithms interview questions from 366 companies; the most come from Amazon (7%), Meta (7%) and Google (6%). By difficulty: 8% easy, 78% medium and 14% hard. The most common round is Technical Screen (52%). Frequent concepts include Algorithms, Data Structures, Arrays and Greedy.

Companies (366)

Difficulty

  • Easy8% · 273
  • Medium78% · 2539
  • Hard14% · 464

Interview rounds

  • Technical Screen52% · 1706
  • Onsite33% · 1080
  • Online Assessment13% · 427
  • HR Screen1% · 37
  • Other1% · 26

Roles

  • Software Engineer80% · 2629
  • Machine Learning Engineer8% · 253
  • Data Scientist7% · 241
  • Data Engineer1% · 45
  • Backend Engineer1% · 26

Frequent concepts

  • Algorithms9% · 302
  • Data Structures7% · 228
  • Arrays5% · 176
  • Greedy5% · 164
  • Optimization5% · 151
  • Hash Map4% · 124

Showing 2491–2520 of 3276 results

  • This question evaluates proficiency in statistical hypothesis testing, p-value interpretation, and implementing distribution-based calculations (Z and Student-t) in code, and it falls under the Coding & Algorithms domain for data scientist roles.

    RobloxData ScientistCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to implement a thread-safe rate limiter using a sliding window algorithm to ensure a user does not exceed a fixed number of requests within a rolling time frame.

    RobloxSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to design a thread-safe, time-windowed rate limiter using efficient data structures to track event timestamps.

    RobloxSoftware EngineerCoding & AlgorithmsOnsite
  • Evaluates the candidate's ability to design and implement an in-memory sliding-window rate limiter enforcing per-user and per-game constraints, focusing on correct request-acceptance semantics and efficient timestamp eviction; Category/domain: Coding & Algorithms; Level of abstraction: component-level algorithm and data-structure implementation.

    RobloxSoftware EngineerCoding & AlgorithmsOnsite
  • This multi-part question evaluates a data scientist's competencies in statistical inference (sample size and z-test calculations), causal inference and parallel-trends validation (difference-in-differences), Bayesian probability updating, and interpretable supervised learning feature importance, all framed as coding tasks.

    RobloxData ScientistCoding & AlgorithmsOnline Assessment
  • This question evaluates implementation and design skills around rate limiting, including rolling-window counters, multi-key constraints, and atomic updates, and falls under the Coding & Algorithms domain focused on practical application of algorithms and data structures.

    RobloxSoftware EngineerCoding & AlgorithmsOnsite
  • This question evaluates a candidate's ability to design efficient in-memory data structures and manage time-windowed event counting, testing algorithmic reasoning and performance optimization for high-throughput services.

    RobloxMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates streaming data-processing and algorithmic design skills, specifically time-windowed aggregation, click deduplication, late-event handling, state management, and selection of data structures for per-campaign CTR computation.

    RobloxData ScientistCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to perform a Kahn’s algorithm-based topological sort while grouping tasks into parallelizable layers, ensuring cycle detection and dependency validation.

    RobloxMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • A two-part grid problem modeled on a Match-3 game: report every horizontal and vertical run of three or more equal values in a fixed scan order, then clear the matched cells and let the remaining values in each column fall to the bottom. It tests precise run detection, ordering rules and grid simulation.

    RobloxSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Process operations on an infinite integer number line that either place an obstacle or ask whether a block centered at a point, reaching a given distance in each direction, is free of obstacles, and return the answers as a binary string. It tests efficient online range queries over large, sparse coordinates.

    RobloxSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates combinatorial optimization and scheduling competencies, specifically reasoning about NP-hardness, sequence-dependent setup times, precedence and downtime constraints, and designing exact and heuristic solvers for makespan minimization.

    RobloxData ScientistCoding & AlgorithmsOnline Assessment
  • This question evaluates skills in combinatorial optimization, budgeted resource allocation, bottleneck throughput modeling, and algorithm design with cost amortization for maximizing profit under constraints.

    RobloxData ScientistCoding & AlgorithmsOnsite
  • This question evaluates algorithm design, randomization techniques, and time/space complexity analysis within the Coding & Algorithms domain, focusing on partitioning an array into random non-empty segments.

    RobloxSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates understanding of string processing, frequency aggregation, earliest-timestamp tracking, and efficient prefix-based retrieval for large datasets.

    RobloxSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates the ability to simulate iterative movement and reason about repeated state transformations, testing competencies in algorithm design, cycle detection, and geometric reasoning; it falls under the Coding & Algorithms category.

    RobloxSoftware EngineerCoding & AlgorithmsOnsite
  • Process a stream of events that drop hazard pins at integer mile markers or ask whether a campsite centered at a marker with a given radius would be hazard-free, returning the answers as a string. Tests sparse-coordinate range counting with binary search and a Fenwick tree.

    RobloxSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This problem tests your ability to model dependency constraints using a Directed Acyclic Graph (DAG) and apply Kahn's algorithm or DFS-based topological sorting to resolve ordering dependencies.

    RogoMachine Learning EngineerCoding & AlgorithmsOnsite
  • This question evaluates a candidate's ability to parse and evaluate arithmetic expressions, correctly apply operator precedence and left-to-right associativity, and handle integer arithmetic details such as truncating division, whitespace, and multi-digit numbers, and is commonly asked to assess implementation-level parsing and algorithmic reasoning. The category is Coding & Algorithms and the level of abstraction is practical application, focusing on coding an efficient evaluator that balances time and space constraints rather than purely conceptual theory.

    RoktSoftware EngineerCoding & AlgorithmsOnsite
  • This question tests the ability to solve the Longest Common Subsequence (LCS) problem using dynamic programming to optimize overlapping subproblems.

    RokuSoftware EngineerCoding & AlgorithmsOnsite
  • This question evaluates understanding of interval overlap modeling, graph connectivity, and algorithmic efficiency by requiring mapping time intervals to an undirected communication graph and identifying its largest connected component.

    RubrikSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates understanding of BFS traversal, tree graph representation, and the ability to reason about allowable dequeue/enqueue orderings in a FIFO queue.

    RubrikSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This problem tests your ability to implement Kahn's algorithm for topological sorting while incorporating a priority-based tie-breaking mechanism to ensure deterministic output.

    RunloopSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to calculate probabilities involving continuous uniform distributions and discrete combinations of independent events.

    SIG (Susquehanna)Data ScientistCoding & AlgorithmsHR Screen
  • Process a stream of add-one and remove-all operations on a multiset and report, after each operation, how many element triples form an arithmetic progression with a fixed positive difference. It tests efficient incremental updates, correct treatment of duplicate occurrences, and counts that exceed the 32-bit range.

    SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnline Assessment
  • This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Count subarrays with odd zero count states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnline Assessment
  • Implement a headline scanner that identifies mentioned company names using whole-word matching and returns their unique stock tickers in the order specified by the input mapping.

    SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnsite
  • Rotate every element of a square matrix that lies off both diagonals by 90 degrees clockwise a given number of times, leaving the main-diagonal and anti-diagonal values in place. It tests precise index mapping, handling of odd and even matrix sizes, and bug-free simulation under timed assessment conditions.

    SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates algorithmic problem-solving skills across two areas: efficient seat-allocation and interval occupancy reasoning for grouping in a constrained seating layout, and robust string processing with phrase-based, case-insensitive matching and mapping to ticker identifiers.

    SIG (Susquehanna)Software EngineerCoding & AlgorithmsOnsite
  • Determine if a binary tree contains a root-to-leaf path whose node values add up to a given target sum.

    SalesforceSoftware EngineerCoding & AlgorithmsOnsite

More topics