- tell me about yourself - quick sort - query to delete column in a table - implement tail command in C(or any lang) - how to sort 40 GB file if computer has 20 GB ram - implement queue using array - pthread , join thread, etc some more difficult pthread APIs - need for pointers,need for double pointers - message queues , rabbit mq
The ones who clear in the first round make to the interview.There were very few fromour college.
Mostly based on all the technical topics, like OOPS, DBMS etc
Design youtube on system design and LC mediums on coding.
Why was I looking to leave my current job.
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.
write own sizeof()..... sizeof(int)
Converging maze: Shortest meeting node for both the given nodes.
Viewing 2331 - 2340 interview questions