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 811–840 of 1706 results
- 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 - 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 - MetaMediumMachine Learning EngineerCompute sliding-window medians
This question evaluates proficiency in designing and analyzing efficient sliding-window algorithms and data structures for computing running medians, including correct handling of duplicates, deletions, and the convention for defining the median when k is even.
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 - 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 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 - 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 - MetaMediumMachine Learning EngineerDeep copy a linked list with random pointers
This problem tests your ability to manipulate complex pointer structures and maintain object identity across a deep copy operation in a non-linear linked list.
Coding & AlgorithmsTechnical ScreenLinked ListHash TablePointers - 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 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 - MetaMediumData ScientistDesign robust group size limiting for calls
This question evaluates distributed systems design, concurrency control, admission-control algorithms, and scalability under real-time and race-condition constraints.
Coding & AlgorithmsTechnical Screen - 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 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 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 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 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 - 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 - 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 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
Meta