Ola Cabs Interview Experience for SDE-2
Question Details
Round 1:Next permutation for a given stringDP problem, Given two strings A B, Find how many times string B occurs as a subsequence in A.
Example A = "aacb", B = "ab", ans...
Full Details
Round 1 Next permutation for a given string DP problem, Given two strings A & B, Find how many times string B occurs as a subsequence in A.
Example A = "aacb", B = "ab", ans = 2 because B occurs twice in A.
Example A = "aabb", B = "ab", ans = 4
Round 2 Given 2 strings A & B. Find the smallest substring in A which contains all the characters in B. ( Asked me to code in java ) Implement LFU - least frequently used ( Asked me to code in Java ) Round 3 Design Yelp Round 4 ( HM Round ) Multi-currency wallet Behavioral Questions
Verdict Selected
About This Question
This is a reported interview question from a ola cabs interview for a swe role during the phone screen round reported in 2025.
It covers the following topics: Backtracking, Strings, Dynamic Programming .