Member of Technical Staff Profile - On campus - 24 LPA

1 OA + 2 Technical Rounds + 1 Manegerial Round

OA - medium.
Ques 1 Get minimum angle between hours and minute hand.
Ques 2 Easy question on Array. Check if the array has i<=j<k such that nums[i]*nums[j]=nums[k]
35 easy MCQ based question on Quants, English, Logical Reasoning.

Round 1 - Technical Interview

Intro
Was asked about the project currently working on.
Question 1 https://leetcode.com/problems/jump-game-ii/
Question 2 https://leetcode.com/problems/validate-binary-search-tree/
Provided Greedy approch of question 1 and solved question 2. Was asked some variation on the solution provided. And was also asked time complexity for both the solutions.

Round 2 - Technical Interview
Intro
Question 1: Find the minimum cost to install the internet on all the houses. Provided the array of the cost offered by the different ISP to houses in 4X3 matix. Given the fact that the ISP used by the house can't be used by the next house that follows.
Question 2: Find top view of the binary tree.
Solved both question with little help from interviewer. Was asked question on time complexity and approach for both questions.

Round 3 - Managerial Round
Interviewer Congratulated for getting this far. Asked about the experienced had in previous round. Ask some question on the blockchain as i have mentioned that I have been head coordinator on Blockchain Research Lab in College.
Question 1: https://leetcode.com/problems/word-ladder/
Question 2: https://leetcode.com/problems/min-stack/
I was not able to solve the first question but provided my understanding of what the solution would look like. For second, I was able to solve it complete. Also interviewer asked me about the time complexity on remove operation.
The interviewer also explain about the project they are hiring for. The work involve more of python work. I gave all my solutions in JAVA.

Verdict: I guess not every story has a happy ending. 😄