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 1501–1530 of 2810 results
- 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 paginated, sortable dynamic table component
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 paginated, sortable dynamic table component states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Software Engineering FundamentalsTechnical 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 - MetaHardSoftware EngineerImplement, Debug, and Optimize a React Table
Implement, Debug, and Optimize a React Table evaluates requirements, assumptions, structured reasoning, trade-offs, and verification in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Software Engineering FundamentalsTechnical 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 EngineerMeasure Forty-Five Minutes with Two Unevenly Burning Ropes
Measure exactly 45 minutes using two ropes that each burn for 60 minutes but at unpredictable rates. The reasoning must rely only on lighting rope ends and observing completion events, never on assuming that half a rope represents half the time.
Statistics & MathTechnical Screen - 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 - 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 - MetaMediumSoftware EngineerRemove runs of length at least k
This question evaluates string manipulation, run-length detection, and algorithmic efficiency, focusing on tracking and removing maximal contiguous character groups. It is commonly asked in the Coding & Algorithms domain to assess practical application–level skills in designing linear-time, linear-space implementations that handle dynamic sequence collapses using appropriate data structures.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerReverse between equal-value nodes in list
This question evaluates a candidate's ability to manipulate singly linked lists, perform in-place sublist reversal, and manage pointer references and node boundaries.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerReverse sublist between equal-value nodes
This question evaluates linked-list manipulation and pointer-management skills, focusing on reversing an in-place sublist between two nodes with equal values while respecting O(n) time and O(1) extra space constraints.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve Four Online Assessment Problems
This multi-part question evaluates algorithmic problem-solving across array manipulation, exact fraction comparison, scheduling and simulation with ordered event lists, matrix transformation operations, and string concatenation/counting, exercising skills in data structures, searching, and combinatorial counting.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve PTO window and sparse unique counting
Solve PTO window and sparse unique counting 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 EngineerSolve Three Coding Interview Problems
This set of tasks evaluates proficiency in data structures and algorithms, covering tree traversal and lowest common ancestor reasoning, interval merging and overlap resolution, and combinatorial subset selection under uniqueness constraints.
Coding & AlgorithmsTechnical Screen - MetaEasySoftware EngineerSolve Tree View and Triplet Sum
This multipart question evaluates proficiency with tree-based data structures and array-based algorithmic problem solving, focusing on reasoning about which nodes are visible from a binary tree's right side and identifying unique zero-sum triplets in an integer array; it tests concepts such as tree traversal, duplicate handling, and algorithmic complexity analysis. These problems are commonly asked to assess algorithmic problem-solving ability, manipulation of fundamental data structures, and attention to edge cases and performance, and they fall under the Coding & Algorithms category with a focus on practical application of algorithmic concepts supported by conceptual understanding of data structures and complexity.
Coding & AlgorithmsTechnical Screen - MetaHardSoftware EngineerSolve Two Backtracking Array Problems
This prompt evaluates algorithmic problem-solving skills focused on combinatorial search and backtracking, including handling duplicate values, index distinctness, and enforcing character-uniqueness constraints across concatenated subsets.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve UTF-8 Validation & Shortest Path
This pair of problems evaluates skills in data encoding interpretation and graph traversal, examining competency in validating byte-oriented input formats and computing shortest paths on binary matrices.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve counting and frequency coding tasks
This problem tests your ability to handle frequency counting and constraint-based pair identification efficiently, often requiring a hash map to maintain counts while traversing a stream.
Coding & AlgorithmsTechnical ScreenHash TableArraysCounting - MetaMediumSoftware EngineerSolve diverse LeetCode algorithm problems
This collection evaluates proficiency with fundamental data structures and algorithmic techniques — including matrix and graph traversal, hash-based sets for O(1) operations, linked list manipulation, sliding-window strategies, recursive processing of nested structures, and stack/string handling — along with complexity analysis and reliable implementation. Commonly asked in the Coding & Algorithms domain, these problems assess pattern recognition, algorithmic reasoning, and practical implementation skills under time and space constraints, emphasizing applied problem-solving over purely theoretical concepts.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve grid path and top‑k frequency
This question evaluates algorithmic problem-solving in grid reachability and frequency analysis, testing concepts such as grid/graph traversal and obstacle handling for path existence alongside frequency counting and selection for top-k elements.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve increasing sequence and path problems
Solve increasing sequence and path problems 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
Meta