SRIB visited our campus in September 2020 for internships.
Online Coding Round: It had 3 coding questions. The duration was 70mins.
- Find the highest prime factor for a given number N.
- Given data of all nodes of a binary tree (pointer-based), find the difference between maximum and minimum value.
- Given root node of binary tree(pointer-based) and number k, find the highest value of gcd(x,k) where x is value of any node of that tree.
Technical Interview Round 1: It was on the Skype platform. The duration was 45mins.
He gave 3 coding questions:
- https://www.geeksforgeeks.org/remove-all-duplicate-adjacent-characters-from-a-string-using-stack/
- https://www.geeksforgeeks.org/reverse-a-linked-list/
- Similar to https://www.geeksforgeeks.org/find-sum-left-leaves-given-binary-tree/
I got a hint for question 1, then wrote code for all 3 fast.
One DBMS question:
- Given some columns, remove the row containing the second-highest value of a particular row.
One OOPS question:
- Write Code for Singleton Class.
Technical Interview Round 2: It was on the Skype platform. The duration was 45mins.
- For the first 15-20 mins, questions from my Resume and my projects were asked.
- Then he asked “Design Git”. It was a discussion of 10mins. No coding was required. I gave a graph-based approach. He was impressed with my thinking ability.
- Then he asked another question: “If there are a lot of incoming images in Android Phone with varying resolution and size, what is the best way to display it?”. I told about bitmap compression and the discussion went for 5mins.
Note: This round was to test my thinking capability.
After the second round, 3 students were finally selected for the internship, and I was one of them.
Advice: If stuck in a coding question, try to get a hint from the interviewer.
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!
Last Updated :
11 Nov, 2021
Like Article
Save Article