Lyft Software Engineer Phone Screen Questions

Round 1: Recruiter Reach-Out (30min) - Discuss background, identity, and interview process. (The following content requires a score of 200 or higher. You can already view it.) Round 2: Phone Interview

Hello all, I have an interview coming up for Lyft. Any idea what to expect for virtual onsite interview? I didnt have any phone screening round. Will they have laptop round?...

https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes/

I was asked about the minimum window substring. Had to run the code too to prove it.

Initial Tech Screen Question was: https://leetcode.com/problems/rotting-oranges/

Status: 4 YOE Position: L4 SDE at Amazon Location: Palo Alto, CA Date: September 2021 Technical phone screen (1 hour): https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array Virtual Onsite: \t Coding: 1.5 hr. Consult any resource \t\t Part 1:...

Given two sorted iterators. Implement IntersectionIterator which returns only common elements in both iterators. If you are not familiar with Iterators check similar questions. public class IntersectionIterator implements Iterator<Integer> { public...

Position: New Grad Software Engineer The interview started with behavioral questions and past experience. After interviewer asked me to find intersection of Two Arrays without using Set() function.

Implement JSON stringify in JavaScript.

Status: 6 year Experience Position: SDE2 at Microsoft Location: Seattle Phone screen (1 hour): Talked about experience and what I am looking for. LeetCode medium level question. I didn\'t do the optimal solution so...

Alice has a set of buckets of various sizes, and an unlimited water supply. Her task is to measure an exact amount of water in one of the buckets. Buckets are...

Question: There are houses numbered from 1 to 1000. There are satellites positioned to cover the house broadcasting. Given two arrays L and R, L[i] and R[i] represents the house range where L[i]...

Status: 5 years software developer experience Position: middle developer at fintech Location: Seattle Phone screen (1 hour): Decode ways and Product of Array Except Self Onsite (4 round 1 hour each): signed NDA Round 1 [System design]: question...

Minimum path in mxn matrix from top left to bottom right. https://leetcode.com/problems/minimum-path-sum/ Next was find duplicates in an array where every element is 1 <= element <= n multiple duplicates; not just one. ...

## Problem You are given a list of employee records. Sort them by: (1) department name ascending, (2) salary descending within the same department, (3) employee name ascending as a final tie-breaker. ```python from dataclasses import dataclass @dataclass class Employee: name: str department: str salary: float def sort_employees(employees: list[Employee]) -> list[Employee]: pass ``` **Example:** ``` input = [ Employee("Zara", "Eng", 120000), Employee("Alice", "Eng", 120000), Employee("Bob", "Eng", 150000), Employee("Carol", "Design", 95000), ] -> Employee("Carol", "Design", 95000), Employee("Bob", "Eng", 150000), Employee("Alice", "Eng", 120000), Employee("Zara", "Eng", 120000), ``` ## Follow-ups 1. How do you sort by salary descending without negating the value -- what `key` function trick would you use? 2. What is Python's sort stability guarantee, and how does it help when chaining multiple sort passes? 3. How would you sort case-insensitively for department names without mutating the original strings? 4. If the list contains 10 million records, what is the memory and time complexity of Python's Timsort vs. an in-place merge sort?

## Problem Implement a page fetcher that retrieves paginated data from an API, handling concurrent requests or rate limits. ## Likely LeetCode equivalent None identified with high confidence. ## Tags coding, concurrency, system, phone

## Problem Convert a binary search tree to a sorted doubly linked list in-place. ## Likely LeetCode equivalent Similar to LC 426 Convert Binary Search Tree to Sorted Doubly Linked List. ## Tags coding, binary_tree, linked_list, phone