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 841–870 of 1706 results
- MetaMediumSoftware EngineerFind minimum and most frequent number efficiently
Find minimum and most frequent number efficiently 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 EngineerFind mode or minimum with time-space tradeoffs
This question evaluates algorithm design and analysis skills—particularly time–space tradeoffs, frequency counting techniques (sorting, hashing, and counting arrays), and handling streaming or memory-constrained inputs in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind power-of-two subarrays within sum range
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find power-of-two subarrays within sum range states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - 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 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 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 - 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 - 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 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 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 - 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 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 - MetaMediumSoftware EngineerImplement string dedup and mirror tree traversal
This question evaluates string-processing and tree-traversal algorithm skills, focusing on efficient group-deletion and streaming-capable string dedup operations and a mirrored boundary traversal of binary trees, and it tests algorithmic design, complexity guarantees, and correctness/termination reasoning.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerImplement string sum and weighted city picker
Implement string sum and weighted city picker 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 EngineerMap Random Tickets to Population-Weighted Cities
Map deterministic tickets to cities in proportion to their population weights by building cumulative ranges and locating each possibly repeated ticket efficiently.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerMaximize Letters from Disjoint Words
This problem tests your ability to use recursion with backtracking and bit manipulation to find the maximum number of unique characters that can be formed by a subset of mutually disjoint words.
Coding & AlgorithmsTechnical ScreenBit ManipulationBacktrackingRecursion - MetaMediumSoftware EngineerMerge two interval lists into a union
This question evaluates a candidate's ability to implement interval merging algorithms, reason about edge cases such as touching boundaries, empty inputs, and invalid intervals, and perform time and space complexity analysis.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerNavigate unknown grid to locate target
This question evaluates algorithmic problem-solving and spatial reasoning skills, particularly graph traversal, exploration in unknown environments, state encoding for relative coordinates, and reasoning about correctness.
Coding & AlgorithmsTechnical Screen - MetaMediumData ScientistOptimize Travel Costs and Generate Rotational Symmetric Numbers
This question evaluates algorithmic optimization and complexity-analysis skills by combining array-based time-dependent pricing for round-trip cost minimization with combinatorial generation of rotationally symmetric (strobogrammatic) k-digit numbers.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerOptimize flight costs and find grid path
This question evaluates algorithm design and problem-solving skills for array-based cost optimization and grid pathfinding, including selection under ordering constraints, path existence detection and path reconstruction, together with correctness and edge-case reasoning.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerOptimize repeated-value vectors and compute exclusive times
This question evaluates proficiency in data-structure and algorithmic concepts such as run-length encoding for compressed vectors and interval/nesting reasoning for computing exclusive execution times.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerPalindrome After Deleting at Most One Character
This problem tests your ability to optimize string traversal using a two-pointer approach, specifically handling conditional branch logic when an inconsistency is detected.
Coding & AlgorithmsTechnical ScreenStringsTwo PointersGreedy - MetaMediumSoftware EngineerProduce asymmetric side views of a binary tree
Produce asymmetric side views of a binary tree 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 - MetaHardSoftware EngineerRemove minimum invalid mixed brackets
This Coding & Algorithms problem evaluates string-processing and bracket-matching skills, specifically understanding of stack-based parsing, handling multiple bracket types, and minimizing removals while preserving non-bracket characters.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerRemove minimum parentheses to balance string
This question evaluates string-processing and algorithm-design skills within the Coding & Algorithms domain, focusing on balancing parentheses, correctness proofs for minimal edits, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen
Meta