Lyft Interview Questions — 26 DSA Problems

23 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Lyft LeetCode questions for software engineering interviews.

• Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design
• Read N Characters Given read4 II - Call Multiple Times (HARD) — Array, Simulation, Interactive
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Max Stack (HARD) — Linked List, Stack, Design, Doubly-Linked List, Ordered Set
• Convert Sorted List to Binary Search Tree (MEDIUM) — Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree
• Smallest Range Covering Elements from K Lists (HARD) — Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)
• Check Completeness of a Binary Tree (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• String Compression (MEDIUM) — Two Pointers, String
• Car Pooling (MEDIUM) — Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum
• Range Sum Query 2D - Immutable (MEDIUM) — Array, Design, Matrix, Prefix Sum
• Min Stack (MEDIUM) — Stack, Design
• Word Ladder II (HARD) — Hash Table, String, Backtracking, Breadth-First Search
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Water and Jug Problem (MEDIUM) — Math, Depth-First Search, Breadth-First Search
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Decode Ways (MEDIUM) — String, Dynamic Programming
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• Maximum Candies You Can Get from Boxes (HARD) — Array, Breadth-First Search, Graph
• Sort List (MEDIUM) — Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort
• Process Tasks Using Servers (MEDIUM) — Array, Heap (Priority Queue)
• Find Minimum Time to Finish All Jobs (HARD) — Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask
• Coordinate With Maximum Network Quality (MEDIUM) — Array, Enumeration