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 1681–1710 of 3276 results
- MetaMediumMachine Learning EngineerFind target using robot movement API
This question evaluates a candidate's ability to design exploration and state-space search strategies for a robot operating in an unknown, partially blocked 2D grid using a constrained movement and sensing API, testing competency in traversal algorithms, state management, and handling limited observability.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind the Unique Pair of Array Indices Whose Values Sum to a Target
Given an integer array and a target, return the indices of the only pair of different elements whose values add up to the target, smaller index first. Arrays hold up to 10,000 values of up to one billion in magnitude, and the task is a common warm-up that tests clean, efficient array reasoning.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind the kth largest element
This question evaluates a candidate's mastery of finding the k-th largest element using selection algorithms and heap data structures, along with algorithmic time and space complexity analysis and techniques for adapting solutions to streaming inputs.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind top-K frequent elements in a stream
This question evaluates understanding of streaming algorithms, frequency estimation, and data-structure-based top-K selection, emphasizing space/time and accuracy trade-offs when processing large or unbounded data.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerGenerate unique permutations with duplicates
This question evaluates a candidate's understanding of permutation generation and duplicate handling within algorithm design, testing combinatorial reasoning, correctness proofs, and time/space complexity analysis.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerGroup Binary Tree Nodes by Vertical Column, Top to Bottom and Left to Right
Return a binary tree's node values grouped by vertical column from left to right, ordering each column top to bottom and breaking ties within a row by left-to-right position. The tree arrives as a level-order list, and the task tests coordinate tracking during traversal and precise tie handling.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerGroup a tree by vertical columns
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Group a tree by vertical columns states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaHardSoftware EngineerGuide a mouse to find cheese with APIs
This problem tests your ability to navigate an unknown environment by maintaining internal state and implementing an efficient search algorithm to reach a target.
Coding & AlgorithmsTechnical ScreenGraphDFSBacktracking - MetaMediumSoftware EngineerHandle palindrome & decimal addition
This question evaluates string manipulation and numeric representation skills, specifically handling decimal-point addition with arbitrary precision and reasoning about palindrome/permutation properties.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerImplement BST Iterator and Ticket Queue
This problem tests your ability to implement an iterator for a Binary Search Tree (BST) using controlled traversal, and your skill in designing a priority-based queue that handles multi-criteria ordering.
Coding & AlgorithmsOnsiteTreesHeapsIterator - MetaMediumMachine Learning EngineerImplement LRU cache and copy random list
This problem tests your ability to handle complex pointer manipulation through linked-list deep copying and your proficiency in designing a thread-safe-capable cache using hash maps and doubly-linked lists.
Coding & AlgorithmsOnsiteLinked ListsHash MapsLRU Cache - 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 - MetaMediumMachine Learning EngineerImplement Sparse Matrix Operations
This question tests the ability to design an efficient data structure for sparse matrix storage and implement optimized multiplication between a sparse matrix and a dense vector.
Coding & AlgorithmsTechnical ScreenData StructuresLinear AlgebraOptimization - MetaMediumSite Reliability EngineerImplement a Streaming VMStat Alert
This question tests the ability to design a memory-efficient sliding window mechanism for monitoring high-frequency system metrics in real-time.
Coding & AlgorithmsTechnical ScreenSliding WindowData StructuresStreaming - 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 Expiring Record Store
This question evaluates skills in designing and implementing an in-memory, level-based key-field-value store with lexicographic scanning, time-based versioning, TTL semantics, and efficient mutation operations.
Coding & AlgorithmsTechnical Screen - 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 - MetaEasySoftware EngineerImplement array parity and tree level views
This problem tests your ability to handle two distinct sub-tasks: identifying array elements with unique parity and performing a level-order traversal of a binary tree.
Coding & AlgorithmsTechnical ScreenArraysHash MapsBinary Trees - MetaMediumSoftware EngineerImplement basic expression evaluator
This question evaluates proficiency in expression parsing, operator precedence handling, integer arithmetic semantics (including truncating division), and efficient tokenization and evaluation within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerImplement cd and merge intervals
This problem tests your ability to manipulate string-based file system paths using a stack-based approach and consolidate overlapping time intervals using sorting.
Coding & AlgorithmsTechnical ScreenStringsStackSorting - 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 - MetaMediumMachine Learning EngineerImplement exponentiation and link tree neighbors
This question evaluates numerical algorithm implementation and in-place tree traversal skills, specifically fast exponentiation with careful edge-case and precision handling and iterative linking of next pointers in a perfect binary tree.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerImplement fast power and k-palindrome
This problem tests your ability to implement binary exponentiation for efficient numerical calculation and dynamic programming for optimal string manipulation.
Coding & AlgorithmsTechnical ScreenRecursionDynamic ProgrammingMath - 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 in-place duplicate removal
This question evaluates proficiency in in-place array manipulation, handling duplicates in sorted sequences, and formal reasoning about space and time complexity.
Coding & AlgorithmsTechnical Screen - MetaEasySoftware EngineerImplement list cloning and k-frequency finder
The first part evaluates understanding of linked data structures and deep-copy semantics, focusing on preserving node values and both next and arbitrary random pointer relationships while reasoning about node identity and cycles, and is commonly asked to assess correctness in memory/reference handling and structural preservation.
Coding & AlgorithmsTechnical Screen - 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 right side view and local minimum search
This question evaluates a candidate's understanding of binary tree traversal and array local-minimum detection, measuring skills in data structures (binary trees and arrays), algorithm design, and algorithmic time-complexity analysis.
Coding & AlgorithmsTechnical Screen
Meta