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 571–600 of 1080 results
- 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 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 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 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 - 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 - 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 - 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 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 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 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 - MetaMediumMachine Learning EngineerFind target using robot movement API
This question evaluates a candidate's ability to design exploration and state-space search strategies for a robot operating in an unknown, partially blocked 2D grid using a constrained movement and sensing API, testing competency in traversal algorithms, state management, and handling limited observability.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind the Unique Pair of Array Indices Whose Values Sum to a Target
Given an integer array and a target, return the indices of the only pair of different elements whose values add up to the target, smaller index first. Arrays hold up to 10,000 values of up to one billion in magnitude, and the task is a common warm-up that tests clean, efficient array reasoning.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerFind top-K frequent elements in a stream
This question evaluates understanding of streaming algorithms, frequency estimation, and data-structure-based top-K selection, emphasizing space/time and accuracy trade-offs when processing large or unbounded data.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerGenerate unique permutations with duplicates
This question evaluates a candidate's understanding of permutation generation and duplicate handling within algorithm design, testing combinatorial reasoning, correctness proofs, and time/space complexity analysis.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerGroup Binary Tree Nodes by Vertical Column, Top to Bottom and Left to Right
Return a binary tree's node values grouped by vertical column from left to right, ordering each column top to bottom and breaking ties within a row by left-to-right position. The tree arrives as a level-order list, and the task tests coordinate tracking during traversal and precise tie handling.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerImplement BST Iterator and Ticket Queue
This problem tests your ability to implement an iterator for a Binary Search Tree (BST) using controlled traversal, and your skill in designing a priority-based queue that handles multi-criteria ordering.
Coding & AlgorithmsOnsiteTreesHeapsIterator - MetaMediumMachine Learning EngineerImplement LRU cache and copy random list
This problem tests your ability to handle complex pointer manipulation through linked-list deep copying and your proficiency in designing a thread-safe-capable cache using hash maps and doubly-linked lists.
Coding & AlgorithmsOnsiteLinked ListsHash MapsLRU Cache - MetaMediumSoftware EngineerImplement basic expression evaluator
This question evaluates proficiency in expression parsing, operator precedence handling, integer arithmetic semantics (including truncating division), and efficient tokenization and evaluation within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerImplement sparse vector dot product
Meta's sparse vector dot product question asks you to design a SparseVector class that stores only non-zero entries and computes dot products in time proportional to the number of non-zeros rather than the full vector length. It tests sparse data representation, two-pointer vs. hash-map trade-offs, and time/space complexity analysis.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerImplement weighted random index picker
Implement weighted random index picker 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 - MetaMediumMachine Learning EngineerImplement weighted random sampling with preprocessing
This problem tests your ability to optimize weighted random selection using binary search on prefix sums, balancing preprocessing time against query latency.
Coding & AlgorithmsOnsiteProbabilityBinary SearchPrefix Sum - MetaMediumSoftware EngineerInfer an Unknown Alphabet Order
This question evaluates a candidate's competency in graph-based reasoning, inference of ordering constraints from sequences of strings, and algorithmic manipulation of characters and relations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerLongest Balanced Substring in a String of Parentheses
A Meta coding interview problem: given a string made only of opening and closing parentheses, return the length of the longest contiguous substring that is correctly balanced. It tests careful handling of matched pairs, unmatched characters that break a run, and efficient processing of long inputs.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMaximize Unique Characters from Words
This question evaluates a candidate's ability to reason about combinatorial constraints and set disjointness while maximizing unique coverage, testing competencies in algorithm design, combinatorics, and constraint-based optimization.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMaximize number with one digit swap
Maximize number with one digit swap 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
Meta