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 901–930 of 1706 results

  • MetaMediumSite Reliability Engineer
    Validate abbreviations and brackets

    This question evaluates proficiency in string parsing, pattern validation, and algorithmic correctness, covering abbreviation interpretation and bracket balancing while requiring careful handling of edge cases and input constraints.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumData Engineer
    Validate alternating checkout/return logs

    This question evaluates the ability to process sequential event logs, maintain per-entity state invariants (checkout vs return), and reason about algorithmic time and space complexity within a validation task.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Validate parentheses and find k-th largest

    This problem tests your ability to handle nested structures using a stack and your efficiency in order-based selection using heap operations.

    Coding & AlgorithmsTechnical ScreenStackHeapQuickSelect
  • MetaMediumData Engineer
    Write queries for follows and bookings

    This problem tests your ability to manage relational data, handle temporal overlaps for booking availability, and derive insights from social graph-like connections using SQL or data manipulation scripts.

    Coding & AlgorithmsTechnical ScreenSQLIntervalsGraphs
  • MicrosoftMediumSoftware Engineer
    Answer common graph, grid, and array tasks

    This problem tests your ability to model a dependency system as a directed graph and identify if a valid order exists using cycle detection (Kahn's Algorithm or DFS).

    Coding & AlgorithmsTechnical ScreenGraphTopological SortDFS
  • MicrosoftMediumSoftware Engineer
    Assemble DNA payload strings from tagged fragments

    This question evaluates proficiency in string manipulation, sequence assembly, and labeled-graph path reconstruction—skills involved in ordering fragments by matching start/end tags and concatenating payloads—and it belongs to the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Build a CSV Query Engine

    This problem tests your ability to parse structured text, perform basic type inference, and implement a filtering mechanism for tabular data.

    Coding & AlgorithmsTechnical ScreenParsingData ModelingType Inference
  • MicrosoftMediumSoftware Engineer
    Check palindrome and find next larger palindrome

    This question tests string manipulation, edge-case handling, and algorithmic efficiency in generating the smallest palindrome greater than a given numeric string.

    Coding & AlgorithmsTechnical ScreenStringsTwo PointersMath
  • MicrosoftHardSoftware Engineer
    Compute discounted prices and full-price indices

    This question evaluates array-processing skills, competency with next-smaller-or-equal element patterns, and the ability to compute aggregated results under ordering constraints.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Compute shortest path in cyclic graph

    This question tests the ability to implement a shortest-path algorithm in a directed graph that may contain cycles, specifically evaluating the selection between Dijkstra's algorithm and Bellman-Ford based on edge weight constraints.

    Coding & AlgorithmsTechnical ScreenGraphsShortest-PathDijkstra
  • MicrosoftMediumSoftware Engineer
    Compute sum of longest positive subarray

    Compute sum of longest positive subarray 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 & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Count Occurrences of Each Suffix Maximum

    This problem tests your ability to use a monotonic stack and a hash map (or frequency array) to efficiently answer suffix queries about the occurrences of the maximum value.

    Coding & AlgorithmsTechnical ScreenArrayGreedyOptimization
  • MicrosoftMediumSoftware Engineer
    Count k for consecutive-sum generator

    This question evaluates number-theoretic reasoning and understanding of arithmetic progressions, focusing on how sums of consecutive positive integers can be characterized and counted.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Count non-decreasing arrays by digit sums

    This question evaluates combinatorics and constrained counting skills, including reasoning about digit-sum properties, monotonic sequences, modular arithmetic, and efficient algorithm design within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Design a Versioned Key-Value Store

    This problem tests your ability to design a data structure that supports storing multiple values for the same key indexed by timestamps, requiring efficient retrieval of the latest value at or before a specific point in time.

    Coding & AlgorithmsTechnical ScreenHash MapBinary SearchData Structures
  • MicrosoftMediumSoftware Engineer
    Design cache with least-recently-used eviction

    This question evaluates understanding of in-memory key–value cache design, eviction policies, and appropriate data-structure choices to achieve amortized O(1) get and put operations.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftHardSoftware Engineer
    Detect Repeated Patterns in a String Sequence

    This problem tests string manipulation, hashing, and the ability to detect repeating sub-sequences of a fixed length k across a stream.

    Coding & AlgorithmsTechnical ScreenStringsHashingSliding Window
  • MicrosoftMediumSoftware Engineer
    Determine most popular concert city

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine most popular concert city states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumMachine Learning Engineer
    Find Top K Largest Elements

    This question tests the ability to efficiently find the K largest elements in an unsorted array while managing time complexity constraints through heap-based or selection-based algorithms.

    Coding & AlgorithmsTechnical ScreenArraysHeapSorting
  • MicrosoftMediumSoftware Engineer
    Find Unique Zero-Sum Triplets

    Find unique zero-sum triplets with distinct indices, deterministic ordering, careful duplicate suppression, and explicit time and space analysis.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftHardSoftware Engineer
    Find all balanced k in a permutation

    This question evaluates understanding of permutations, array range reasoning, index mapping, and efficient algorithm design for detecting contiguous subarrays that exactly contain the prefix set {1..k}.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Find longest substring without repeating characters

    This problem tests your ability to use the sliding window technique combined with a hash map to efficiently find a maximal subarray meeting a specific constraint.

    Coding & AlgorithmsTechnical ScreenSliding WindowHash MapString
  • MicrosoftMediumSoftware Engineer
    Find lowest common ancestor in tree

    This question evaluates understanding of tree data structures and the lowest common ancestor concept, contrasting use of binary search tree ordering with the general binary tree case while requiring algorithmic time and space complexity reasoning in the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumMachine Learning Engineer
    Find pairs with the minimum absolute difference

    This question evaluates array manipulation, sorting-based reasoning, and the ability to generate ordered value pairs that reflect minimum absolute differences while handling ordering and duplicates.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftHardSoftware Engineer
    Group GPUs by node and partition by links

    This problem tests your ability to model a network as a graph and perform partitioning to optimize internal connectivity constraints.

    Coding & AlgorithmsTechnical ScreenGraph TheoryBipartite MatchingCombinatorial Optimization
  • MicrosoftMediumSoftware Engineer
    Implement a Snapshot Set Iterator

    This problem tests your ability to design a data structure that maintains point-in-time consistency for an iterator despite subsequent modifications to the underlying collection.

    Coding & AlgorithmsTechnical ScreenData StructuresDesignIterator
  • MicrosoftMediumSoftware Engineer
    Implement a type-based mutex for tasks

    This problem tests knowledge of synchronization primitives, dictionary-based locking mechanisms, and the ability to manage resource contention based on dynamic categorization.

    Coding & AlgorithmsTechnical ScreenConcurrencySynchronizationMultithreading
  • MicrosoftHardSoftware Engineer
    Implement array and tree traversal tasks

    This problem tests your ability to optimize an array-based trading algorithm using a greedy approach and your mastery of level-order tree traversal to extract a specific view of a binary tree.

    Coding & AlgorithmsTechnical ScreenGreedyBFSDFS
  • MicrosoftHardSoftware Engineer
    Implement concurrent structures and debug queue code

    This question evaluates data-structure implementation and concurrent programming competencies by testing construction of an LRU cache, a custom hash map, a quadtree spatial index, and debugging of a producer-consumer queue.

    Coding & AlgorithmsTechnical Screen
  • MicrosoftMediumSoftware Engineer
    Implement greedy decoding and beam search

    This question evaluates understanding of autoregressive decoding strategies—greedy decoding and beam search—including cumulative log-probability scoring, beam maintenance, EOS handling, and sequence expansion logic; it is categorized under Coding & Algorithms for Software Engineer roles.

    Coding & AlgorithmsTechnical Screen