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 3031–3060 of 3276 results

  • A grid pathfinding problem in which a robot travels from a start cell to a destination through open, blocked and charging cells, spending one battery unit per move and refilling at chargers. The best route is ranked by fewest charging stops, then smallest required battery capacity, then fewest moves.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to manage dynamic intervals and determine if a new meeting can be scheduled without overlapping existing appointments using efficient data structures.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • This problem tests your ability to model a 2D grid as a graph and implement a Breadth-First Search (BFS) to find the shortest path between two points while respecting obstacles.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • This question tests the ability to implement a single-elimination tournament simulation using queue-based structures and demonstrates competency in designing a relational database schema for tournament record-keeping.

    UberFrontend EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates a candidate's ability to implement grid-based simulation and pattern-matching algorithms, including handling fixed-shape placements, internal holes, bounds checking, collision detection, and explicit scanning/tie-breaking rules.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • Simulate robot on grid with obstacles 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.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • Given a positive integer of up to 18 digits as a string, return the smallest palindromic number strictly greater than it, or the input itself when no such palindrome stays within 18 digits. Tests digit-level reasoning and edge cases such as palindromic inputs, carries and changes in digit count.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This multi-problem set evaluates broad algorithmic problem-solving skills, including bitwise reasoning, sliding-window and frequency analysis, stack/monotonic patterns, graph/DP reasoning with constrained jumps, and tree-path parity techniques.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This collection evaluates understanding of search techniques (binary search and BFS), graph and grid traversal, state-space shortest-path reasoning, randomized placement with adjacency counting, and attention to implementation quality and complexity trade-offs.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • This two-part prompt evaluates array and permutation reasoning for detecting contiguous value ranges and directed graph/tree reasoning for minimizing edge reversals when choosing a root, testing competencies in index and interval management, graph traversal and orientation, and algorithmic counting.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates graph modeling, state-space exploration, and shortest-path/reachability reasoning for nonstandard movement rules and constrained state transformations.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates algorithmic problem-solving skills in constrained path optimization and resource-allocation throughput maximization, including concepts such as graph modelling with prime-step constraints, dynamic programming, number-theoretic reasoning, and combinatorial optimization.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to optimize resource allocation using a greedy approach with a priority queue and to determine graph reachability within a constrained network.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This problem tests your ability to optimize string transformations using bitmask dynamic programming and to perform efficient range-based queries on a grid using a 2D data structure or sweep-line approach.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests dynamic programming with array constraints and tree-based traversal combined with bitwise parity checks for palindromic properties.

    UberSoftware EngineerCoding & AlgorithmsOnline Assessment
  • Assesses proficiency in array processing and binary tree traversal algorithms—specifically single-pass analysis of time-series data and coordinate-based vertical ordering of tree nodes; Category: Coding & Algorithms; Level of abstraction: implementation-level algorithmic coding.

    UberSoftware EngineerCoding & AlgorithmsOnsite
  • These two problems evaluate algorithmic problem-solving skills: the first focuses on spatial reasoning and grid-based distance computation relative to obstacles, while the second targets tree traversal and character-frequency reasoning for ancestor-path palindrome checks.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Construct any legal adjacent-swap sequence that sorts a numbered matrix into snake order, prove correctness, validate the output, and discuss reducing swap counts.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests the ability to perform a custom sort on a constrained set of characters using an O(n) counting approach rather than a standard comparison-based O(n log n) sort.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates array manipulation, ordering by derived keys (squares/absolute values), order-statistics reasoning, and algorithmic complexity analysis within the Coding & Algorithms domain.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to model a tree structure and maintain aggregated values across subtrees using recursion or iterative tree traversal.

    UberSoftware EngineerCoding & AlgorithmsTechnical Screen
  • A coding problem about forming the largest group of riders for a shared car, where each rider accepts only a minimum and maximum number of fellow passengers. It tests reasoning about per-rider interval constraints, careful handling of group-size edge cases, and meeting a linear-time requirement.

    Uber FreightSoftware EngineerCoding & AlgorithmsOnsite
  • This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute Minimum L-Moves on Infinite Grid states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    UiPathMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates competency in string processing, character normalization for case-insensitivity, algorithmic complexity analysis, and handling large-scale or streaming inputs.

    UiPathSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates a candidate's understanding of sorting algorithms and algorithmic optimization, specifically implementation and enhancement of cocktail shaker sort, plus analysis of time and space complexity, stability, and counts of comparisons and swaps.

    UiPathMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • A coding question on probability: a player repeatedly adds a uniformly random number of points until the total reaches a threshold, and you return the probability that the final total is at most a given limit. It tests careful probabilistic reasoning and an efficient computation for inputs up to ten thousand.

    UiPathMachine Learning EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests the ability to find the extrema of a coordinate set in a single linear pass to define an axis-aligned bounding box.

    UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates event-driven simulation and state-management skills, including handling customer lifecycle, capacity constraints, FIFO queuing behavior, and revenue aggregation.

    UpstartSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to efficiently process a collection of strings, count their occurrences using a hash map, and output them in a sorted format.

    UpstartSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates string manipulation, anagram detection, and constrained dictionary mapping skills, testing attention to character-level constraints and correct disambiguation among similar vocabulary entries.

    UpstartSoftware EngineerCoding & AlgorithmsTechnical Screen

More topics