practice a little every day, paws crossed ♡
Software Engineer 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 1381–1410 of 2629 results
- MetaMediumSoftware EngineerFind All Binary Tree Nodes Exactly K Edges from a Target Node
A binary tree coding problem: given a tree with distinct values, a target node and a distance k, return every node exactly k edges away, including nodes reached by moving up through ancestors. It tests traversal in both directions of a tree, level-order input parsing and careful handling of visited nodes.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind Any Local Minimum with Iterative Binary Search
Find the index of any strict local minimum in a nonempty array whose adjacent values differ, using an iterative logarithmic-time algorithm. The task tests search invariants, boundary-as-infinity semantics, singleton and monotone arrays, and correctness when several indices are valid.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind K-th Largest and Longest Vacation
This pair of problems evaluates array manipulation and algorithmic problem-solving skills, specifically order-statistics for selecting the k-th largest element and maximizing consecutive sequences under constrained transformations for the vacation streak problem.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind Kth Largest and Tree Ancestors
This question evaluates algorithmic problem-solving and data-structure competencies, focusing on selection algorithms and time/space complexity reasoning for the k-th largest element and tree traversal, lowest common ancestor discovery with attention to BST properties, parent pointers, and external-memory constraints.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind Shortest Unique Prefixes
This problem tests your ability to efficiently manage and query prefix-based string sets using a Trie (prefix tree) data structure.
Coding & AlgorithmsTechnical ScreenTrieStringsData Structures - MetaMediumSoftware EngineerFind a Local Minimum with Left-Biased Binary Search
This problem tests the ability to adapt binary search to identify a local minimum in an unsorted array, focusing on handling boundary conditions and non-strict inequality logic.
Coding & AlgorithmsOnsiteBinary SearchArraysDivide and Conquer - MetaMediumSoftware EngineerFind balanced subarray and increasing tree path
This question evaluates array and tree algorithm skills, testing competency in identifying longest balanced subarrays in binary sequences and locating maximal strictly increasing downward paths in binary trees.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind integer in most intervals
This question evaluates a candidate's ability to reason about interval overlap counting, manage range endpoints efficiently, and balance time-space trade-offs when identifying points that maximize coverage.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind k most frequent elements, discuss O(n)
Find k most frequent elements, discuss O(n) 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 kth largest element in array
A classic Meta software engineer onsite coding question: return the k-th largest element from an unsorted integer array, handling duplicates correctly. It tests order statistics and selection algorithms — sort, size-k min-heap (O(n log k)), and quickselect (O(n) average) — and the candidate's ability to beat a full sort.
Coding & AlgorithmsOnsite - 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 missing ranges in interval
This question evaluates a candidate's proficiency in array traversal, interval reasoning, handling edge cases including empty inputs and 32-bit integer boundary conditions, and enforcing time and space complexity constraints.
Coding & AlgorithmsOnsite - 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 shortest subarray with range ≥ k
This question evaluates proficiency with array algorithms and range-query reasoning, testing understanding of max/min behavior over contiguous subarrays and use of appropriate data-structure techniques; it belongs to the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind shortest substring with N unique characters
This question evaluates proficiency in string processing, handling character-uniqueness constraints, and algorithmic thinking about time and space efficiency.
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 - 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 - 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 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
Meta