Status: 2020 Graduate from one of NITs
YOE: 1 Year 2 Months (At the time of interview)
Location: India
How did I applied: Sent my resume to someone known and then got contacted by HR.
Interview Experience:
HR asked me about my work & coding experience and then he told me, he will get back to me soon.
Got a call from him the same day for scheduling the interview.
Round 1:
Ques 1: First missing positive Number ( https://leetcode.com/problems/first-missing-positive/ )
Ques 2: Min Cost of adding ropes
Ex: [2, 5, 3, 8, 7]
We can add these ropes length by this:
2 + 5 => 7, 3, 8, 7
7 + 3 => 10, 8, 7
10 + 8 => 18, 7
18 + 7 => 25
Total Cost = 7 + 10 + 18 + 25 = 60
We can also add them like this:
2 + 3 => 5, 5, 8, 7
5 + 5 => 10, 8, 7
7 + 8 => 15, 10
15 + 10 => 25
Total Cost = 5 + 10 + 15 + 25 =>55
We can solve this problem with the help of Priority Queue (Min Heap)
Details: Solved both the problems with took some time to solve the first question.
Round 2:
Ques 1: Excel Column no. by Column Name ( https://leetcode.com/problems/excel-sheet-column-number/ )
Ques 2: Remove all the duplicated in linkedlist ( https://leetcode.com/problems/remove-duplicates-from-sorted-list/ )
Details: For this round, I needed to write whole code (main funciton, making linked list for testing the code) and run it on any online compiler.
Solved first ques after struggling for a while.
For second question, first I thought that I need to remove any value which appears more that one time. After solving this, interviewer told me that the question was different. Tried making some changes in the code to meet the requirement but couldn't complete in time.
Result: Rejected
Have been told that 2nd round will be LLD Round. But after 2nd round, when I talked to HR I got to know that feedback from first round was not good that's why I got DSA question again in 2nd round.