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 1351–1380 of 2629 results
- MetaMediumSoftware EngineerCompute max profit from single stock trade
This question evaluates a candidate's ability to design efficient array algorithms, reason about time and space complexity constraints, and handle edge cases related to single-transaction profit calculation.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute nested depth-weighted sum
This question evaluates understanding of tree-like nested data structures, traversal strategies (recursive DFS and iterative approaches), handling of edge cases such as empty lists and negative integers, and algorithmic reasoning about time and space complexity within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute sparse dot product and count islands
This question evaluates competency in designing efficient algorithms for sparse data representations and for identifying connected components in grids, testing skills in handling large inputs, memory-efficient representations, and traversal/graph concepts.
Coding & AlgorithmsTechnical Screen - MetaHardSoftware EngineerCompute the Dot Product of Sparse Vectors
Compute the dot product of two sparse vectors stored as sorted index-value pairs without expanding them. A two-pointer traversal should visit only nonzero entries, multiply matching indices, and accumulate safely in a wide integer type.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCompute unmatched parentheses length
This problem tests your ability to use stack-based logic to track balanced sequences and identify the length of characters that remain unmatched after processing all valid pairs.
Coding & AlgorithmsOnsiteStringStackGreedy - MetaMediumSoftware EngineerCompute vertical order of a BST
This question evaluates understanding of binary tree traversals and coordinate-based ordering, including tie-breaking by breadth-first visitation order, plus competency in algorithmic time and space complexity analysis and strategies for handling deep recursion and streaming large inputs.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute weighted sum of nested lists
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 weighted sum of nested lists states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerConvert BST to sorted doubly list
This question evaluates understanding of binary search tree properties, in-order traversal, in-place pointer manipulation, and algorithmic complexity when converting tree nodes into a sorted doubly linked list.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCount Distinct Values in a Sorted Array When K Is Small
Count distinct values in a sorted array efficiently when the number of unique values is much smaller than the array length. The challenge tests adapting complexity to output diversity rather than raw length, meeting an O(k log n) target with constant auxiliary space, and handling empty or uniform arrays.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerCount Subarrays with a Target Sum
Tests the ability to use prefix sums and hash tables to count contiguous subarrays summing to a target in linear time, handling negative values and zeros.
Coding & AlgorithmsOnsitearraysprefix-sumhash-table - MetaMediumSoftware EngineerCount palindrome substrings in a string
This question evaluates proficiency in string algorithms, algorithmic design, and complexity analysis by targeting palindromic substring counting, string manipulation, and conceptual linear-time techniques.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCount subarrays equal to target
This problem tests your ability to use a hash map to track prefix sums, allowing for an efficient solution to a subarray counting problem.
Coding & AlgorithmsTechnical ScreenArrayHash MapPrefix Sum - MetaMediumSoftware EngineerCount subarrays summing to target
This question evaluates understanding of prefix-sum concepts, use of linear-time data structures, and competence in handling negative numbers and edge cases such as zero targets and empty prefixes.
Coding & AlgorithmsTechnical Screen - MetaHardSoftware EngineerCount three-digit numbers with distinct digits
This problem tests your ability to count numbers satisfying digit-based constraints within a specific range using combinatorial logic or efficient iteration.
Coding & AlgorithmsOnsiteMathCombinatoricsImplementation - MetaMediumSoftware EngineerDecide palindrome within k deletions
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Decide palindrome within k deletions states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerDesign LCA and find K closest points
This question evaluates understanding of tree algorithms (LCA using parent pointers) and selection algorithms (sorting, max-heap, quickselect), emphasizing data structures, algorithmic correctness, and time/space complexity within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerDesign a bank system with scheduled transfers
This question evaluates object-oriented design and stateful system skills, including time-ordered event processing, scheduling and cancellation semantics, balance accounting, and top-k aggregation using appropriate data structures.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign an in-memory cloud file system
This question evaluates understanding of object-oriented design, stateful data structures, and resource management including user quotas, ownership semantics, and file metadata operations.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign an in-memory database with TTL and history
This question evaluates understanding of time-versioned in-memory key–field–value stores, covering TTL-based expiration, historical reads, atomic compare-and-set/delete semantics, efficient scan/scan-by-prefix operations, and time/space complexity analysis, and it belongs to the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerDesign prefix-sum function and max stack
This question evaluates understanding of prefix-sum precomputation for constant-time range queries and the design of a max-enabled stack, focusing on data structure design, algorithmic complexity, and space-time trade-offs.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerDesign structure for top-K frequent elements
This question evaluates a candidate's competency in algorithm and data-structure design, frequency counting and streaming/approximation techniques, and the ability to reason about time/space complexity and workload-driven trade-offs.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerDetect a Contiguous Subarray with a Target Sum
Determine whether an integer array containing negative values has any nonempty contiguous subarray that equals a target, using prefix sums for a linear-time solution.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerDetermine feasibility and clean parentheses string
This problem tests your ability to manipulate string structures using stack-based logic and perform graph-based dependency resolution using topological sort.
Coding & AlgorithmsTechnical ScreenStringsStackGraphs - MetaMediumSoftware EngineerDetermine if subarray sums to target
This question evaluates a candidate's ability to reason about contiguous subarray sums, efficient array manipulation, and handling large numeric ranges within algorithmic constraints, and it falls under the Coding & Algorithms domain as a practical algorithmic implementation problem.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerEvaluate arithmetic expression without parentheses
Evaluate arithmetic expression without parentheses 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 EngineerEvaluate expression without stack, constant space
Evaluate expression without stack, constant space 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 EngineerExtend BFS maze solver with keys and arrows
This problem tests your ability to adapt Breadth-First Search (BFS) to a state-space where the current location is augmented by a collection of keys, effectively transforming the grid into a larger, multi-layered graph.
Coding & AlgorithmsOnsiteBFSGraphsBitmask - MetaMediumSoftware EngineerExtend a Maze Solver
This question evaluates algorithmic problem-solving and software engineering skills, specifically graph traversal (BFS), state-space modeling for keys and doors, handling movement constraints, and debugging an existing codebase within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerExtend cloud file system with copy and compression
This question evaluates understanding of data structures and algorithms for stateful resource management, covering bookkeeping of per-user quotas, file metadata operations (copy, compress/decompress), string filtering and sorting, and efficient selection and deletion of largest elements.
Coding & AlgorithmsOnline Assessment - MetaMediumSoftware EngineerFill rooms with nearest gate distances
This question evaluates grid-based graph traversal and algorithmic problem-solving skills, including concepts such as multi-source breadth-first search, handling sentinel values, and performing in-place updates.
Coding & AlgorithmsTechnical Screen
Meta