Backgroud:  IT branch from Tier-1 College.\nExperience : 1.3 year experience (6 month internship included)\nCurrent company and Ctc : Top product based company; 15 lpa\n\n\nOnline Coding Round : There were 2 coding question and I was able to solve both of them.\n\nScreening Round : This was a special interview round conducted to check whether the candidate is suitable for job or not. Two technical questions were asked in this round.\nQuestion 1 : Check if two trees have same order of leaf nodes.\nQuestion 2:  Matrix traversal using bfs.\nI was able to solve both of them and then I received a mail for further rounds.\n\nTechnical Round 1:  (There were 2 interviewer both were SDE -1 ) It was 1hour 10 min long round. Interviewer asked 1 coding question , some project related question and some LP related questions \nCoding question: https://leetcode.com/problems/maximize-distance-to-closest-person/\nI told an approach using max heap and implemented the solution. Interviewer was okay with my solution.\nHe asked few questions related to heap. I told him the algorithm for insertion deletion in heap\n\nTechnical Round 2: (There were 2 interviewer 1 was SDE - 3 and other one was SDE -2)1 coding question and  some project related question\nCoding question: It was based on graph. I was given few string and I can only travel between 2 strings if the difference between them is of one character. I have to tell the minimum time in which we can travel from one source to destination\nI was able to solve the question using bfs and the interviewer looked satisfied with the aprroach but I took around 40-45 min to solve this question. \n\nTechnical Round 3 : (A senior engineer took this round) This round stretched for around 1hour 10 min.\nI was asked 2 coding question and lot of questions related to my project and LP.\n\nCoding question 1: There is an unsorted array which contains real and imaginary number. If possible I have to arrange them in an alternate format.\n\nI told him a solution and coded that.I told him that I will separated them by using an extra vector and merge them again. I took care of all the corner cases.He asked me lot of questions on my approach and he was partially satisfied.\nUnfortunately, I told him that I can solve it using O(1) space but was not able to code that solution and told him that I will need some more time to do it O(1) so we moved on to next question.\n\n\nCoding question 2 : Year of birth and death was given as a pair for n people. You have to tell which year has max population.\n\nI told him a brute force solution  and coded that(O(n) & O(n)) and then I told him a time :O(n) & space :O(1) and he was okay with that.\n\nThen he asked lot of question regarding my project and few questions went over my head.\nHe asked few LP questions and I answered them well.\n\nAfter these rounds, my managerial round has been rescheduled 3 times and now the HR is not replying.Its been a week now and I have not recevied a rescheduling mail or rejection mail.

Backgroud:  IT branch from Tier-1 College.\nExperience : 1.3 year experience (6 month internship included)\nCurrent company and Ctc : Top product based company;