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 1801–1830 of 3276 results

  • MetaMediumSoftware Engineer
    Sum Numbers Formed by Root-to-Leaf Paths

    Tests traversal of a complete or sparse binary tree stored in an array, tracking path values to accumulate the total sum of numbers formed from root to leaf.

    Coding & AlgorithmsOnsiteTreeDFSBinary Heap
  • MetaMediumSoftware Engineer
    Traverse binary tree by levels with constraints

    This question evaluates binary tree traversal techniques, use of stacks as constrained data structures, predicate-based filtering of nodes, and the ability to argue algorithmic correctness and analyze time and space complexity.

    Coding & AlgorithmsTechnical Screen
  • MetaMediumSoftware Engineer
    Traverse levels selecting nodes meeting a predicate

    Traverse levels selecting nodes meeting a predicate 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
  • MetaMediumSoftware Engineer
    Validate Sorted Order Under a Custom Alphabet

    This problem tests your ability to define custom comparison logic using a lookup table and verify if a list of strings adheres to a non-standard lexicographical ordering.

    Coding & AlgorithmsTechnical ScreenArraysStringsSorting
  • MetaMediumSoftware Engineer
    Validate a simplified numeric string

    This question evaluates string-parsing, formal-grammar validation, and edge-case reasoning competencies, including the ability to recognize valid numeric formats and to provide time and space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • 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
  • MetaMediumData Engineer
    Validate carpool capacity

    This question evaluates understanding of interval-based resource accounting and algorithmic reasoning with cumulative constraints, assessing skills in processing time-bound events and managing capacity limits.

    Coding & AlgorithmsOnsite
  • 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
  • MetaMediumSoftware Engineer
    Validate word abbreviation and reconcile two abbreviations

    Validate word abbreviation and reconcile two abbreviations 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 & AlgorithmsOnsite
  • MetaHardData Engineer
    Write SQL for car rental utilization by city

    This question evaluates proficiency in SQL querying and relational data modeling, focusing on time-interval overlap logic, distinct aggregation across joined tables, null handling, and safe computation of utilization metrics.

    Coding & AlgorithmsOnsite
  • 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
  • Micro1MediumSoftware Engineer
    Merge Overlapping Intervals

    Tests sorting and linear scanning techniques to consolidate overlapping and adjacent closed intervals into a minimal sorted set.

    Coding & AlgorithmsOnline Assessmentarrayssortingintervals
  • MicrosoftMediumSoftware Engineer
    Answer Running Median Queries Over a Stream of Inserted Integers

    A coding problem that processes a stream of add and median operations and returns, for every query, the median of all integers inserted so far. It tests choosing data structures that keep the middle of a growing collection quickly accessible, plus correct averaging when the count is even.

    Coding & AlgorithmsOnsite
  • 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
  • MicrosoftHardSoftware Engineer
    Answer suffix maximum-frequency queries

    This problem tests your ability to optimize range frequency queries using precomputation and efficient data structures, specifically focusing on suffix-based constraints.

    Coding & AlgorithmsOnsiteBinary SearchData StructuresArrays
  • 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
  • MicrosoftHardSoftware Engineer
    Assemble async stream reads into objects

    This problem tests your ability to handle partial reads from an asynchronous stream and correctly parse length-prefixed binary data structures.

    Coding & AlgorithmsOnsiteAsyncStreamsBinary-Parsing
  • MicrosoftMediumSoftware Engineer
    Bucket Words That Are Letter Rearrangements of One Another

    A coding exercise that partitions a list of lowercase words into groups whose members use exactly the same letters with the same counts, returned in a fixed canonical order. It tests efficient grouping over up to ten thousand words, handling duplicates and empty strings, and producing deterministic sorted output.

    Coding & AlgorithmsOnsite
  • 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 a Linked List Palindrome Without Mutating It

    Check whether a singly linked list is a palindrome in O(n) time and O(1) pointer space without leaving it modified. Practice finding the midpoint, reversing the second half, comparing values, and restoring every link before return.

    Coding & AlgorithmsOnsite
  • 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
  • MicrosoftMediumSoftware Engineer
    Check palindrome number and next palindrome

    This question tests your ability to manipulate digits of an integer to identify palindromes and efficiently construct the smallest palindrome greater than a given number.

    Coding & AlgorithmsOnsiteMathStringsAlgorithms
  • 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
  • MicrosoftHardSoftware Engineer
    Compute product of array except self

    This problem tests your ability to manipulate array prefixes and suffixes to compute aggregate values efficiently without using the division operator, while handling constraints like modular arithmetic.

    Coding & AlgorithmsOnline AssessmentArrayPrefix SumOptimization
  • 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
    Convert a Hexadecimal Address to Dotted IPv4

    Convert an eight-digit hexadecimal address to network-order dotted IPv4 with strict validation, optional prefixes, and correct high-bit handling.

    Coding & AlgorithmsOnsite
  • MicrosoftMediumSoftware Engineer
    Count Binary Substrings with Two Equal Blocks

    Tests string traversal, run-length grouping, and recognizing how adjacent homogeneous blocks contribute to valid balanced substrings.

    Coding & AlgorithmsOnline AssessmentStringsTwo PointersGreedy
  • MicrosoftHardSoftware Engineer
    Count Non-Decreasing Arrays with Prescribed Digit Sums

    Count non-decreasing arrays whose values are at most 5000 and match specified decimal digit sums, returning the total modulo 1000000007.

    Coding & AlgorithmsOnline Assessment