“Muskan Goel” who was placed at “Paytm” talks about her interview experience and some other tips to prepare for placement season. Check out what she says about the placement season.
Her Interview was taken by UnsaidTalks Interviewer: “Mohit”
Profile offered: Software Developer
Job Location: Either Chandigarh/Banglore/Noida
Branch and Graduation Year: COE – 2022
Cgpa Cutoff: No cgpa cutoff
Interview Difficulty Level: Coding ques-7, OOPS concept-8, Overall -7 (1-very easy, 10-very difficult)
Here are the questions we asked Muskan Goel to know about her interview experience.
Question 1: Introduce yourself to our readers.
Answer: Hello, my name is Muskan. I am from Kanpur (Uttar Pradesh) and I am a b.tech fourth-year student in the computer engineer branch and I recently got placed in PAYTM.
Question 2: Describe Your written test experience specifying the number of rounds, details of each round, and type of test platform (online – amcat, hackerearth, etc / offline)
Answer: First round was an online test it contains 3 coding questions of which one was easy, the second one was medium-easy, and the third one was medium- difficult and there was a total time limit of 1 hr and 10 mins. But if you solve them faster then only you were getting selected and I completed it in around 25-30 mins so I got selected for the interview round.
Question 3: Describe your all technical interviews specifying the number of rounds and details of each round (if any) (please share coding questions if possible)
Answer: There were 2 technical rounds in which 1st round was for 1 hr and he asked 4 coding questions involving trees, graph all he picked and the first question was on leetcode( test platform) and the ques was about string and you have to find the longest substring with no repeating character since I have a lot of practice on leetcode I did it at the first try and after the submission. He sends me the second ques. But after knowing that I did the first ques. He canceled the second ques and then he asked to find the longest binary search tree in the given binary tree. I got confused I was taking my time 10-15 min. He was also helping me by saying if I was going in right direction or not, at last, I told him the approach and then he asked the last question that was simple question like you have given an array and have to collect the maximum point but you can’t select 2 adjacent numbers.
Question 4: Describe your all HR interviews specifying the number of rounds and details of each round
Answer: There was only 1 HR round which was basically a telephonic round and that was for only 5 mins asking about the location preference and about the company and all.
Question 5: What were the key factors for your selection?
Answer: I had a lot of practice in coding which was the major reason and second I also studied OOPS. They asked me very detailed questions about oops and minute things and I think if I didn’t answer that I won’t be selected.
Question 6: What are the things students should focus on in order of priority?
Answer: CODING and DSA would be the topmost priority if you have to go into the technical field because without that you won’t be able to survive.
Question 7: According to you, what role do extracurricular activities as well as participation in societies play?
Answer: Yes definitely, you can also be part of any society. I was also a part of knock dance society and frosh in my 2nd year as my cgpa is not that good it was 8.13 so I guess you should definitely take part in society and do extracurricular have all the fun. But when the time comes you should get yourself in study’s as well.
Question 8: Any Other Advice you would like to give to your juniors?
Answer: Don’t leave the core subjects like O.S, OOPS, and computer network, DBMS, it’s very important because once you lose touch it will be very difficult to gain that back, and also if you are going for tech. You should start coding at the end of the fifth sem at least.
Question 9: How can we contact you? (LinkedIn Profile Link/Contact No./etc.)
For any further Queries feel free to comment below.