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 1321–1350 of 2629 results
- MathWorksMediumSoftware EngineerImplement BFS shortest paths with reconstruction
This question evaluates understanding of graph traversal via breadth-first search, computation of shortest paths in unweighted graphs, and path reconstruction using parent arrays, assessing algorithmic reasoning and implementation skills in the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMaximize disjoint k-sum pairs
This question evaluates proficiency in array algorithms, pairing logic, data structure selection, and complexity analysis, focusing on maximizing disjoint k-sum pairs and reasoning about space–time trade-offs.
Coding & AlgorithmsOnline Assessment - MathWorksEasySoftware EngineerMaximize minimum after K decrements
This Coding & Algorithms question evaluates algorithmic problem-solving skills in array manipulation and constrained optimization, testing competency in reasoning about value distribution, large numeric bounds, and performance under tight complexity limits.
Coding & AlgorithmsTechnical Screen - MathWorksMediumSoftware EngineerMaximize operations by removing target-sum pairs
This question evaluates a candidate's ability to design and analyze efficient array algorithms and use appropriate data structures and techniques such as hash maps or sorting with two-pointer strategies, with attention to time and space complexity.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMinimize reduction cost and validate equal-sum pairs
This problem tests your ability to use greedy strategies with priority queues to minimize reduction costs and use hash-based frequency mapping to identify valid pairs that satisfy specific sum conditions.
Coding & AlgorithmsOnsiteGreedyMin-HeapHash Map - MathWorksEasySoftware EngineerMinimize shortest path by adding weight-1 edges
This question evaluates proficiency in graph algorithms, shortest-path computation, and algorithmic optimization when augmenting a directed weighted graph with additional unit-weight edges.
Coding & AlgorithmsTechnical Screen - MavenclinicMediumSoftware EngineerSolve two interview coding problems
This problem tests your ability to handle currency conversion using graph pathfinding (multiplicative weights) and implement a custom pagination algorithm that balances item distribution while respecting original ordering.
Coding & AlgorithmsOnsiteGraphsShortest PathGreedy - MercorMediumSoftware EngineerCurrency Exchange Rate Between Two Currencies via Chained Conversions
Given a list of pairwise currency exchange rates such as USD to GBP at 0.77, compute the rate from a source currency to a target currency, converting through intermediate currencies and using rates in reverse where needed. It tests reasoning about chained conversions, unknown or unreachable currencies, and a clear time and space complexity analysis.
Coding & AlgorithmsOnsite - MercorMediumSoftware EngineerShortest Grid Path with Obstacle Eliminations
This question tests your ability to apply Breadth-First Search (BFS) on an augmented state space where path state includes both coordinates and remaining resources.
Coding & AlgorithmsTechnical Screenbfsgraphmatrix - MetaMediumSoftware EngineerAdd Two Arbitrarily Long Non-Negative Integers Given as Decimal Strings
Add two non-negative integers that are given as decimal digit strings, possibly thousands of digits long, and return the sum as a string without converting to built-in numbers. Tests digit-by-digit addition with carries, inputs of unequal length and canonical output without leading zeros.
Coding & AlgorithmsOther - MetaHardSoftware EngineerAnswer Repeated Range Aggregate Queries on a Static BST
Preprocess a sorted array derived from a static BST to answer many inclusive range queries. Use binary-search boundaries and wide prefix sums to return both the sum and count for each range without rescanning the tree.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerAnswer four string/array/battery coding questions
This set of four problems evaluates algorithmic competencies including ASCII string processing and character classification, array transformation and operation-count reasoning, cost-minimization for enforcing monotonicity under only-increase constraints, and time-based simulation of resource scheduling with recharge cycles.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerBuild a FastAPI summarization service
This question evaluates web API development and backend engineering competencies, including FastAPI usage, Python type hints, Pydantic-based request/response validation, error handling, in-memory state management, and modular router/service/model layering, and it belongs to the Coding & Algorithms category with a focus on backend web service and API design. It is commonly asked to assess practical ability to deliver production-ready REST endpoints with proper validation and error handling under constrained resources, and the level of abstraction required is primarily practical implementation with attention to architectural design.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCanonicalize an Absolute Unix-Style Path With Dot and Double-Dot Segments
Convert an absolute Unix-style file path into its canonical form by collapsing repeated slashes, dropping single-dot segments, resolving double-dot segments against the parent directory, and treating other dot sequences as ordinary names. It tests careful string parsing and edge cases such as the root directory.
Coding & AlgorithmsOnsite - MetaHardSoftware EngineerCheck Whether Deleting at Most K Characters Can Form a Palindrome
Determine whether a string can be transformed into a palindrome by removing at most k characters. Tests dynamic programming, palindrome properties, and recursive search with branch bounding.
Coding & AlgorithmsOnsiteDynamic ProgrammingTwo PointersString - MetaEasySoftware EngineerCheck Whether a Letters-and-Numbers Abbreviation Matches a Word
Decide whether an abbreviation made of lowercase letters and decimal skip counts matches a given word, where each number skips that many characters and any number with a leading zero is invalid. It tests careful string scanning, multi-digit number parsing and end-of-input boundary checks.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerChoose the Cheapest Round Trip
This problem tests the ability to optimize a two-step decision process by maintaining track of the best previous state, requiring a linear scan approach.
Coding & AlgorithmsOnsiteArraysGreedyOptimization - MetaHardSoftware EngineerChoose the Longest Set of Words with No Repeated Characters
Tests bitmask representation, backtracking with pruning, and combinatorial optimization under character-uniqueness constraints.
Coding & AlgorithmsOnsitebitmaskbacktrackingdepth-first-search - MetaMediumSoftware EngineerClone list with random pointers
Meta software-engineer technical-screen coding question: deep-copy a singly linked list whose nodes carry an arbitrary random pointer (which may be null, point backward, or form cycles). It tests both the O(n)-space hash-map solution and the O(1)-auxiliary-space in-place weaving technique, plus reasoning about pointer integrity, cycle safety, and verifying the copy is structurally equal to and isolated from the original.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCombine Many Sorted Integer Arrays into One Non-Decreasing Array
A coding question asking you to merge many integer arrays, each already sorted in non-decreasing order, into a single sorted array that keeps every duplicate value. It tests multi-way merging, efficiency as the number of input arrays grows, and edge cases such as empty inputs and arrays of different lengths.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCompute BST range sum
This question evaluates understanding of binary search tree properties, traversal techniques, and the ability to implement both recursive and iterative algorithms while reasoning about time and space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCompute Exclusive Execution Times
This problem tests your ability to manage state in nested processes using a stack data structure to track the exclusive execution time of functions based on a log of start and end events.
Coding & AlgorithmsTechnical ScreenStackString ParsingSimulation - MetaEasySoftware EngineerCompute Range Sum Quickly
This question tests the ability to trade preprocessing time for query performance using prefix sum arrays to efficiently calculate the sum of elements within a specified range.
Coding & AlgorithmsTechnical ScreenPrefix SumArraysOptimization - MetaEasySoftware EngineerCompute Sliding Window Averages
This question tests the ability to implement a sliding window algorithm to compute the average of contiguous subarrays, emphasizing optimization of time complexity.
Coding & AlgorithmsTechnical ScreenSliding WindowArraysOptimization - MetaMediumSoftware EngineerCompute Stock Profit with One or Unlimited Transactions
Compute maximum stock profit for both one transaction and unlimited nonoverlapping transactions in linear time, returning zero when no positive trade is available.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCompute binary tree diameter
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute binary tree diameter states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute interval mode, BST range sum, exclusive time
This multipart question evaluates proficiency in interval coverage and frequency analysis, binary search tree range-sum queries with preprocessing for repeated queries, and exclusive-time computation from call logs, covering concepts such as event counting/sweep-line, BST traversal and augmentation, and nested-call time accounting.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute left and right views once
This question evaluates understanding of binary tree traversal, depth tracking, and view computation for left and right perspectives, plus the ability to implement a concurrent single-pass traversal while handling edge cases such as empty trees and duplicate keys.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute longest increasing path in a matrix
Compute longest increasing path in a matrix 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 EngineerCompute longest rising path in a grid
This question evaluates mastery of graph traversal, dynamic programming, and complexity analysis for computing longest increasing paths in a matrix, focusing on algorithmic correctness and efficient use of time and space.
Coding & AlgorithmsTechnical Screen
MathWorks
Mercor
Meta