GeeksforGeeks Question · Aug 2024 · Los Angeles

OLA Interview Experience | Set 12

SWE Phone Screen Director
Sign in to bookmark Original →

Question Details

Round 1:Hackerearth online coding round.Round 2: (1 hrs 15 minutes)Left View of a binary treeExplain Binary search and it’s complexity.How does a hash map work? What is th...

Full Details

🔒

Unlock all Ola Cabs questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a ola cabs interview for a swe role (director level) during the phone screen round reported in 2024.

It covers the following topics: Trees, Strings, Dynamic Programming, Binary Tree, Binary Search, Sql, Probability Stats, Graph, Recursion, Graphs, Hash Table, Arrays .

Topics

Trees Strings Dynamic Programming Binary Tree Binary Search Sql Probability Stats Graph Recursion Graphs Hash Table Arrays

More Ola Cabs Interview Questions

GeeksforGeeks OLA Electric Interview Experience for SDE (On-Campus) GeeksforGeeks Ola Cabs Interview Experience for SDE-2 GeeksforGeeks OLA Interview Experience | Set 10 ( For DS) GeeksforGeeks OLA Cabs Interview Experience | Set 2 (For Android - 1.5 Years) GeeksforGeeks OLA Interview Experience | For Experienced -SDE-2
← All Ola Cabs questions Ola Cabs Software Engineer Questions → All Arrays Questions →