3 algo round was there. you have to qualify any 2 to qualify for furthur rounds. Algorithmic coding question were asked in all 3 interviews. Questions were like Codeforces C problem mainly based on DP and Graphs.(some bitmasking also). Q1. There are 'N' people standing in a Queue. You are given the height of each person and the number of people who are taller and standing ahead of him. You have to find the position of each person.
The design discussion mostly revolved around designing a search feature for an online social media platform, where the toughest part was to optimize search to amortized O(1) , better than a search that was applicable in the case with complexity O(logN)
The best way to deal with browser cache invalidation/misses while serving static content/js or css libraries in case a newer version of the library or static asset is available.
Will you work for us for free and be my pet for the whole life?
How do you design a web application which handles millions of requests?
The question was a modification of traveling salesman problem. Both exact and approximate solutions were asked.
Am i willing to learn and be commited?
- Wenn Sie die Aufgabe hätten, alle Autos in Deutschland gleichzeitig auf die Straße zu bringen. Wie würden Sie vorgehen? - Stupide Fragen zu Stärken und Schwächen - Fachliche Erfahrungen etc.
How will you find common elements in two sorted integer arrays?
Telephonic basic signal processing, filter design, fir & iir filters etc. Face to Face very deep interview concepts of poles and zeros in filters, how signal behaves while doing changes, fourier transforms, transfer function of system.
Viewing 2301 - 2310 interview questions