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 211–240 of 427 results
- MathWorksMediumSoftware EngineerDecide transform via one-to-one mapping
This question evaluates understanding of character-to-character mappings in strings, modeling those mappings as directed graphs, detection and handling of cycles, and the ability to construct a sequence of replacements.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerDetermine string transform via end-append moves
This question evaluates a candidate's understanding of string manipulation, permutation feasibility, and algorithmic optimization for computing minimal move counts.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerFind shortest path using BFS
This question evaluates a candidate's proficiency with graph traversal algorithms—particularly breadth-first search—and the ability to model grid-based shortest-path problems while reasoning about time and space complexity.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerImplement BFS shortest paths with reconstruction
This question evaluates understanding of graph traversal via breadth-first search, computation of shortest paths in unweighted graphs, and path reconstruction using parent arrays, assessing algorithmic reasoning and implementation skills in the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMaximize disjoint k-sum pairs
This question evaluates proficiency in array algorithms, pairing logic, data structure selection, and complexity analysis, focusing on maximizing disjoint k-sum pairs and reasoning about space–time trade-offs.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMaximize operations by removing target-sum pairs
This question evaluates a candidate's ability to design and analyze efficient array algorithms and use appropriate data structures and techniques such as hash maps or sorting with two-pointer strategies, with attention to time and space complexity.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign a bank system with scheduled transfers
This question evaluates object-oriented design and stateful system skills, including time-ordered event processing, scheduling and cancellation semantics, balance accounting, and top-k aggregation using appropriate data structures.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign an in-memory cloud file system
This question evaluates understanding of object-oriented design, stateful data structures, and resource management including user quotas, ownership semantics, and file metadata operations.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign an in-memory database with TTL and history
This question evaluates understanding of time-versioned in-memory key–field–value stores, covering TTL-based expiration, historical reads, atomic compare-and-set/delete semantics, efficient scan/scan-by-prefix operations, and time/space complexity analysis, and it belongs to the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerExtend cloud file system with copy and compression
This question evaluates understanding of data structures and algorithms for stateful resource management, covering bookkeeping of per-user quotas, file metadata operations (copy, compress/decompress), string filtering and sorting, and efficient selection and deletion of largest elements.
Coding & AlgorithmsOnline Assessment - MetaEasySoftware EngineerImplement Multi-Level In-Memory Services
This question evaluates a candidate's ability to design and implement mutable in-memory data structures and algorithms for stateful service simulations, covering account and file modeling, temporal operations with lazy expiration, ranking queries, merging entities, and capacity constraints.
Coding & AlgorithmsOnline Assessment - MetaHardSoftware EngineerImplement a Timestamped Banking System
This problem tests the ability to manage time-series data using efficient lookups and range queries, specifically requiring a balance between transactional updates and historical state retrieval.
Coding & AlgorithmsOnline AssessmentData StructuresBinary SearchTime-series - MetaMediumSoftware EngineerImplement a versioned in-memory DB with CAS and history
This question evaluates a candidate's ability to design and implement time-versioned in-memory data structures, conditional concurrency primitives (compare-and-set and compare-and-delete), TTL expiration semantics, and efficient historical reads.
Coding & AlgorithmsOnline Assessment - 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 - 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 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 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
MathWorks
Meta
Microsoft