Nokia Interview Experience for R&D Internship (On-Campus)
Nokia visited our campus on 2nd November 2020 to hire for the role of Student Intern at Nokia R&D center. There were 2 rounds involved in the process.
- Online Test (AMCAT)
- Technical + Managerial (2 Hours)
The online test was conducted on the platform of the aspiring mind and consisted of the following parts:
- 50 MCQs (Quantitative Ability, Logical Reasoning, English)
- Two Coding Questions (Using C++, JAVA, or Python)
If you are able to solve problems fast, then it will be relatively easier for you to get a good score in the Aptitude round. You can practice for aptitude round using this link: https://www.geeksforgeeks.org/aptitude-questions-and-answers/
The difficulty level of codings questions was average. Both questions can be done easily if you have practiced “Medium” level DSA questions on GeeksforGeeks before. The database consisted of many questions so many students got different questions during the coding round. Two questions that I got were similar to the ones mentioned below:
- Minimum Number of Platforms Required for a Railway/Bus Station.
- Minimum number of jumps to reach end | Set 2 (O(n) solution).
Approximately, 1500 students from our college gave the online test, out of which 70 were selected for the next round.
Round 2: This was a technical plus managerial round which went for approximately 2 hours. The interview was conducted on Microsoft Teams and the Interviewer was very friendly and composed throughout the interview even though there was some connection problem from my end initially. The interview went in the following way:
- He started off by asking my Introduction and some questions related to the projects mentioned in my resume.
- Then he asked theoretical questions based on OOPS concepts and some real-world applications.
- Then he gave me a small puzzle. I never did that puzzle before, so he was happy when I came up with the solution. The question was: Given 7 balls with the same weight and 1 ball with different weight. Find minimum weighting tries needed to find the ball with different weight.
- After that, he asked me about the time complexities of various sorting and searching algorithms. Then he asked me to write bubble sort logic on the shared screen. While doing that he asked me some questions on a number of comparisons and some follow-up questions based on some changes in the code to see if I actually know how the code works.
- Then he gave me this question: Generate a 4-digit number such that the sum of the squares of the first half and second half of the number equals the number itself. For Example: “1233” since (12*12) + (33*33) = “1233”
- I was again asked a puzzle related to the NIM game for which I came up with a solution in a few seconds.
- After the puzzle, the interviewer looked happy and gave me this final question: Program for Least Recently Used (LRU) Page Replacement algorithm (I took some time in understanding the question and asked multiple doubts regarding it which my interviewer cleared without any hesitation. So finally, I was able to come up with a solution and correct code within 10-12 minutes).
- The interviewer looked satisfied because he appreciated me multiple times during the interview and finally asked if I have any questions for him. I asked about the technologies he is working on and opportunities at Nokia to which he answered, and then we ended the meeting.
Important Tip: Always be vocal about your thoughts. They want you to say “WHY” you are writing this particular line of code. Don’t talk about the code itself. For eg, Don’t say “I am sorting this array”. Tell Them why you are sorting the array.
6 students received the offer letter after the second round. I was one of them!
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses
are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!