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 1561–1590 of 3276 results
- 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 EngineerAssign Minimum Workers to Jobs
This problem tests your ability to manage overlapping intervals and greedy resource allocation using minute-based time arithmetic.
Coding & AlgorithmsOnline AssessmentSweep-lineIntervalsGreedy - LyftMediumSoftware EngineerAssign Tasks to the Minimum Number of Workers
Assign interval tasks to the minimum number of workers while preserving deterministic worker IDs and original output order. Reason about overlapping times, tie handling, resource reuse, efficient scheduling at scale, and boundary cases where one task ends as another begins.
Coding & AlgorithmsOnsite - LyftMediumSoftware EngineerDesign a temporal key-value store with historical reads
This question evaluates a candidate's grasp of data structures and algorithms needed to implement a temporal key-value store supporting timestamped set/get operations and efficient historical reads, including performance targets like O(log n) per operation.
Coding & AlgorithmsOnsite - LyftHardSoftware EngineerImplement Grid Spread and Transactional Store
This question evaluates skills in grid-based propagation modeling and stateful transactional system design, testing concepts such as graph traversal and timed spread dynamics for the grid task and nested transaction semantics, isolation, and state management for the in-memory key-value store.
Coding & AlgorithmsOnsite - LyftEasySoftware EngineerImplement a Key-Value Store with Nested Transactions
Implement an in-memory string key-value store with lookup, assignment, deletion, value counts, and deeply nested transactions. Define visibility plus exact begin, rollback, and inner or outer commit behavior without copying the entire database per transaction.
Coding & AlgorithmsOnsite - LyftMediumSoftware EngineerImplement command-driven in-memory key-value database
This question evaluates a candidate's ability to design efficient in-memory data structures and implement transactional semantics for operations like SET/GET/DELETE/COUNT, including handling nested transactions, rollbacks, and commits.
Coding & AlgorithmsOnsite - LyftMediumSoftware EngineerImplement paginated retrieval of transactions
Implement paginated retrieval of transactions 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 - LyftMediumSoftware EngineerMinimum Window Substring with Repeated Required Characters
Tests the sliding window technique and frequency counting to find the shortest substring containing all required characters with their exact multiplicities in linear time.
Coding & AlgorithmsOnsiteSliding WindowTwo PointersHash Table - LyftMediumData ScientistOptimize Driver Repositioning for Minimal Pickup Time
This question evaluates spatial algorithms and real-time optimization for ride dispatch together with interval scheduling and capacity planning competencies, covering skills in computational geometry, routing, demand forecasting, and temporal overlap reasoning.
Coding & AlgorithmsOnsite - LyftEasySoftware EngineerReconstruct a BST from Preorder Traversal
Reconstruct the exact binary search tree represented by a preorder traversal of unique integers. Handle empty and completely skewed inputs at scale while preserving the intended tree rather than balancing it.
Coding & AlgorithmsOnsite - LyftMediumSoftware EngineerRotting Oranges
Compute how many simultaneous spread steps are needed to rot every reachable orange using multi-source grid traversal.
Coding & AlgorithmsOnsite - 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 - LyftMediumSoftware EngineerSolve grid compromise spread with BFS
This question evaluates proficiency in graph traversal and grid-based simulation, specifically multi-source breadth-first search, state propagation modeling, and algorithmic complexity analysis within the Coding & Algorithms domain, emphasizing practical application of implementation and reasoning.
Coding & AlgorithmsOnsite - LyftMediumSoftware EngineerSolve substring and worker assignment
This pair of problems evaluates competencies in string processing and multiplicity handling as well as scheduling and resource-allocation for interval tasks, testing the ability to choose and apply appropriate data structures while managing time and space complexity.
Coding & AlgorithmsOnsite - Marshall WaceMediumSoftware EngineerCompute max events in any 60-second window
This question evaluates understanding of timestamp and array processing, sliding-window or two-pointer techniques, and the ability to analyze time and space complexity when counting events within fixed-size intervals.
Coding & AlgorithmsOnsite - MathWorksMediumSoftware EngineerCompute intersections for each segment
This question evaluates algorithmic problem-solving, interval reasoning, and complexity-analysis skills by requiring an efficient method to count how many other segments intersect each interval while accounting for edge cases like equal endpoints and duplicate segments.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerDecide transform via one-to-one mapping
This question evaluates understanding of character-to-character mappings in strings, modeling those mappings as directed graphs, detection and handling of cycles, and the ability to construct a sequence of replacements.
Coding & AlgorithmsOnline Assessment - 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 - MathWorksMediumSoftware EngineerDetermine string transform via end-append moves
This question evaluates a candidate's understanding of string manipulation, permutation feasibility, and algorithmic optimization for computing minimal move counts.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerFind shortest path using BFS
This question evaluates a candidate's proficiency with graph traversal algorithms—particularly breadth-first search—and the ability to model grid-based shortest-path problems while reasoning about time and space complexity.
Coding & AlgorithmsOnline Assessment - 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 - MathWorksMediumSoftware EngineerImplement BFS shortest paths with reconstruction
This question evaluates understanding of graph traversal via breadth-first search, computation of shortest paths in unweighted graphs, and path reconstruction using parent arrays, assessing algorithmic reasoning and implementation skills in the Coding & Algorithms domain.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMaximize disjoint k-sum pairs
This question evaluates proficiency in array algorithms, pairing logic, data structure selection, and complexity analysis, focusing on maximizing disjoint k-sum pairs and reasoning about space–time trade-offs.
Coding & AlgorithmsOnline Assessment - 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 - MathWorksMediumSoftware EngineerMaximize operations by removing target-sum pairs
This question evaluates a candidate's ability to design and analyze efficient array algorithms and use appropriate data structures and techniques such as hash maps or sorting with two-pointer strategies, with attention to time and space complexity.
Coding & AlgorithmsOnline Assessment - MathWorksMediumSoftware EngineerMinimize reduction cost and validate equal-sum pairs
This problem tests your ability to use greedy strategies with priority queues to minimize reduction costs and use hash-based frequency mapping to identify valid pairs that satisfy specific sum conditions.
Coding & AlgorithmsOnsiteGreedyMin-HeapHash Map
Luma AI
Lyft
MathWorks