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 1411–1440 of 2629 results
- 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 - 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 - MetaMediumSoftware EngineerImplement sparse vector dot product
Meta's sparse vector dot product question asks you to design a SparseVector class that stores only non-zero entries and computes dot products in time proportional to the number of non-zeros rather than the full vector length. It tests sparse data representation, two-pointer vs. hash-map trade-offs, and time/space complexity analysis.
Coding & AlgorithmsOnsite - 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 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 - MetaMediumSoftware EngineerImplement weighted random index picker
Implement weighted random index 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 & AlgorithmsOnsite - MetaMediumSoftware EngineerInfer an Unknown Alphabet Order
This question evaluates a candidate's competency in graph-based reasoning, inference of ordering constraints from sequences of strings, and algorithmic manipulation of characters and relations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerLongest Balanced Substring in a String of Parentheses
A Meta coding interview problem: given a string made only of opening and closing parentheses, return the length of the longest contiguous substring that is correctly balanced. It tests careful handling of matched pairs, unmatched characters that break a run, and efficient processing of long inputs.
Coding & AlgorithmsOnsite - 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 EngineerMaximize Unique Characters from Words
This question evaluates a candidate's ability to reason about combinatorial constraints and set disjointness while maximizing unique coverage, testing competencies in algorithm design, combinatorics, and constraint-based optimization.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMaximize number with one digit swap
Maximize number with one digit swap 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 & AlgorithmsOnsite - MetaMediumSoftware EngineerMaximize score in 15-sum card game
This problem tests your ability to use memoized recursion or dynamic programming to explore state spaces in a combinatorial game where you must decide which cards to remove to maximize your total score.
Coding & AlgorithmsOnsiteRecursionMemoizationBacktracking - MetaMediumSoftware EngineerMerge Two Lists of Non-Overlapping Intervals
This question evaluates a candidate's ability to merge two pre-sorted, non-overlapping interval lists into a single consolidated set, a core array and two-pointer/merging skill in coding interviews. It tests correct handling of edge cases like touching endpoints versus true gaps, assessing precision in interval logic and algorithmic reasoning under linear-time constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMerge overlapping intervals
This problem tests your ability to manipulate array-based data by sorting and performing linear sweeps to consolidate overlapping ranges.
Coding & AlgorithmsOnsiteArraysSortingGreedy - 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 EngineerMinimum Round-Trip Flight Cost
This question evaluates a candidate's ability to optimize over paired sequences using array traversal and running-minimum tracking, a core array-processing technique in coding interviews. It tests practical application of single-pass optimization under an ordering constraint rather than brute-force pairwise comparison, commonly used to assess algorithmic efficiency and edge-case handling.
Coding & AlgorithmsOnsite - 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 - 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 - 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