Skip to content

Latest commit

 

History

History
55 lines (55 loc) · 9.34 KB

lyft.md

File metadata and controls

55 lines (55 loc) · 9.34 KB
Title Acceptance Level
Intersection of Two Arrays 62.5% Easy
Move Zeroes 57.8% Easy
Merge Two Sorted Lists 53.5% Easy
Best Time to Buy and Sell Stock 50.5% Easy
Two Sum 45.6% Easy
Min Stack 44.5% Easy
Max Stack 42.6% Easy
String Compression 41.3% Easy
Merge Sorted Array 39.4% Easy
Valid Parentheses 39.0% Easy
Sqrt(x) 33.9% Easy
Reverse Integer 25.8% Easy
Find All Duplicates in an Array 67.8% Medium
Generate Parentheses 62.7% Medium
Subsets 62.0% Medium
Product of Array Except Self 60.1% Medium
Convert Binary Search Tree to Sorted Doubly Linked List 59.1% Medium
Car Pooling 56.7% Medium
Rotate Image 56.7% Medium
Number of Distinct Islands 56.0% Medium
Missing Element in Sorted Array 54.5% Medium
Time Based Key-Value Store 53.1% Medium
Flatten Nested List Iterator 52.9% Medium
Container With Most Water 50.8% Medium
Swap Nodes in Pairs 50.4% Medium
Find Duplicate Subtrees 50.2% Medium
Convert Sorted List to Binary Search Tree 47.7% Medium
Perfect Squares 47.4% Medium
Number of Islands 46.8% Medium
Letter Combinations of a Phone Number 46.8% Medium
Flatten 2D Vector 45.7% Medium
Meeting Rooms II 45.7% Medium
Permutation in String 44.4% Medium
Find Peak Element 43.3% Medium
Asteroid Collision 41.0% Medium
Range Sum Query 2D - Immutable 38.6% Medium
Largest BST Subtree 35.8% Medium
Word Search 35.6% Medium
Add Two Numbers 33.9% Medium
LRU Cache 33.2% Medium
Water and Jug Problem 30.6% Medium
Word Ladder 29.6% Medium
Decode Ways 24.7% Medium
Smallest Range Covering Elements from K Lists 52.4% Hard
Trapping Rain Water 48.9% Hard
Design Search Autocomplete System 44.7% Hard
Sliding Window Maximum 43.0% Hard
Merge k Sorted Lists 40.2% Hard
Minimum Window Substring 34.6% Hard
Read N Characters Given Read4 II - Call multiple times 33.8% Hard
Text Justification 27.7% Hard
Regular Expression Matching 26.8% Hard
Word Ladder II 22.1% Hard