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 1471–1500 of 2629 results
- 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 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 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 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 - 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 island connectivity and string multiplication
This question evaluates graph connectivity reasoning (computing minimum edges to unify components) and string-based big-integer arithmetic (multiplying numbers represented as strings), testing competency in graph theory, component analysis, and numeric string manipulation.
Coding & AlgorithmsTechnical Screen - 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 - MetaEasySoftware EngineerSolve palindrome-check and vertical-order traversal
This prompt evaluates string-processing and tree-traversal competencies by asking whether a string can become a palindrome after at most one deletion and by requiring a vertical-order traversal of a binary tree, testing understanding of palindrome properties, node ordering, and handling of edge cases in the coding and algorithms domain.
Coding & AlgorithmsTechnical Screen - 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 permutation successor and evaluate expressions
This question evaluates understanding of lexicographic permutation generation with in-place array manipulation and linear-time arithmetic expression parsing and evaluation, focusing on algorithmic efficiency, constant extra space constraints, and correct operator semantics.
Coding & AlgorithmsTechnical Screen - 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 diameter and grid path problems
This question evaluates understanding of graph algorithms and pathfinding, covering tree diameter computation and grid shortest-path problems as well as enumeration of simple paths, and requires skills in traversal techniques, combinatorial reasoning, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - 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 interval merging tasks
This question evaluates algorithmic problem-solving and data-structure competency, focusing on binary tree traversal and column-wise ordering (including BFS versus DFS trade-offs) as well as interval merging and sorting strategies for scheduling.
Coding & AlgorithmsTechnical Screen - 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 tree view and parentheses cleanup
This question evaluates binary tree traversal and view-extraction skills for the right-side view problem and string-processing and minimal-edit balancing for the parentheses cleanup, probing competency in data-structure traversal, state tracking, and correctness under edge cases.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve weighted pick and product except self
This question evaluates algorithm design and data-structure skills, focusing on weighted random selection and array aggregation for product computations within the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerSolve windowed duplicates and target expression
This question evaluates proficiency in windowed duplicate detection and time-space trade-offs for streaming or bounded-range scans, along with combinatorial expression generation and on-the-fly numeric evaluation using search, reflecting skills in algorithm design, data-structure selection, and numeric correctness.
Coding & AlgorithmsTechnical Screen - 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 EngineerTraverse binary tree by levels with constraints
This question evaluates binary tree traversal techniques, use of stacks as constrained data structures, predicate-based filtering of nodes, and the ability to argue algorithmic correctness and analyze time and space complexity.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerTraverse levels selecting nodes meeting a predicate
Traverse levels selecting nodes meeting a predicate 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 EngineerValidate Sorted Order Under a Custom Alphabet
This problem tests your ability to define custom comparison logic using a lookup table and verify if a list of strings adheres to a non-standard lexicographical ordering.
Coding & AlgorithmsTechnical ScreenArraysStringsSorting - MetaMediumSoftware EngineerValidate a simplified numeric string
This question evaluates string-parsing, formal-grammar validation, and edge-case reasoning competencies, including the ability to recognize valid numeric formats and to provide time and space complexity analysis.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerValidate parentheses and find k-th largest
This problem tests your ability to handle nested structures using a stack and your efficiency in order-based selection using heap operations.
Coding & AlgorithmsTechnical ScreenStackHeapQuickSelect - 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 - Micro1MediumSoftware EngineerMerge Overlapping Intervals
Tests sorting and linear scanning techniques to consolidate overlapping and adjacent closed intervals into a minimal sorted set.
Coding & AlgorithmsOnline Assessmentarrayssortingintervals - 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 - MicrosoftMediumSoftware EngineerAnswer common graph, grid, and array tasks
This problem tests your ability to model a dependency system as a directed graph and identify if a valid order exists using cycle detection (Kahn's Algorithm or DFS).
Coding & AlgorithmsTechnical ScreenGraphTopological SortDFS - 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