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.
Why do you want to join us?
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
What's the difference between TCP and UDP?
Describe how a HTTP request is made and processed. Describe how a 3-way TCP handshake is done. Why must there be a server between the client and the database? What advantages or disadvantages of C++ are there in terms of security, optimisations or memory? Write code to take in inputs to move a robot along a 2d plane, then find a way to identify if the path taken, when repeated, will be discrete or non-discrete. Given 2 sorted arrays, find the intersection of the 2 arrays with optimisation requirements.
Serialize a binary tree to send it as a string.
How does garbage collection works in Java? How often do you think the GC cleans up the memory?
Online coding to implement LRUCache by any languages you have
Left-shift a primitive int array k times. You cannot allocate any extra memory and it should be O(n) time.
Behavioral Test - how you handle conflict Technical Test - HackerRank Question & Systems Design Question
Viewing 1111 - 1120 interview questions