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 2371–2400 of 3276 results

  • This multipart question evaluates data engineering competencies including SQL report design for complex aggregation and ranking, plus PySpark-based ETL and transaction-level analytics.

    Point72Data EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates algorithmic problem-solving, array processing, input validation via decorators, and the ability to produce concise transaction reports for maximizing non-overlapping buy/sell profits.

    Point72Data EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests proficiency in functional composition, Python metaclass/decorator patterns, and custom serialization logic, focusing on handling flexible arguments and object introspection.

    Point72Data ScientistCoding & AlgorithmsOnline Assessment
  • This problem tests your ability to use dynamic programming and data structures to maximize elements in a subsequence that align with their new indices after removing elements.

    Point72Software EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates competency in combinatorial optimization and constrained resource-allocation algorithms, along with analysis of time and space complexity and robustness to skewed input distributions and edge cases.

    Point72Data ScientistCoding & AlgorithmsTechnical Screen
  • Implement and run a Deterministic Finite Automaton (DFA) simulator that parses state transitions over a binary alphabet and determines if input strings are accepted.

    Point72Software EngineerCoding & AlgorithmsOnline Assessment
  • This question tests your ability to handle data cleaning, filtering, and aggregation using both SQL and PySpark syntax on a transaction dataset.

    Point72Data EngineerCoding & AlgorithmsOnline Assessment
  • Implement a binary min-heap from scratch using a zero-indexed array, supporting insertion, peek, and extraction of the minimum element in logarithmic time.

    Pony.AiSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Tests dynamic programming and 2D grid traversal skills by counting the total number of square submatrices filled entirely with ones.

    PurestorageSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates computational geometry, combinatorial counting, and algorithmic optimization skills by requiring validation of a non-degenerate square from four 2D integer points and counting distinct squares in a larger point set, and it falls under the Coding & Algorithms category.

    PurestorageSoftware EngineerCoding & AlgorithmsOnsite
  • Compute the diameter of a large undirected tree, measured by the number of edges on its longest simple path. The exercise tests adjacency construction, linear-time tree traversal, endpoint reasoning, recursion-depth awareness, and edge cases such as a single-node tree.

    QualcommSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Find the earliest bad entry in a monotonic release history, returning -1 when every version is good. This compact coding prompt tests boundary-safe binary search, empty and all-good inputs, first-element failures, loop invariants, and logarithmic performance on histories with up to a million versions.

    QualcommSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates proficiency in informed search algorithms, heuristic design (admissibility), grid-based graph traversal, path reconstruction, and time/space complexity analysis.

    QualcommSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to model a stochastic process using a system of linear equations and solve it using expectation theory.

    Qube Research & TechnologiesSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates low-level data structure implementation skills (designing an associative flat_map with sorted dynamic array storage, unique-key semantics, iterator correctness and amortized complexity) alongside algorithmic optimization and proof-based reasoning for integer-constrained wealth redistribution.

    Qube Research & TechnologiesSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement flat_map, redistribute wealth evenly states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Qube Research & TechnologiesSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests the ability to optimize string pattern matching by using modular arithmetic and pointer manipulation to avoid unnecessary memory allocation.

    QuinceSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This problem tests greedy algorithm design and interval scheduling techniques to solve a coverage optimization task.

    QuinceSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates proficiency in string algorithms and combinatorial counting, focusing on recognition and enumeration of palindromic subsequences and techniques for deduplicating distinct results.

    QuoraSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates skills in detecting temporal recurrence patterns in transaction data, including time-series analysis, date arithmetic, grouping by merchant and currency, and tolerance handling for amounts and date jitter.

    RampSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This problem tests your ability to efficiently query temporal interval data for a specific user using binary search and interval manipulation.

    RampSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates graph traversal and state-management skills, emphasizing handling cycles, HTTP error conditions, retry logic, and propagation of authorization tokens in a networked client.

    RampSoftware EngineerCoding & AlgorithmsTechnical Screen
  • This question evaluates graph traversal and resilience when interacting with HTTP APIs, covering BFS/DFS reasoning, cycle detection to avoid infinite loops, retry handling for transient HTTP 500 responses, and timeout management for slow pages.

    RampSoftware EngineerCoding & AlgorithmsTechnical Screen
  • Tests skills in data modeling and stateful class implementation, covering CRUD operations, case-insensitive string handling, recipe ID generation, list management, search and sort logic, and basic user/edit permissions.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates implementation skills for stateful in-memory data structures, API evolution handling, substring search and prioritized sorting, and time-windowed assignment logic with quota enforcement in the Coding & Algorithms domain, and is primarily a practical application problem rather than a purely conceptual one.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates a candidate's skill in dynamic programming and constrained optimization, specifically deciding which state transitions to modify under a limited budget of changes. It falls under coding and algorithms interviews, testing practical application of greedy or DP reasoning over sequential data with adjacency-based bonuses rather than pure conceptual knowledge.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates a candidate's ability to design an efficient single-pass algorithm for grouped time-series data, tracking per-symbol running minimums to compute maximum achievable profit. It tests array processing, hash-map grouping, and edge-case handling for unsorted records, commonly used in coding interviews to assess practical algorithmic problem-solving rather than pure theory.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates a candidate's ability to parse and sort unstructured event data, then apply a greedy or dynamic-programming strategy for maximizing profit across multiple independent series. It falls under coding and algorithms, commonly used to assess array processing, state tracking, and stock-trading pattern recognition at a practical implementation level.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates a candidate's ability to design an object-oriented data structure with multiple prioritized eviction and expiration rules. It tests skills in coding and algorithms, specifically simulating TTL-based expiry alongside tiered, capacity-aware selection logic. Such multi-rule state machine problems are common in interviews to assess careful requirement tracking and practical implementation of layered constraints.

    RampSoftware EngineerCoding & AlgorithmsOnline Assessment
  • This question evaluates a candidate's ability to implement programmatic traversal of linked resources via an HTTP API, testing skills in network I/O, control flow, state management, and algorithmic traversal.

    RampSoftware EngineerCoding & AlgorithmsTechnical Screen

More topics