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 2611–2640 of 3276 results

  • A coding problem to evaluate a string expression of non-negative integers with addition, subtraction, multiplication and integer division, respecting operator precedence and left-to-right order, with no parentheses and no eval. It tests parsing, precedence handling and truncating integer division.

    SnapchatMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This question tests the ability to efficiently find the k-closest points to an origin in a 2D plane, focusing on heap-based or selection-based data structures.

    SnapchatMachine Learning EngineerCoding & AlgorithmsOnsite
  • This problem tests grid traversal techniques (DFS/BFS) and the ability to calculate boundary contributions within a connected component in a 2D matrix.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Solve the shortest clear path in an n by n binary grid using BFS in 8 directions. Covers blocked endpoints, visited marking, path length, correctness, complexity, and weighted-move follow-ups.

    SnapchatMachine Learning EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to optimize nested loops using a two-pointer approach to achieve a time complexity better than brute force when searching for subsets of a fixed size that sum to a target value.

    SnapchatMachine Learning EngineerCoding & AlgorithmsOnsite
  • Find index of first unique character 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.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to traverse an undirected graph to identify connected components and perform aggregations over the nodes within each component.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Tests multi-pointer tracking and priority queue fundamentals to find the narrowest bounding interval containing at least one element from each of k sorted lists.

    SnapchatMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates algorithmic problem-solving and data engineering skills, focusing on computing and ranking co-occurrence frequencies, choosing efficient data structures for pairwise counts, and contrasting offline batch implementation with streaming updates.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • These problems evaluate proficiency in core data structures and algorithmic problem-solving, covering grouping/counting techniques, grid-based island detection, trie (prefix tree) design, and streaming median computation within the domain of data structures and algorithms.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates proficiency in implementing efficient mutable data structures and in enumerating combinatorial results, specifically testing understanding of LRU cache eviction behavior and generation of all non-empty subset products from a set of primes.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to implement a thread-safe rate limiter using the Leaky Bucket algorithm, requiring careful management of timestamps and shared state.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to design a data structure that handles time-series data and performs efficient range-based queries using binary search.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your understanding of linked list internals, the Iterator design pattern, and the application of higher-order functions in a custom data structure.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to extend the standard LRU cache pattern to support items with heterogeneous 'weights', requiring a data structure that maintains access order while managing a cumulative capacity constraint.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This question evaluates a candidate's ability to implement binary search for boundary indices, including correct handling of duplicates, providing iterative and recursive variants, and reasoning about time and space complexity.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This question evaluates proficiency in parsing and arithmetic expression evaluation (including operator precedence and nested parentheses) alongside implementation of disjoint-set (Union-Find) data structures for computing graph connected components.

    SnapchatMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates understanding of numerical methods, floating-point arithmetic, and algorithmic implementation in the Coding & Algorithms domain by requiring an approximation of the sine function under explicit error bounds.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to devise a deterministic strategy for a group of people to maximize correct guesses about their own attributes based on observed information from others.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • Two-part geometry coding problem about circular radars placed inside a rectangular room. For each radar, list every other radar whose coverage overlaps it, then decide whether a point object can travel from the left wall to the right wall without entering any radar's coverage.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • Determine the maximum number of stones that can be removed from a 2D grid where a stone may only be removed if another stone shares its row or column. This tests graph modeling, connected components, and Union-Find or BFS/DFS traversals.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Build and render an organization tree with ordered indentation, infer its root, and return exactly two-level manager-descendant pairs.

    SnapchatMachine Learning EngineerCoding & AlgorithmsOnsite
  • This question evaluates the ability to model the lock as a state-space and apply graph traversal and shortest-path techniques (breadth-first search) to determine minimal move sequences under constraints.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This set of three problems evaluates competencies in algorithm design and data structures, specifically efficient range counting on timestamped events, constrained selection/matching from double-sided cards, and merging multiple sorted lists.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to efficiently manage dynamic, sliding-window data streams and geometric grid traversal using graph search techniques.

    SnapchatSoftware EngineerCoding & AlgorithmsOnsite
  • This question evaluates algorithm design, state-space modeling, graph-search techniques (BFS/DFS) and number-theoretic reasoning (gcd), along with handling edge cases and analyzing time and space complexity in the Coding & Algorithms domain.

    SnapchatSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests binary search proficiency and the ability to optimize performance for repetitive computational tasks using memoization.

    SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Given a one-dimensional row marking empty spots, people and cakes, return for each person the index of the nearest cake, breaking ties toward the smaller index. It tests linear scanning techniques for nearest-neighbor queries on a line and careful handling of ties and boundaries.

    SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Given employee-to-manager pairs of integer IDs, build the top-down reporting forest with every top-level manager as a root, and return it as a preorder listing of IDs and depths. Tests finding the roots, building child lists, deterministic sibling ordering, and handling long reporting chains.

    SnowflakeSoftware EngineerCoding & AlgorithmsOnsite
  • Given a rooted tree as a parent array with a value on every node, return a same-shaped tree whose nodes hold the sum of each original subtree. It tests aggregating children before parents without hitting recursion limits, and leaving the original tree unchanged.

    SnowflakeSoftware EngineerCoding & AlgorithmsTechnical Screen

More topics