Interview Experience by Amit Singh | On Campus

New update is available. Click here to update.

SDE - Intern

Groww

2 rounds | 5 Coding problems

Amit Singh

Fresher | Oct 2020

Selected

2055 views

0 comments

0 upvotes

Interview preparation journey

Journey

I came from a non-computer science background. I started coding in my first year when my seniors informed me how important it is. I started with basic coding and started with hacker rank and gradually increased the difficulty of the problem. After that I took coding ninjas c++ course and learnt all important DSA algorithms properly. The course helped me prepare completely for the internship interviews.

Application story

The internship and placement season began in our college. This company visited to my campus for the placement. We just had to upload resume and filled all details in the form. It was followed by shortlisting students and taking interviews.

Why selected/rejected for the role?

I was selected because, I could solve almost all the problems in an optimised manner and I seemed enthusiastic about the role of a Developer. I was able to communicate my thoughts properly to the interviewer and answer with a clarity.

Preparation

Duration: 3 months

Topics: Data Structure and Algorithms, Operating Systems, Database Management Systems, Communication Skills

Tip

Tip 1 : First Go through all the concepts of Data Structures and algorithms, I have taken Coding ninjas course c++ interview preparation.
Tip 2 : Try to solve all the problems by yourself then it will be meant for you, if you can't solve them after 30-45 minutes of time then see the solution of it, and for this, I used to consult TA and mentors on coding ninjas course.
Tip 3 : Have confidence in yourself, if you can't solve it initially, gradually you will be able to solve the problems. Hard work pays off.
Tip 4 : Note down the main information's about your project like what you have done in the project and what difficulties you have faced, it will be a great way to tackle questions about the project in the interview.

Application process

Where: Campus

Eligibility: 7

Resume tip

Tip 1 : Keep it simple and mention what you actually know and achieved.
Tip 2 : Mention your institute email-id if you have, it adds weight to the resume
Tip 3 : Use the "Built/created/made X using Y to achieve Z" format when writing about projects or work done.

Interview rounds

Round

Medium

Online Coding Interview

Duration65 minutes

Interview date8 Oct 2020

Problems2

Minimum and Maximum Cost to buy N Candies

Ram went to a specialty candy store in Ninjaland which has 'N' candies with different costs.

Problem approach

First Sort the price array. For finding the minimum amount start purchasing candies from starting and reduce k free candies from last with every single purchase. For finding the maximum amount start purchasing candies from the end and reduce k free candies from starting in every single purchase.

Try solving now

Word Break-1

You are given a non-empty string containing no spaces (say sentence) and a dictio...

Try solving now

Round

Medium

Video Call

Duration90 minutes

Interview date17 Oct 2020

Problems3

Delete middle node

You have been given a singly Linked List of integers. Your task is to delete the middle node of this List.

Note:

1. If there is no middle node in the list...

Problem approach

Step 1 : Take two pointers
Step 2 : Initialize both pointers to the head node and iterate one pointer by two and one by just one step
Step 3 : The pointer which is iterating by one step will reach the mid when other will reach the end.
Step 4 : Delete the mid pointer(which reached the mid).

Try solving now

Replace each element of Array with its corresponding rank

Given an array of integers 'ARR’ of size ‘N’. Replace each element of this array with its corresponding rank.

Problem approach

Step 1 : To compute the rank of the element first make a copy of given arr[] then sort that copied array in ascending order.
Step 2 : Then traverse in the copied array and put their rank in HashMap by taking a rank variable.
Step 3 : If the element is already present in HashMap then don’t update rank otherwise update rank of the element in HashMap and increment rank variable as well.
S...

Try solving now

Left View of Binary Tree

Given a binary tree. Print the Left View of the Tree.

Example :

If the input tree is as depicted in the picture:

Problem approach

We can keep track of the level of a node by passing a parameter to all recursive calls. The idea is to keep track of the maximum level also. Whenever we see a node whose level is more than the maximum level so far. We print the node because this is the first node in its level (Note that we traverse the left subtree before the right subtree).

Try solving now