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 871–900 of 1706 results
- MetaMediumSoftware EngineerRemove runs of length at least k
This question evaluates string manipulation, run-length detection, and algorithmic efficiency, focusing on tracking and removing maximal contiguous character groups. It is commonly asked in the Coding & Algorithms domain to assess practical application–level skills in designing linear-time, linear-space implementations that handle dynamic sequence collapses using appropriate data structures.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerReverse between equal-value nodes in list
This question evaluates a candidate's ability to manipulate singly linked lists, perform in-place sublist reversal, and manage pointer references and node boundaries.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerReverse sublist between equal-value nodes
This question evaluates linked-list manipulation and pointer-management skills, focusing on reversing an in-place sublist between two nodes with equal values while respecting O(n) time and O(1) extra space constraints.
Coding & AlgorithmsTechnical Screen - MetaHardMachine Learning EngineerSimulate Monster Team Battles
This question tests the ability to implement a stateful, turn-based simulation engine using object-oriented principles, efficient queue management, and rule-based damage calculations.
Coding & AlgorithmsTechnical ScreenSimulationObject-Oriented DesignSorting - MetaMediumSoftware EngineerSolve Four Online Assessment Problems
This multi-part question evaluates algorithmic problem-solving across array manipulation, exact fraction comparison, scheduling and simulation with ordered event lists, matrix transformation operations, and string concatenation/counting, exercising skills in data structures, searching, and combinatorial counting.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve PTO window and sparse unique counting
Solve PTO window and sparse unique counting 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 - MetaMediumData EngineerSolve SQL and Python coding tasks
This question evaluates SQL proficiency in relational querying (joins, filtering, aggregation) and Python algorithmic problem-solving for non-adjacent selection, measuring a data engineer's ability to manipulate relational data and implement efficient algorithms.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve Three Coding Interview Problems
This set of tasks evaluates proficiency in data structures and algorithms, covering tree traversal and lowest common ancestor reasoning, interval merging and overlap resolution, and combinatorial subset selection under uniqueness constraints.
Coding & AlgorithmsTechnical Screen - MetaEasySoftware EngineerSolve Tree View and Triplet Sum
This multipart question evaluates proficiency with tree-based data structures and array-based algorithmic problem solving, focusing on reasoning about which nodes are visible from a binary tree's right side and identifying unique zero-sum triplets in an integer array; it tests concepts such as tree traversal, duplicate handling, and algorithmic complexity analysis. These problems are commonly asked to assess algorithmic problem-solving ability, manipulation of fundamental data structures, and attention to edge cases and performance, and they fall under the Coding & Algorithms category with a focus on practical application of algorithmic concepts supported by conceptual understanding of data structures and complexity.
Coding & AlgorithmsTechnical Screen - MetaHardSoftware EngineerSolve Two Backtracking Array Problems
This prompt evaluates algorithmic problem-solving skills focused on combinatorial search and backtracking, including handling duplicate values, index distinctness, and enforcing character-uniqueness constraints across concatenated subsets.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerSolve UTF-8 Validation & Shortest Path
This pair of problems evaluates skills in data encoding interpretation and graph traversal, examining competency in validating byte-oriented input formats and computing shortest paths on binary matrices.
Coding & AlgorithmsTechnical Screen - 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 - 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 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 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 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 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 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 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 view and parentheses cleanup
This question evaluates binary tree traversal and view-extraction skills for the right-side view problem and string-processing and minimal-edit balancing for the parentheses cleanup, probing competency in data-structure traversal, state tracking, and correctness under edge cases.
Coding & AlgorithmsTechnical Screen - MetaEasyMachine Learning EngineerSolve two linked list/array tasks
This problem tests your ability to manipulate linked list pointers to detect cycles and solve a classic array-based problem using the two-pointer technique to find specific target sums.
Coding & AlgorithmsTechnical ScreenLinked ListTwo PointersArrays - MetaMediumSoftware EngineerSolve windowed duplicates and target expression
This question evaluates proficiency in windowed duplicate detection and time-space trade-offs for streaming or bounded-range scans, along with combinatorial expression generation and on-the-fly numeric evaluation using search, reflecting skills in algorithm design, data-structure selection, and numeric correctness.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerTraverse binary tree by levels with constraints
This question evaluates binary tree traversal techniques, use of stacks as constrained data structures, predicate-based filtering of nodes, and the ability to argue algorithmic correctness and analyze time and space complexity.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerTraverse levels selecting nodes meeting a predicate
Traverse levels selecting nodes meeting a predicate 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 EngineerValidate Sorted Order Under a Custom Alphabet
This problem tests your ability to define custom comparison logic using a lookup table and verify if a list of strings adheres to a non-standard lexicographical ordering.
Coding & AlgorithmsTechnical ScreenArraysStringsSorting - MetaMediumSoftware EngineerValidate a simplified numeric string
This question evaluates string-parsing, formal-grammar validation, and edge-case reasoning competencies, including the ability to recognize valid numeric formats and to provide time and space complexity analysis.
Coding & AlgorithmsTechnical Screen
Meta