practice a little every day, paws crossed ♡
Coding & Algorithms 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 1651–1680 of 3276 results
- 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 - MetaMediumSoftware EngineerFind All Binary Tree Nodes Exactly K Edges from a Target Node
A binary tree coding problem: given a tree with distinct values, a target node and a distance k, return every node exactly k edges away, including nodes reached by moving up through ancestors. It tests traversal in both directions of a tree, level-order input parsing and careful handling of visited nodes.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind Any Local Minimum with Iterative Binary Search
Find the index of any strict local minimum in a nonempty array whose adjacent values differ, using an iterative logarithmic-time algorithm. The task tests search invariants, boundary-as-infinity semantics, singleton and monotone arrays, and correctness when several indices are valid.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind K-th Largest and Longest Vacation
This pair of problems evaluates array manipulation and algorithmic problem-solving skills, specifically order-statistics for selecting the k-th largest element and maximizing consecutive sequences under constrained transformations for the vacation streak problem.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind Kth Largest and Tree Ancestors
This question evaluates algorithmic problem-solving and data-structure competencies, focusing on selection algorithms and time/space complexity reasoning for the k-th largest element and tree traversal, lowest common ancestor discovery with attention to BST properties, parent pointers, and external-memory constraints.
Coding & AlgorithmsTechnical Screen - MetaHardMachine Learning EngineerFind Maximum Unique-Character Subset
This problem tests your ability to use bitmasking and backtracking with pruning to solve a variation of the maximum set packing problem under character constraints.
Coding & AlgorithmsOnsiteBitmaskingBacktrackingRecursion - MetaMediumSoftware EngineerFind Shortest Unique Prefixes
This problem tests your ability to efficiently manage and query prefix-based string sets using a Trie (prefix tree) data structure.
Coding & AlgorithmsTechnical ScreenTrieStringsData Structures - MetaHardMachine Learning EngineerFind Words Containing Other Words
This problem tests your ability to efficiently identify all words in a list that contain at least one other word from the same list as a substring, utilizing optimized string processing or data structures like Tries.
Coding & AlgorithmsOnsiteStringsTrieOptimization - MetaMediumSoftware EngineerFind a Local Minimum with Left-Biased Binary Search
This problem tests the ability to adapt binary search to identify a local minimum in an unsorted array, focusing on handling boundary conditions and non-strict inequality logic.
Coding & AlgorithmsOnsiteBinary SearchArraysDivide and Conquer - MetaMediumMachine Learning EngineerFind a String Containing Another
This question evaluates proficiency in string algorithms, substring search techniques, and algorithmic complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind balanced subarray and increasing tree path
This question evaluates array and tree algorithm skills, testing competency in identifying longest balanced subarrays in binary sequences and locating maximal strictly increasing downward paths in binary trees.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind integer in most intervals
This question evaluates a candidate's ability to reason about interval overlap counting, manage range endpoints efficiently, and balance time-space trade-offs when identifying points that maximize coverage.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind k most frequent elements, discuss O(n)
Find k most frequent elements, discuss O(n) 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 EngineerFind kth largest element in array
A classic Meta software engineer onsite coding question: return the k-th largest element from an unsorted integer array, handling duplicates correctly. It tests order statistics and selection algorithms — sort, size-k min-heap (O(n log k)), and quickselect (O(n) average) — and the candidate's ability to beat a full sort.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerFind kth smallest in sorted matrix
This question evaluates algorithmic problem-solving and data-structure knowledge, focusing on selection in a row-and-column-sorted matrix and the comparative use of min-heaps versus value-space binary search along with time/space complexity and edge-case analysis.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerFind longest palindromic substring
This problem tests your ability to optimize string processing algorithms, specifically moving from a brute-force approach to an efficient expansion-based technique for identifying palindromic patterns.
Coding & AlgorithmsOnsiteStringsDynamic ProgrammingTwo Pointers - MetaMediumSoftware EngineerFind minimum and most frequent number efficiently
Find minimum and most frequent number efficiently 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 EngineerFind missing ranges in interval
This question evaluates a candidate's proficiency in array traversal, interval reasoning, handling edge cases including empty inputs and 32-bit integer boundary conditions, and enforcing time and space complexity constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind mode or minimum with time-space tradeoffs
This question evaluates algorithm design and analysis skills—particularly time–space tradeoffs, frequency counting techniques (sorting, hashing, and counting arrays), and handling streaming or memory-constrained inputs in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind power-of-two subarrays within sum range
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find power-of-two subarrays within sum range states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerFind shortest subarray with range ≥ k
This question evaluates proficiency with array algorithms and range-query reasoning, testing understanding of max/min behavior over contiguous subarrays and use of appropriate data-structure techniques; it belongs to the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind shortest substring with N unique characters
This question evaluates proficiency in string processing, handling character-uniqueness constraints, and algorithmic thinking about time and space efficiency.
Coding & AlgorithmsOnsite
Meta