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 781–810 of 1706 results
- LinkedInMediumSoftware EngineerSecond-Smallest Value in a Min Tournament Tree in Logarithmic Time
Given a full binary tournament tree stored in array order, where each internal node holds the smaller of its two children, return the second-smallest leaf value in logarithmic time. It tests reasoning about how a knockout structure constrains where the runner-up can be, array-based tree indexing, and justifying a partial search.
Coding & AlgorithmsTechnical Screen - LinkedInHardSoftware EngineerShortest Word Distance Queries
Tests designing an inverted index and using two-pointer or binary search techniques to efficiently compute the minimum absolute index distance between word occurrences across repeated queries.
Coding & AlgorithmsTechnical Screenhash-tabletwo-pointersbinary-search - LinkedInMediumSoftware EngineerSolve common string and subarray problems
Assesses core string and array manipulation skills by requiring string reversal and contiguous-subarray computations for maximum sum and maximum product, identified under the Coding & Algorithms category.
Coding & AlgorithmsTechnical Screen - LinkedInMediumMachine Learning EngineerSort the values of a quadratic function applied to a sorted array in linear time
Given an integer array sorted in ascending order and the coefficients of a quadratic function, apply the function to every element and return the results in sorted order in linear time. Tests reasoning about the shape of a parabola, handling of positive, negative and zero leading coefficients, and duplicate values.
Coding & AlgorithmsTechnical Screen - LinkedInHardMachine Learning EngineerSum Every Element of an N-Dimensional Array Readable Only by Index Lists
Compute the sum of all elements of an array with any number of dimensions when the array exposes only its dimension sizes and a get method that reads one element from a full list of indices. It tests systematic enumeration of every index combination and exact handling of sums beyond the 32-bit range.
Coding & AlgorithmsTechnical Screen - Listen LabsMediumSoftware EngineerParse a Truncated Streaming JSON Prefix of Strings and Nested Arrays
Write a function that turns a truncated prefix of streamed JSON, made only of strings and nested arrays, into the value received so far. It tests careful parsing of half-received strings, unclosed arrays and input that ends after a comma, along with writing your own edge-case tests.
Coding & AlgorithmsTechnical Screen - Listen LabsMediumSoftware EngineerReconstruct a Warehouse Pick-List From a Dropped Scanner Feed
Write a function that turns a scanner feed cut off mid-transmission into the best pick-list it can represent so far, recovering half-written labels and unfinished bin groupings. Tests careful state-machine parsing of truncated nested data.
Coding & AlgorithmsTechnical Screenparsingstacksstrings - Lowe'sMediumSoftware EngineerExplain Python internals and practices
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Explain Python internals and practices states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Lowe'sMediumSoftware EngineerFind longest unique substring
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Find longest unique substring states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Luma AIHardSoftware EngineerImplement Refactoring Assessment Features
This problem tests your ability to manage stateful data with temporal versioning and reconstruct valid paths in a graph while ensuring data integrity under constraints.
Coding & AlgorithmsTechnical ScreenGraphsData StructuresVersioning - Luma AIMediumMachine Learning EngineerSolve Seven Python Image and Data Tasks
This problem tests foundational proficiency in NumPy array manipulation, mathematical function implementation, and geometric logic, which are essential for low-level image processing tasks.
Coding & AlgorithmsTechnical ScreenNumPyImage ProcessingNumerical Stability - LyftMediumSoftware EngineerSmallest Covering Window in a String
Tests using the two-pointer sliding window pattern combined with frequency counting to find the shortest substring satisfying multiset inclusion constraints in linear time.
Coding & AlgorithmsTechnical Screensliding-windowtwo-pointershash-table - MathWorksMediumSoftware EngineerDetermine Whether P's Position Is Unique
This question evaluates constraint-satisfaction and combinatorial search skills, specifically reasoning about spatial relations and whether a target's location is uniquely determined among all valid assignments on a discrete grid.
Coding & AlgorithmsTechnical Screen - MathWorksEasySoftware EngineerHow to maximize rewards with exactly k tasks
This Coding & Algorithms question evaluates a candidate's ability to perform combinatorial optimization and benefit-based assignment reasoning on arrays, testing algorithm design, complexity-aware implementation, and quantitative decision-making in constrained assignment problems.
Coding & AlgorithmsTechnical Screen - MathWorksEasySoftware EngineerMaximize minimum after K decrements
This Coding & Algorithms question evaluates algorithmic problem-solving skills in array manipulation and constrained optimization, testing competency in reasoning about value distribution, large numeric bounds, and performance under tight complexity limits.
Coding & AlgorithmsTechnical Screen - MathWorksEasySoftware EngineerMinimize shortest path by adding weight-1 edges
This question evaluates proficiency in graph algorithms, shortest-path computation, and algorithmic optimization when augmenting a directed weighted graph with additional unit-weight edges.
Coding & AlgorithmsTechnical Screen - MercorMediumSoftware EngineerShortest Grid Path with Obstacle Eliminations
This question tests your ability to apply Breadth-First Search (BFS) on an augmented state space where path state includes both coordinates and remaining resources.
Coding & AlgorithmsTechnical Screenbfsgraphmatrix - MetaMediumMachine Learning EngineerBuild Friend Recommendations
This problem tests your ability to manipulate graph-like data structures to perform neighbor analysis and efficient set operations to rank potential connections.
Coding & AlgorithmsTechnical ScreenGraphsHash MapsSocial Network Analysis - MetaEasySoftware EngineerCheck Whether a Letters-and-Numbers Abbreviation Matches a Word
Decide whether an abbreviation made of lowercase letters and decimal skip counts matches a given word, where each number skips that many characters and any number with a leading zero is invalid. It tests careful string scanning, multi-digit number parsing and end-of-input boundary checks.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerCheck diagonal and compute window statistics
This question evaluates understanding of array and matrix manipulation, sliding-window and streaming statistics, and appropriate data-structure choices for maintaining aggregates and order-statistics such as moving averages and sliding-window medians.
Coding & AlgorithmsTechnical Screen - MetaMediumMachine Learning EngineerCheck diagonal equality in a matrix
This question evaluates skill in matrix manipulation and algorithmic reasoning, specifically understanding diagonal traversal, equality checks, and handling boundary conditions such as empty matrices, single-row or single-column inputs, and negative values.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerClone list with random pointers
Meta software-engineer technical-screen coding question: deep-copy a singly linked list whose nodes carry an arbitrary random pointer (which may be null, point backward, or form cycles). It tests both the O(n)-space hash-map solution and the O(1)-auxiliary-space in-place weaving technique, plus reasoning about pointer integrity, cycle safety, and verifying the copy is structurally equal to and isolated from the original.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute Exclusive Execution Times
This problem tests your ability to manage state in nested processes using a stack data structure to track the exclusive execution time of functions based on a log of start and end events.
Coding & AlgorithmsTechnical ScreenStackString ParsingSimulation - MetaHardData EngineerCompute Max Score From Up to 3 Categories
This Coding & Algorithms question in the Data Engineer domain evaluates grouping and top‑k aggregation concepts, testing the ability to combine per-category aggregation with selection under a uniqueness constraint.
Coding & AlgorithmsTechnical Screen - MetaEasySoftware EngineerCompute Range Sum Quickly
This question tests the ability to trade preprocessing time for query performance using prefix sum arrays to efficiently calculate the sum of elements within a specified range.
Coding & AlgorithmsTechnical ScreenPrefix SumArraysOptimization - MetaEasySoftware EngineerCompute Sliding Window Averages
This question tests the ability to implement a sliding window algorithm to compute the average of contiguous subarrays, emphasizing optimization of time complexity.
Coding & AlgorithmsTechnical ScreenSliding WindowArraysOptimization - MetaMediumSoftware EngineerCompute binary tree diameter
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 binary tree diameter states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - MetaMediumData ScientistCompute binary-tree diameter via return-only DFS
This question evaluates algorithmic problem-solving with binary trees, focusing on tree traversal techniques, recursion versus iterative implementations, and analysis of time and space complexity including worst-case input shapes such as skewed trees.
Coding & AlgorithmsTechnical Screen - MetaMediumData EngineerCompute capacities after site closures
This question evaluates a candidate's ability to manipulate nested dictionary data structures and perform aggregate capacity computations, assessing data transformation, mapping, and set-based reasoning skills relevant to a Data Engineer within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - MetaMediumSoftware EngineerCompute interval mode, BST range sum, exclusive time
This multipart question evaluates proficiency in interval coverage and frequency analysis, binary search tree range-sum queries with preprocessing for repeated queries, and exclusive-time computation from call logs, covering concepts such as event counting/sweep-line, BST traversal and augmentation, and nested-call time accounting.
Coding & AlgorithmsTechnical Screen
LinkedIn
Luma AI
Lyft
MathWorks
Mercor
Meta