Coding & Algorithms interview questions

Showing 1561–1590 of 3276 results

• Explain Python internals and practicesMedium

  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.

  Lowe'sSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find longest unique substringMedium

  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.

  Lowe'sSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Refactoring Assessment FeaturesHard

  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.

  Luma AISoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Seven Python Image and Data TasksMedium

  This problem tests foundational proficiency in NumPy array manipulation, mathematical function implementation, and geometric logic, which are essential for low-level image processing tasks.

  Luma AIMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Assign Minimum Workers to JobsMedium

  This problem tests your ability to manage overlapping intervals and greedy resource allocation using minute-based time arithmetic.

  LyftSoftware EngineerCoding & AlgorithmsOnline Assessment
• Assign Tasks to the Minimum Number of WorkersMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Design a temporal key-value store with historical readsMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Implement Grid Spread and Transactional StoreHard

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Key-Value Store with Nested TransactionsEasy

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Implement command-driven in-memory key-value databaseMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Implement paginated retrieval of transactionsMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Minimum Window Substring with Repeated Required CharactersMedium

  Tests the sliding window technique and frequency counting to find the shortest substring containing all required characters with their exact multiplicities in linear time.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Optimize Driver Repositioning for Minimal Pickup TimeMedium

  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.

  LyftData ScientistCoding & AlgorithmsOnsite
• Reconstruct a BST from Preorder TraversalEasy

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Rotting OrangesMedium

  Compute how many simultaneous spread steps are needed to rot every reachable orange using multi-source grid traversal.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Smallest Covering Window in a StringMedium

  Tests using the two-pointer sliding window pattern combined with frequency counting to find the shortest substring satisfying multiset inclusion constraints in linear time.

  LyftSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve grid compromise spread with BFSMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Solve substring and worker assignmentMedium

  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.

  LyftSoftware EngineerCoding & AlgorithmsOnsite
• Compute max events in any 60-second windowMedium

  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.

  Marshall WaceSoftware EngineerCoding & AlgorithmsOnsite
• Compute intersections for each segmentMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Decide transform via one-to-one mappingMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Determine Whether P's Position Is UniqueMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine string transform via end-append movesMedium

  This question evaluates a candidate's understanding of string manipulation, permutation feasibility, and algorithmic optimization for computing minimal move counts.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find shortest path using BFSMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• How to maximize rewards with exactly k tasksEasy

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement BFS shortest paths with reconstructionMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize disjoint k-sum pairsMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize minimum after K decrementsEasy

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize operations by removing target-sum pairsMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnline Assessment
• Minimize reduction cost and validate equal-sum pairsMedium

  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.

  MathWorksSoftware EngineerCoding & AlgorithmsOnsite