Given a string str and another string patt. Find the character in patt that is present at the minimum index in str. If no character… Read More »
Round 1: Hackerearth online coding round. Round 2: (1 hrs 15 minutes) Left View of a binary tree Explain Binary search and it’s complexity. How… Read More »
Round 1 (Online Test): Four Programming Questions- a) Given a string find number of different substrings that are palindromes. b) In a matrix we can… Read More »
1. Abut my DS related work. Why change? IsBST() Kadane algo with start and end indices. 2. What is SVM? Given a hard disk with… Read More »
1. Written Find unions of all intervals(startime, endtime) Design cricket score dashboard (which can give match result, tournament result and player stats) 2. how to… Read More »
Design Round: 1. Design LRU cache and implement 2. Solving sudoko 3. Design to replace the existing Support tab navigation based to search based in… Read More »
I was recently interviewed by OLA, I could not make it after the last round. All rounds I had were telephonic, in the last round… Read More »
Last month i was interviewed by Ola for SDE 1 post. Here is my experience.
Design the entire bowling alley system. One bowling game will be played by multiple players on a single lane.
I was recently interviewed for SDE 2 position at OlaCabs.
I attended interview for Ola high availability team. Below are the questions.
An employee works for an employer for 7 days. The employer has a gold rod of 7 units. How does the employer pays to the… Read More »
First Round Written Test 1) Implement Stack Operations. Also maintain count of Largest Integer present in Stack at any given point of Time.
I attended the interview for OLA Cabs in Bangalore for SDE position recently. Here is my interview experience.
Design a Data Structure for the following operations. The data structure should be efficient enough to accommodate the operations according to their frequency.