Ola Cabs LeetCode Questions
24 questions all-time · 5 easy · 14 medium · 5 hard
Track your progress. Sign in free to tick off problems and save what you've solved across every company.
| # | Problem | Difficulty | Frequency | Acceptance | |
|---|---|---|---|---|---|
| 1 | Longest Substring Without Repeating Characters | Medium | 100 | 0.4% | |
| 2 | Add Two Numbers | Medium | 96 | 0.5% | |
| 3 | Trapping Rain Water | Hard | 91 | 0.7% | |
| 4 | Two Sum | Easy | 77 | 0.6% | |
| 5 | Validate Binary Search Tree | Medium | 77 | 0.4% | |
| 6 | Group Anagrams | Medium | 77 | 0.7% | |
| 7 | Binary Tree Maximum Path Sum | Hard | 77 | 0.4% | |
| 8 | Longest Palindromic Substring | Medium | 66 | 0.4% | |
| 9 | Climbing Stairs | Easy | 66 | 0.5% | |
| 10 | House Robber | Medium | 66 | 0.5% | |
| 11 | Number of Islands | Medium | 66 | 0.6% | |
| 12 | Decode String | Medium | 66 | 0.6% | |
| 13 | Container With Most Water | Medium | 66 | 0.6% | |
| 14 | Alien Dictionary | Hard | 66 | 0.4% | |
| 15 | 3Sum | Medium | 66 | 0.4% | |
| 16 | Find Pivot Index | Easy | 66 | 0.6% | |
| 17 | Find Minimum in Rotated Sorted Array | Medium | 66 | 0.5% | |
| 18 | Excel Sheet Column Title | Easy | 66 | 0.5% | |
| 19 | First Missing Positive | Hard | 66 | 0.4% | |
| 20 | Delete Node in a Linked List | Medium | 66 | 0.8% | |
| 21 | Best Time to Buy and Sell Stock | Easy | 66 | 0.6% | |
| 22 | All Nodes Distance K in Binary Tree | Medium | 66 | 0.7% | |
| 23 | Unique Paths | Medium | 66 | 0.7% | |
| 24 | Word Ladder | Hard | 66 | 0.5% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.