Lyft interview questions

Showing 31–52 of 52 results

• 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 K-Means Clustering from Scratch in Plain Python or NumPyMedium

  A live coding exercise that asks you to implement k-means clustering from scratch in Python, with NumPy optional, and make it pass the interviewer's test cases. It tests the assignment and update steps, initialization, convergence, empty clusters and writing runnable code under time pressure.

  LyftMachine Learning EngineerMachine LearningTechnical Screen
• Implement Stateful Fetch-N over a Paginated UpstreamMedium

  Implement a stateful fetchN wrapper over a paginated upstream that returns items in source order across repeated calls. Define buffering, page-token progression, exhaustion, empty pages, invalid input, and retry behavior without losing or duplicating items.

  LyftSoftware EngineerSoftware Engineering FundamentalsOnsite
• 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
• In-Memory Key-Value Store with Nested Begin, Commit, and Rollback TransactionsMedium

  A coding question to implement an in-memory key-value store with begin, set, unset, commit and rollback, where transaction blocks can be nested and committed changes can no longer be rolled back. It tests how state is recorded per block, restoring keys that were absent, nested commit semantics, and operation complexity.

  LyftSoftware EngineerSoftware Engineering FundamentalsOnsite
• Investigate Causes of Driver WOW Score DropMedium

  Investigate Causes of Driver WOW Score Drop evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  LyftData ScientistAnalytics & ExperimentationOnsite
• Investigate Metric Drops and Coupon RetentionMedium

  This question tests your ability to diagnose a sudden drop in a core business metric, distinguish between technical tracking issues and product-driven behavior, and design a strategy to evaluate coupon effectiveness.

  LyftData ScientistAnalytics & ExperimentationTechnical Screen
• Investigate Sudden Metric Changes and Design A/B TestMedium

  Investigate Sudden Metric Changes and Design A/B Test evaluates metric design, causal reasoning, experiment setup, diagnostics, SQL/statistical checks, and recommendations in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  LyftData ScientistAnalytics & ExperimentationTechnical Screen
• Investigate a 7% Monthly Active Riders Drop and a 20% Wait-Time IncreaseMedium

  Tests your ability to conduct a structured root-cause analysis on simultaneous marketplace metric regressions, decomposing supply-demand dynamics and separating correlation from causation.

  LyftData ScientistAnalytics & ExperimentationTechnical Screen
• 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
• Query and transform marketplace data in SQL/PythonMedium

  This question evaluates mastery of data manipulation and analytics skills in the Data Manipulation (SQL/Python) domain, including SQL aggregation and window functions, time-based joins and grouping, deduplication of status streams, handling late-arriving events, and implementing rolling metrics using both SQL and pandas.

  LyftData ScientistData Manipulation (SQL/Python)Onsite
• Reason About an Intercept Shift in Logistic RegressionMedium

  Tests understanding of how an additive shift to the intercept of a logistic regression model impacts predicted probabilities, ranking metrics (ROC-AUC), thresholded classification metrics (Recall, FPR, Precision), and calibration.

  LyftMachine Learning EngineerMachine LearningTechnical Screen
• 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
• Train vs Test Error Diagnosis, Overfitting Fixes by Model Type, and Cross-ValidationMedium

  A machine learning fundamentals screen that asks you to diagnose models from pairs of training and test error, including the unusual case where the test error is the lower one. It continues with curbing overfitting in linear, tree-based and neural network models, and with setting up validation splits and k-fold cross-validation.

  LyftMachine Learning EngineerMachine LearningTechnical Screen
• Wrapper Over a Paginated Page API That Fetches the Next N WordsMedium

  A coding question that wraps an external paginated API, where each page returns a variable number of words, behind a fetch(n) method that returns the next n words in order. It tests handling words left over between calls, requests that span several or empty pages, lazy fetching, the end of the content, and API failures.

  LyftSoftware EngineerSoftware Engineering FundamentalsOnsite