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 2336 results
- 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 EngineerScale a Cache or Rate Limiter Across Multiple Machines
Tests your ability to design a horizontally scalable distributed rate limiter and caching layer, focusing on data partitioning, hot-key mitigation, failure modes, and consistency trade-offs.
System DesignOnsitesystem-designdistributed-systemsrate-limiting - 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 EngineerSet up a Python interview environment
This question evaluates proficiency in Python development environment setup, including dependency and virtual environment management, secure handling of environment variables for secrets, tooling for rapid feedback, reproducibility practices, and basic service scaffolding.
Data Manipulation (SQL/Python)Onsite - MetaMediumSoftware EngineerShare different perspective from leadership feedback
This question evaluates a software engineer's ability to receive and integrate leadership feedback, measuring competencies such as adaptability, self-awareness, communication, and accountability.
Behavioral & LeadershipOnsite - 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 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 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 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 - 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 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 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 - MetaMediumSoftware EngineerSolve grid path and robot navigation
This question evaluates proficiency in graph traversal and pathfinding, state representation for unknown environments, exploration and backtracking, and rigorous reasoning about correctness and time/space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve grid shortest path and robot cleaning
This question evaluates a candidate's ability to implement grid-based graph traversal and stateful simulation, assessing skills in shortest-path search and systematic exploration for cleaning tasks.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve island and frequency problems
These problems evaluate graph traversal and connected-component identification in 2D grids plus frequency analysis and selection in arrays, covering concepts such as DFS/BFS, Union-Find, hashing, heaps and bucket sort.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve linked-list and top-K algorithm tasks
This question evaluates competency in fundamental data structures and algorithmic techniques, including linked list manipulation, frequency counting and top‑K retrieval, closest-point geometric queries, and stack-based string processing for repeated deletions.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve peak element and unique word abbreviation
This question evaluates algorithmic design and data-structure skills by combining a binary-search peak-finding problem with a string-abbreviation uniqueness problem, testing competence in time-complexity reasoning and creation of minimal unique representations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve three LeetCode coding problems
The trio of problems — Minimum Remove to Make Valid Parentheses, Making a Large Island, and Binary Tree Right Side View — evaluates algorithmic problem-solving, proficiency with core data structures (strings, grids/graphs, and trees), and awareness of time and space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree leaf sum and target indices search
This question evaluates proficiency in tree traversal and array search algorithms, specifically handling recursive depth-first traversal with path-based numeric accumulation and performing logarithmic-time search over sorted data.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree traversal and two-pointer problems
Solve tree traversal and two-pointer 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 & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve word count, node, segmentation, stock tasks
This multipart question evaluates skills in tokenization and streaming text processing, generic rooted-tree data-structure design and traversal APIs, dictionary-based string segmentation (dynamic programming and prefix/prefix-structure optimization), and constrained algorithmic optimization for stock-trading problems.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSum Numbers Formed by Root-to-Leaf Paths
Tests traversal of a complete or sparse binary tree stored in an array, tracking path values to accumulate the total sum of numbers formed from root to leaf.
Coding & AlgorithmsOnsiteTreeDFSBinary Heap - MetaMediumSoftware EngineerValidate word abbreviation and reconcile two abbreviations
Validate word abbreviation and reconcile two abbreviations 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 - MetaHardSoftware EngineerWalk through a resume deep dive
This question evaluates ownership, technical leadership, system design, and operational reliability by requiring an end-to-end deep dive into an infrastructure project covering problem definition, architecture, scaling (QPS, latency, storage), SLOs, incident response, and impact metrics.
Behavioral & LeadershipOnsite - MicrosoftMediumSoftware EngineerAdapt When Project Requirements Change Midway
Explain a mid-project requirement change through concrete first steps, personal ownership, alternatives, scope trade-offs, and revised acceptance criteria.
Behavioral & LeadershipOnsite - MicrosoftMediumSoftware EngineerAnswer Running Median Queries Over a Stream of Inserted Integers
A coding problem that processes a stream of add and median operations and returns, for every query, the median of all integers inserted so far. It tests choosing data structures that keep the middle of a growing collection quickly accessible, plus correct averaging when the count is even.
Coding & AlgorithmsOnsite - MicrosoftHardSoftware EngineerAnswer suffix maximum-frequency queries
This problem tests your ability to optimize range frequency queries using precomputation and efficient data structures, specifically focusing on suffix-based constraints.
Coding & AlgorithmsOnsiteBinary SearchData StructuresArrays
Meta
Microsoft