Status: SDE 1
Position: Analyst
Location: Bengaluru, India
Date: May 14, 2019
Round 1 : CoderPad Round (1 hour)
Two questions to be coded on the coderpad platform.
Question 1: Given a list of students and their marks (where the name of students can repeat). Find the student which scored maximum average marks.
Question 2: Find the first non-repeating character in an array.
Ref: https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/
Onsite (5 rounds)
Round 1: (1 hour)
General Discussion about my interests and projects completed. Some discussion on my project that I worked on in previous organisation. I was asked 'Why I want to switch?' etc.
Round 2: (1 hour)
- Discussion on one of my project.
- Left view printing of a binary tree.
https://www.geeksforgeeks.org/print-left-view-binary-tree/
Round 3: (1 hour)
- Construct binary tree using inorder and preorder
https://www.geeksforgeeks.org/construct-tree-from-given-inorder-and-preorder-traversal/
- Given two lifts with a capacity of 10 persons. There are 10 floors in a building. Write a method that will give the user which lift should come to you with inputs as the floor on which you are and the target floor.
Round 4: (1 hour)
- Given a row and column wise sorted matrix, write a method to return kth largest element.
https://www.geeksforgeeks.org/kth-smallest-element-in-a-row-wise-and-column-wise-sorted-2d-array-set-1/
- Project Discussion
- What are your expectations from GS and team.
- Write SQL query for printing the largest average salary of each department (Using some SQL class).
- Given a set of numbers, divide the set into two sets such that there sum is equal.
Round 5: (1 hour)
Design a board for flights. Some questions were discussed:
- How will you handle information from different carriers.
- Is memory needed for storing information?
- What will the database query be?
- How will you modify the application if your database holds other information that is not needed.
Overall experience was positive. Just be vocal and explain your approach.