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 1441–1470 of 2629 results
- 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 EngineerResolve a cd Path Against the Current Directory
Implement simplified Unix-style cd path resolution for absolute and relative inputs containing repeated separators, dot components, and parent-directory steps. The challenge focuses on component semantics, root boundaries, empty arguments, exact normalization, and linear processing of long paths without filesystem lookups.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerReturn a Shortest Path Through a Binary Grid
Implement breadth-first search on an 8-directional binary grid to find and reconstruct a deterministic shortest path from the top-left to the bottom-right cell.
Coding & AlgorithmsOnsiteBFSGraphMatrix - MetaMediumSoftware EngineerReturn all root-to-leaf path sums
This question evaluates competency in binary tree traversal and path-state accumulation, focusing on the ability to compute sums along root-to-leaf paths while handling edge cases like empty trees and negative values.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerReturn right and left side views of a tree
This problem tests your ability to perform level-order traversal on a binary tree and manipulate the results to extract the boundary nodes.
Coding & AlgorithmsOnsiteBinary TreeBFSDFS - MetaHardSoftware EngineerReturn the Minimum-Sum Root-to-Leaf Path
Tests tree traversal, path reconstruction, tie-breaking logic, and handling deeply skewed trees with up to 100,000 nodes without exceeding recursion depth limits.
Coding & AlgorithmsOnsitebinary-treedfsstack - 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 EngineerSelect words to maximize unique characters
This question evaluates understanding of combinatorial search and string manipulation, specifically the ability to reason about unique-character constraints, subset selection, and set-like representations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Array, Matrix, and Recommendation Problems
This question evaluates algorithmic skills across array manipulation, grid pathfinding, and graph-based recommendation systems, testing competencies in in-place transformations, efficient traversal/search, and candidate ranking under constraints.
Coding & AlgorithmsOnsite - 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 Matrix, Tree, Nested, LCA, Maze Tasks
This set of tasks evaluates algorithm design and data structure competencies across matrix traversal, tree path-sum aggregation, nested-list depth weighting, lowest common ancestor discovery using parent pointers, and several rolling-maze reachability and shortest-path variants.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Maze and Suffix Problems
This two-part question evaluates stateful graph traversal and shortest-path reasoning under key-and-door constraints, alongside efficient string-suffix matching and scalable data-structure design, testing competencies in state management, graph/search algorithms, string algorithms, and algorithmic optimization.
Coding & AlgorithmsOnsite - 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 Parser, Trading, Tree, And Deck Tasks
This question evaluates input validation and parsing for numeric literals, array-based algorithmic optimization for single-trade profit, tree traversal for extracting rightmost nodes per depth, and software design for a stateful card-deck with shuffle and testing.
Coding & AlgorithmsOnsite - 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 - MetaMediumSoftware EngineerSolve Tree Diameter and Palindromic Counts
This problem tests your ability to perform recursive depth-first searches on binary trees and efficient string manipulation to count palindromic subsequences or paths.
Coding & AlgorithmsOnsiteTreesDFSString - 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 a Key-Door Corridor Maze
This problem tests your ability to model a search space beyond simple coordinate traversal by incorporating state-dependent constraints (keys) using Breadth-First Search.
Coding & AlgorithmsOnsiteBFSBitmaskShortest Path - MetaMediumSoftware EngineerSolve array merge and tree flattening problems
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve array merge and tree flattening problems states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsHR Screen - MetaMediumSoftware EngineerSolve array, tree, and maze problems
This problem tests your ability to combine binary tree traversal with spatial grouping and grid-based pathfinding to determine if nodes with specific values are reachable from a starting point in a maze.
Coding & AlgorithmsOnline AssessmentTreesGraphsBFS - MetaMediumSoftware EngineerSolve binary tree, grid, and heap tasks
Solve binary tree, grid, and heap tasks 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 EngineerSolve classic LeetCode problems
This question evaluates proficiency with core data structures and algorithmic techniques including array selection and ordering, string pattern grouping, interval/rectangle merging, and binary search tree range queries.
Coding & AlgorithmsOnsite - 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 - MetaEasySoftware EngineerSolve four OA coding problems
This set of coding tasks evaluates fundamental skills in array manipulation, graph traversal, greedy strategy, and sequence analysis.
Coding & AlgorithmsHR ScreenArraysGreedyGraphs - MetaMediumSoftware EngineerSolve four algorithmic problems
This multi-part question evaluates algorithmic problem-solving and data-structure proficiency across string processing (validating parentheses with minimal deletions), tree operations (lowest common ancestor using parent pointers), nested-structure traversal and accumulation (depth-weighted sum), and geometric selection/ordering (k closest points).
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve four data structure and algorithms tasks
This set of tasks evaluates core algorithmic competencies such as tree traversal and level-order processing, data-structure design and counting maps, recursive subtree aggregation for statistical checks, and optimization/search techniques for partitioning problems, all within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite
Meta