practice a little every day, paws crossed ♡
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 421–450 of 781 results
- MetaMediumSoftware EngineerImplement an in-memory key-field-value DB with TTL
This question evaluates implementation skills in efficient in-memory data structures, time-to-live (TTL) expiration semantics, ordered and prefix scans, and snapshot backup/restore mechanisms.
Coding & AlgorithmsOnline Assessment - MetaMediumMachine Learning EngineerImplement exponentiation and fill grid distances
This problem tests proficiency in efficient modular exponentiation (binary exponentiation) and multi-source Breadth-First Search (BFS) for computing shortest distances in a grid.
Coding & AlgorithmsOnline AssessmentBFSModular ArithmeticDivide and Conquer - MetaEasySoftware EngineerImplement four coding challenges
This set of four problems evaluates algorithmic problem-solving and implementation skills across deterministic simulation (grid-based placement), dynamic interval/segment maintenance, incremental numeric tracking, and greedy array transformation, emphasizing correctness, state management, and complexity reasoning.
Coding & AlgorithmsOnline Assessment - MetaHardSoftware EngineerImplement held transfers with accept/cancel
This interview question evaluates requirements, scale assumptions, API/data design, architecture, trade-offs, failure modes, and rollout in a realistic interview setting. A strong answer for Implement held transfers with accept/cancel states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerImplement range-sum tree and sort merged lists
Implement range-sum tree and sort merged lists 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 & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerImplement tree column grouping and minimal parentheses fixes
This question evaluates proficiency in tree and string algorithms, specifically binary tree traversal and coordinate-based column grouping with ordering/tie-breaking semantics, as well as string processing for minimal-parentheses deletion, and probes competence with data structures, streaming/online processing, correctness guarantees, and in-place space management. It is commonly asked in the Coding & Algorithms domain to assess algorithmic reasoning, implementation-level trade-offs and complexity analysis, testing both conceptual understanding of ordering and correctness and practical application skills such as achieving linear-time and space-efficient solutions and scaling to large inputs.
Coding & AlgorithmsOnline Assessment - MetaHardSoftware EngineerMerge customers and preserve history
A Meta software-engineer system-design take-home: implement mergeCustomers(oldId, newId) for a payments/ledger platform, absorbing one customer into another while preserving every account's balance and immutable transaction history. Tests identity unification, ownership remap, conflict/duplicate resolution, top-N leaderboard maintenance, atomicity, concurrency, idempotency, and complexity analysis.
System DesignOnline Assessment - MetaMediumMachine Learning EngineerRead Current and Historical Field Values with Expiration
Design an in-memory key-field-value store that supports historical queries, time-to-live (TTL) expiration, and field deletions without corrupting past states.
Coding & AlgorithmsOnline AssessmentBinary SearchDesignHash Table - MetaMediumSoftware EngineerSolve array, tree, and maze problems
This problem tests your ability to combine binary tree traversal with spatial grouping and grid-based pathfinding to determine if nodes with specific values are reachable from a starting point in a maze.
Coding & AlgorithmsOnline AssessmentTreesGraphsBFS - MetaEasyMachine Learning EngineerSolve four OA string/array/matrix/graph tasks
This problem tests foundational proficiency in four distinct domains: string processing, array simulation, matrix transformation, and graph traversal.
Coding & AlgorithmsOnline AssessmentStringsSimulationBFS - MetaMediumSoftware EngineerSolve weighted pick and product except self
This question evaluates algorithm design and data-structure skills, focusing on weighted random selection and array aggregation for product computations within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - Micro1MediumSoftware EngineerCompare Promise.all, Promise.any, and Promise.allSettled
Analyze and compare the behavior of JavaScript's `Promise.all`, `Promise.any`, and `Promise.allSettled` across resolution semantics, failure handling, result ordering, and empty inputs, then apply them to real-world distributed service orchestration.
Software Engineering FundamentalsOnline Assessmentjavascriptpromisesconcurrency - Micro1MediumSoftware EngineerMerge Overlapping Intervals
Tests sorting and linear scanning techniques to consolidate overlapping and adjacent closed intervals into a minimal sorted set.
Coding & AlgorithmsOnline Assessmentarrayssortingintervals - MicrosoftHardSoftware EngineerCompute 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 EngineerCount 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 EngineerCount 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 - MicrosoftMediumSoftware EngineerCount integer pairs satisfying 1/x + 1/y = 1/N
This question evaluates understanding of number theory and algorithmic problem-solving, focusing on Diophantine equation manipulation, divisor counting, and translating algebraic constraints into combinatorial counts.
Coding & AlgorithmsOnline Assessment - MicrosoftMediumSoftware EngineerDebug distributed-system performance problems
This question evaluates a candidate's competency in diagnosing performance regressions in distributed systems and understanding of observability signals, latency and throughput trade-offs, and cross-component interactions within the Software Engineering Fundamentals domain.
Software Engineering FundamentalsOnline Assessment - MicrosoftMediumSoftware EngineerDescribe a recent innovation you delivered
This question evaluates innovation, problem identification, stakeholder influence, trade-off management, measurable impact assessment, and reflective learning within the Behavioral & Leadership domain.
Behavioral & LeadershipOnline Assessment - MicrosoftMediumSoftware EngineerDesign a replicated key-value store with quorums
This question evaluates understanding of replication, quorum protocols, data partitioning, consistency models, failure detection and recovery, and conflict resolution in distributed key–value stores.
System DesignOnline Assessment - MicrosoftMediumSoftware EngineerDesign device telemetry pipeline for real-time and batch
This question evaluates a candidate's competency in distributed systems architecture, data engineering, and operational trade-offs involved in designing telemetry pipelines that support both near-real-time and batch analytics.
System DesignOnline Assessment - MicrosoftMediumSoftware EngineerDesign streaming error-log counting with moving average
This question evaluates understanding of real-time stream processing concepts such as event filtering, stateful per-service counting, sliding-window moving averages, late-event handling, scalability, and fault-tolerant state management for monitoring and alerting.
System DesignOnline Assessment - MicrosoftMediumSoftware EngineerExplain hash map internals and edge cases
This question evaluates understanding of hash map internals and related competencies in data structures, algorithmic complexity, and concurrent programming within the Software Engineering Fundamentals domain, covering collision handling, load factor and resizing, deletion semantics, worst-case behavior, iteration order, and thread-safety concerns.
Software Engineering FundamentalsOnline Assessment - MicrosoftMediumSoftware EngineerFind max consecutive elements with sum below target
This question evaluates algorithmic problem-solving with arrays, including reasoning about contiguous subsequences, handling sorted inputs and edge cases, and analyzing time and space complexity.
Coding & AlgorithmsOnline Assessment - MicrosoftHardSoftware EngineerFind minimum cycle cost per node
This problem tests your ability to identify cycles within a weighted directed graph and compute the ratio of cycle cost to node count efficiently.
Coding & AlgorithmsOnline AssessmentGraphBinary SearchShortest Path - MicrosoftMediumSoftware EngineerFind the Best Connected Strength for Every Tree Node
Compute the maximum weight connected subgraph containing each node in a tree with +1 and -1 neuron weights using rerooting dynamic programming.
Coding & AlgorithmsOnline AssessmentTree DPRerooting DPGraphs - MicrosoftMediumSoftware EngineerMaximize Points by Deleting Values and Their Neighbors
Tests dynamic programming and hash map aggregation to maximize points under adjacency constraints over a sparse range of values.
Coding & AlgorithmsOnline Assessmentdynamic-programminghash-tablesorting - MicrosoftMediumSoftware EngineerMinimize the Largest Value When Picking at Least k Non-Adjacent Houses
Pick at least k houses from a row without choosing two neighbors, so that the largest amount in any chosen house is as small as possible, and return that minimum. With up to 100,000 houses and values up to one billion, the task tests reasoning about a min-max objective under an adjacency constraint.
Coding & AlgorithmsOnline Assessment - MicrosoftMediumSoftware EngineerMost Frequent Substring Under Distinct-Letter and Length Limits
Find how often the most frequent eligible substring appears in a lowercase string, where an eligible substring has a length within a given range and no more than a set number of distinct letters. Overlapping occurrences count and inputs reach 100,000 characters, so the task tests efficient substring counting.
Coding & AlgorithmsOnline Assessment - MicrosoftMediumSoftware EngineerMost Frequent Substring Within a Length Range and a Distinct-Letter Limit
A string coding problem: among all substrings whose length falls in a given range and that use at most a given number of distinct letters, return how many times the most frequent one occurs. It tests handling overlapping occurrences and the distinct-letter limit, counting efficiently on strings of up to 100,000 characters, and returning zero when nothing qualifies.
Coding & AlgorithmsOnline Assessment
Meta
Microsoft