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 601–630 of 1080 results
- MetaMediumMachine Learning EngineerMaximize one stock trade profit
This question evaluates algorithm design skills for single-pass array processing, streaming data handling, and time/space complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMaximize score in 15-sum card game
This problem tests your ability to use memoized recursion or dynamic programming to explore state spaces in a combinatorial game where you must decide which cards to remove to maximize your total score.
Coding & AlgorithmsOnsiteRecursionMemoizationBacktracking - MetaMediumMachine Learning EngineerMaximize unique characters from a word list
This problem tests your ability to use recursion with backtracking or bitmasking to find the optimal subset of strings that maximize the total count of unique characters.
Coding & AlgorithmsOnsiteBacktrackingBitmaskingRecursion - MetaMediumSoftware EngineerMerge Two Lists of Non-Overlapping Intervals
This question evaluates a candidate's ability to merge two pre-sorted, non-overlapping interval lists into a single consolidated set, a core array and two-pointer/merging skill in coding interviews. It tests correct handling of edge cases like touching endpoints versus true gaps, assessing precision in interval logic and algorithmic reasoning under linear-time constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerMerge overlapping intervals
This problem tests your ability to manipulate array-based data by sorting and performing linear sweeps to consolidate overlapping ranges.
Coding & AlgorithmsOnsiteArraysSortingGreedy - MetaMediumSoftware EngineerMinimum Round-Trip Flight Cost
This question evaluates a candidate's ability to optimize over paired sequences using array traversal and running-minimum tracking, a core array-processing technique in coding interviews. It tests practical application of single-pass optimization under an ordering constraint rather than brute-force pairwise comparison, commonly used to assess algorithmic efficiency and edge-case handling.
Coding & AlgorithmsOnsite - MetaMediumData ScientistOptimize Oculus Data Streaming with Bandwidth Constraints
This question evaluates a candidate's ability in algorithm design and problem decomposition for array segmentation and interval coverage, focusing on reasoning about cumulative constraints for streaming data and geometric interval intersections.
Coding & AlgorithmsOnsite - MetaHardMachine Learning EngineerOptimize a Fifteen-Sum Card Strategy
This problem tests your ability to optimize a combinatorial search space through memoization and dynamic programming to determine the maximum win rate of a card-based strategy.
Coding & AlgorithmsOnsiteCombinatoricsProbabilityRecursion - MetaMediumMachine Learning EngineerOptimize ribbon piece length by binary search
This question evaluates understanding of binary-search-on-answer techniques and monotonic predicates, complexity analysis, and implementation-level handling of integer overflow and extreme edge cases in numeric partitioning, situated in the coding and algorithms domain and emphasizing practical implementation considerations rather than purely theoretical proofs. It is commonly asked because it reveals whether an interviewee can reason about monotonicity and design an O(n log max(lengths)) solution that remains robust under very large k, large element values, and potential integer overflow.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerResolve a cd Path Against the Current Directory
Implement simplified Unix-style cd path resolution for absolute and relative inputs containing repeated separators, dot components, and parent-directory steps. The challenge focuses on component semantics, root boundaries, empty arguments, exact normalization, and linear processing of long paths without filesystem lookups.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerReturn a Shortest Path Through a Binary Grid
Implement breadth-first search on an 8-directional binary grid to find and reconstruct a deterministic shortest path from the top-left to the bottom-right cell.
Coding & AlgorithmsOnsiteBFSGraphMatrix - MetaMediumSoftware EngineerReturn all root-to-leaf path sums
This question evaluates competency in binary tree traversal and path-state accumulation, focusing on the ability to compute sums along root-to-leaf paths while handling edge cases like empty trees and negative values.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerReturn right and left side views of a tree
This problem tests your ability to perform level-order traversal on a binary tree and manipulate the results to extract the boundary nodes.
Coding & AlgorithmsOnsiteBinary TreeBFSDFS - MetaHardSoftware EngineerReturn the Minimum-Sum Root-to-Leaf Path
Tests tree traversal, path reconstruction, tie-breaking logic, and handling deeply skewed trees with up to 100,000 nodes without exceeding recursion depth limits.
Coding & AlgorithmsOnsitebinary-treedfsstack - MetaMediumSoftware EngineerSelect words to maximize unique characters
This question evaluates understanding of combinatorial search and string manipulation, specifically the ability to reason about unique-character constraints, subset selection, and set-like representations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Array, Matrix, and Recommendation Problems
This question evaluates algorithmic skills across array manipulation, grid pathfinding, and graph-based recommendation systems, testing competencies in in-place transformations, efficient traversal/search, and candidate ranking under constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Matrix, Tree, Nested, LCA, Maze Tasks
This set of tasks evaluates algorithm design and data structure competencies across matrix traversal, tree path-sum aggregation, nested-list depth weighting, lowest common ancestor discovery using parent pointers, and several rolling-maze reachability and shortest-path variants.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Maze and Suffix Problems
This two-part question evaluates stateful graph traversal and shortest-path reasoning under key-and-door constraints, alongside efficient string-suffix matching and scalable data-structure design, testing competencies in state management, graph/search algorithms, string algorithms, and algorithmic optimization.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Parser, Trading, Tree, And Deck Tasks
This question evaluates input validation and parsing for numeric literals, array-based algorithmic optimization for single-trade profit, tree traversal for extracting rightmost nodes per depth, and software design for a stateful card-deck with shuffle and testing.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve Tree Diameter and Palindromic Counts
This problem tests your ability to perform recursive depth-first searches on binary trees and efficient string manipulation to count palindromic subsequences or paths.
Coding & AlgorithmsOnsiteTreesDFSString - MetaEasyMachine Learning EngineerSolve Tree Views, Columns, and Calculator
This problem tests your ability to perform recursive binary tree traversals to extract horizontal and vertical views, followed by implementing a stack-based parser to handle mathematical expressions with standard order of operations.
Coding & AlgorithmsOnsiteBinary TreesBFSStack - MetaMediumSoftware EngineerSolve a Key-Door Corridor Maze
This problem tests your ability to model a search space beyond simple coordinate traversal by incorporating state-dependent constraints (keys) using Breadth-First Search.
Coding & AlgorithmsOnsiteBFSBitmaskShortest Path - MetaMediumSoftware EngineerSolve binary tree, grid, and heap tasks
Solve binary tree, grid, and heap tasks 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 EngineerSolve classic LeetCode problems
This question evaluates proficiency with core data structures and algorithmic techniques including array selection and ordering, string pattern grouping, interval/rectangle merging, and binary search tree range queries.
Coding & AlgorithmsOnsite - MetaMediumBackend EngineerSolve coding and AI-assisted tasks
This problem tests your ability to manipulate tree structures with parent pointers and verify path validity under specific movement constraints.
Coding & AlgorithmsOnsiteTreesData StructuresAlgorithms - MetaMediumSoftware EngineerSolve four algorithmic problems
This multi-part question evaluates algorithmic problem-solving and data-structure proficiency across string processing (validating parentheses with minimal deletions), tree operations (lowest common ancestor using parent pointers), nested-structure traversal and accumulation (depth-weighted sum), and geometric selection/ordering (k closest points).
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve four data structure and algorithms tasks
This set of tasks evaluates core algorithmic competencies such as tree traversal and level-order processing, data-structure design and counting maps, recursive subtree aggregation for statistical checks, and optimization/search techniques for partitioning problems, all within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve grid path and robot navigation
This question evaluates proficiency in graph traversal and pathfinding, state representation for unknown environments, exploration and backtracking, and rigorous reasoning about correctness and time/space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve grid shortest path and robot cleaning
This question evaluates a candidate's ability to implement grid-based graph traversal and stateful simulation, assessing skills in shortest-path search and systematic exploration for cleaning tasks.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve island and frequency problems
These problems evaluate graph traversal and connected-component identification in 2D grids plus frequency analysis and selection in arrays, covering concepts such as DFS/BFS, Union-Find, hashing, heaps and bucket sort.
Coding & AlgorithmsOnsite
Meta