practice a little every day, paws crossed ♡
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 5341–5370 of 9403 results
- MetaMediumSoftware EngineerSolve array merge and tree flattening problems
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve array merge and tree flattening problems states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsHR Screen - MetaMediumSoftware EngineerSolve array, tree, and maze problems
This problem tests your ability to combine binary tree traversal with spatial grouping and grid-based pathfinding to determine if nodes with specific values are reachable from a starting point in a maze.
Coding & AlgorithmsOnline AssessmentTreesGraphsBFS - 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 counting and frequency coding tasks
This problem tests your ability to handle frequency counting and constraint-based pair identification efficiently, often requiring a hash map to maintain counts while traversing a stream.
Coding & AlgorithmsTechnical ScreenHash TableArraysCounting - MetaMediumSoftware EngineerSolve diverse LeetCode algorithm problems
This collection evaluates proficiency with fundamental data structures and algorithmic techniques — including matrix and graph traversal, hash-based sets for O(1) operations, linked list manipulation, sliding-window strategies, recursive processing of nested structures, and stack/string handling — along with complexity analysis and reliable implementation. Commonly asked in the Coding & Algorithms domain, these problems assess pattern recognition, algorithmic reasoning, and practical implementation skills under time and space constraints, emphasizing applied problem-solving over purely theoretical concepts.
Coding & AlgorithmsTechnical Screen - MetaEasySoftware EngineerSolve four OA coding problems
This set of coding tasks evaluates fundamental skills in array manipulation, graph traversal, greedy strategy, and sequence analysis.
Coding & AlgorithmsHR ScreenArraysGreedyGraphs - MetaEasyMachine Learning EngineerSolve four OA string/array/matrix/graph tasks
This problem tests foundational proficiency in four distinct domains: string processing, array simulation, matrix transformation, and graph traversal.
Coding & AlgorithmsOnline AssessmentStringsSimulationBFS - 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 path and top‑k frequency
This question evaluates algorithmic problem-solving in grid reachability and frequency analysis, testing concepts such as grid/graph traversal and obstacle handling for path existence alongside frequency counting and selection for top-k elements.
Coding & AlgorithmsTechnical Screen - 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 increasing sequence and path problems
Solve increasing sequence and path problems 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 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 - MetaMediumSoftware EngineerSolve island connectivity and string multiplication
This question evaluates graph connectivity reasoning (computing minimum edges to unify components) and string-based big-integer arithmetic (multiplying numbers represented as strings), testing competency in graph theory, component analysis, and numeric string manipulation.
Coding & AlgorithmsTechnical Screen - MetaMediumData EngineerSolve library coding tasks in Python
Solve library coding tasks in Python 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 - MetaMediumMachine Learning EngineerSolve linked list, tree, and grid problems
This set evaluates mastery of core data structures and algorithmic reasoning across singly linked lists (cycle entry detection), binary search trees with parent pointers (in-order successor), constant-time state tracking for n×n game boards, and grid connectivity for maximizing component size, emphasizing pointer manipulation, traversal logic, state-design, and component analysis. Commonly asked to gauge proficiency in Coding & Algorithms and complexity analysis, these problems test both conceptual understanding of traversal and connectivity principles and practical application of space- and time-efficient implementations under typical interview constraints.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve linked-list and top-K algorithm tasks
This question evaluates competency in fundamental data structures and algorithmic techniques, including linked list manipulation, frequency counting and top‑K retrieval, closest-point geometric queries, and stack-based string processing for repeated deletions.
Coding & AlgorithmsOnsite - MetaMediumMachine Learning EngineerSolve matrix components, median, and traversals
This question evaluates algorithmic problem-solving across grid and graph algorithms, selection algorithms, and traversal techniques—specifically connected-component detection in binary matrices, median-finding across two sorted arrays, and BFS/DFS traversal variants—measuring competence in data structures, complexity analysis, and handling edge cases. Commonly asked in Coding & Algorithms interviews for Machine Learning Engineer roles, it assesses efficiency and correctness concerns such as time and space complexity and traversal orders, testing both conceptual understanding of algorithmic principles and practical implementation distinctions like iterative versus recursive variants.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerSolve matrix diagonal and sliding-window statistics
Solve matrix diagonal and sliding-window statistics 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 - MetaEasySoftware EngineerSolve palindrome-check and vertical-order traversal
This prompt evaluates string-processing and tree-traversal competencies by asking whether a string can become a palindrome after at most one deletion and by requiring a vertical-order traversal of a binary tree, testing understanding of palindrome properties, node ordering, and handling of edge cases in the coding and algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve peak element and unique word abbreviation
This question evaluates algorithmic design and data-structure skills by combining a binary-search peak-finding problem with a string-abbreviation uniqueness problem, testing competence in time-complexity reasoning and creation of minimal unique representations.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve permutation successor and evaluate expressions
This question evaluates understanding of lexicographic permutation generation with in-place array manipulation and linear-time arithmetic expression parsing and evaluation, focusing on algorithmic efficiency, constant extra space constraints, and correct operator semantics.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve three LeetCode coding problems
The trio of problems — Minimum Remove to Make Valid Parentheses, Making a Large Island, and Binary Tree Right Side View — evaluates algorithmic problem-solving, proficiency with core data structures (strings, grids/graphs, and trees), and awareness of time and space complexity.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree diameter and grid path problems
This question evaluates understanding of graph algorithms and pathfinding, covering tree diameter computation and grid shortest-path problems as well as enumeration of simple paths, and requires skills in traversal techniques, combinatorial reasoning, and time/space complexity analysis.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve tree leaf sum and target indices search
This question evaluates proficiency in tree traversal and array search algorithms, specifically handling recursive depth-first traversal with path-based numeric accumulation and performing logarithmic-time search over sorted data.
Coding & AlgorithmsOnsite - MetaMediumSoftware EngineerSolve tree traversal and interval merging tasks
This question evaluates algorithmic problem-solving and data-structure competency, focusing on binary tree traversal and column-wise ordering (including BFS versus DFS trade-offs) as well as interval merging and sorting strategies for scheduling.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve tree traversal and two-pointer problems
Solve tree traversal and two-pointer problems 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