There are total of three rounds, first is OA (easy to medium question on LeetCode, sorting and dynamic programming) Second round is online coding interview with Senior Software engineer, Dynamic programming question with a follow up question based on Kadane's algorithm, both questions can be found on leetcode. After that is cs fundamentals on database, operating system and networking. Third round is resume screening and explain you previous project and intern experiences.
How would you make your solution scalable and capable of handling many thousands of requests at once?
1st round (Glider Assessment): 1. Merge Intervals 2. Funny sort (e.g. [1, 2, 3, 5, 4, 10] -> [1, 10, 2, 5, 3, 4]) 2nd round (Zoom interview): 1. given an array, find the number of occurrences of a target value 2. SQL Indexing 3. TCP vs UDP 4. Threads vs Processes 5. cant rly rmb the rest
Why do you want to join us?
Reorder a linked list (A->B->C->D to A->D->B->C)
Left-shift a primitive int array k times. You cannot allocate any extra memory and it should be O(n) time.
Write a function that calls an API endpoint and prints out the response. Implement concurrency for high volume of calls.
topics like system design, hashmap, linkedlist and so on...
What is the difference between Http1.1 and Http2
First Technical Round : Given a infinite stream of numbers find top `k` elements at any time, JAVA OOPS questions, how to sort a very large list of numbers all details about it, etc. Second Technical Round : don't remember question but one was logic question and other were Algo DS based.
Viewing 1131 - 1140 interview questions