Question 1

Rotting Oranges — Lyft Interview Question

Accepted Answer

"Rotting Oranges" is a medium difficulty problem asked at Lyft interviews. It covers the following topics: Array, Breadth-First Search, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/rotting-oranges

Question 2

Time Based Key-Value Store — Lyft Interview Question

Accepted Answer

"Time Based Key-Value Store" is a medium difficulty problem asked at Lyft interviews. It covers the following topics: Hash Table, String, Binary Search, Design. You can practice it on LeetCode: https://leetcode.com/problems/time-based-key-value-store

Question 3

Read N Characters Given read4 II - Call Multiple Times — Lyft Interview Question

Accepted Answer

"Read N Characters Given read4 II - Call Multiple Times" is a hard difficulty problem asked at Lyft interviews. It covers the following topics: Array, Simulation, Interactive. You can practice it on LeetCode: https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times

Question 4

Minimum Window Substring — Lyft Interview Question

Accepted Answer

"Minimum Window Substring" is a hard difficulty problem asked at Lyft interviews. It covers the following topics: Hash Table, String, Sliding Window. You can practice it on LeetCode: https://leetcode.com/problems/minimum-window-substring

Question 5

Max Stack — Lyft Interview Question

Accepted Answer

"Max Stack" is a hard difficulty problem asked at Lyft interviews. It covers the following topics: Linked List, Stack, Design, Doubly-Linked List, Ordered Set. You can practice it on LeetCode: https://leetcode.com/problems/max-stack

Question 6

Convert Sorted List to Binary Search Tree — Lyft Interview Question

Accepted Answer

"Convert Sorted List to Binary Search Tree" is a medium difficulty problem asked at Lyft interviews. It covers the following topics: Linked List, Divide and Conquer, Tree, Binary Search Tree, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree

#	Question Title	Difficulty	Frequency	Topics
1	Rotting Oranges	MEDIUM	100.0	ArrayBreadth-First SearchMatrix
2	Time Based Key-Value Store	MEDIUM	94.3	Hash TableStringBinary Search+1
3	Read N Characters Given read4 II - Call Multiple Times	HARD	93.5	ArraySimulationInteractive
4	Minimum Window Substring	HARD	91.9	Hash TableStringSliding Window
5	Max Stack	HARD	79.8	Linked ListStackDesign+2
6	Convert Sorted List to Binary Search Tree	MEDIUM	78.2	Linked ListDivide and ConquerTree+2
7	Smallest Range Covering Elements from K Lists	HARD	74.6	ArrayHash TableGreedy+3
8	Check Completeness of a Binary Tree	MEDIUM	74.6	TreeBreadth-First SearchBinary Tree
9	String Compression	MEDIUM	74.6	Two PointersString
10	Car Pooling	MEDIUM	74.6	ArraySortingHeap (Priority Queue)+2

Explore 450+ Companies

Companies

Lyft

Want to see more?

Lyft Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Lyft

Want to see more?

Lyft Interview Questions

Ai Assistant Kas