The compensation package is handsome, with a significant RSU portion.
Strict policies with micromanagement
1st round - Easy to medium Leetcode problems. 1. Remove duplicates from a linked list. 2. Given an array of integers, find the smallest subarray with the minimum sum. 2nd round - Manager round. Questions about my past projects were asked. I was asked
It has 5 rounds of programming, covering cloud service networking and OS-based scenarios. An understanding from basic to advanced would be more comfortable.
Came through a college internship placement drive. There was a HackerRank test with two questions. Then, there were multiple rounds of interviews. Questions covered basic data structures like stacks, queues, linked lists, arrays, graphs, and trees.
1st round - Easy to medium Leetcode problems. 1. Remove duplicates from a linked list. 2. Given an array of integers, find the smallest subarray with the minimum sum. 2nd round - Manager round. Questions about my past projects were asked. I was asked
It has 5 rounds of programming, covering cloud service networking and OS-based scenarios. An understanding from basic to advanced would be more comfortable.
Came through a college internship placement drive. There was a HackerRank test with two questions. Then, there were multiple rounds of interviews. Questions covered basic data structures like stacks, queues, linked lists, arrays, graphs, and trees.