'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Nagaaro interview experience Real time questions & tips from candidates to crack your interview
Trainee Technology
Nagaaro
upvote
share-icon
4 rounds | 9 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 6 Months
Topics: Data Structures and Algorithms, OOPS, Operating Systems, DBMS, Computer Network
Tip
Tip

Tip 1 : For DS and Algo, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews.

Application process
Where: Campus
Eligibility: Above 60% in B.Tech, B.Tech in CSE/ECE/IT
Resume Tip
Resume tip

Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date15 Sep 2020
Coding problem0

This was an Aptitude/Technical test of 1 hour where there were 2 sections
1. Aptitude (Quantitative and Logical)
2. Technical (DS/Algo, and Programming Output Questions)
Timing: Morning
Environment: Online

02
Round
Easy
Online Coding Test
Duration90 minutes
Interview date16 Sep 2020
Coding problem3

Timing: Morning (10 AM)
Environment: Online (Proctored)
Coding Round (3 Questions)

1. Find Nth Prime
Moderate
15m average time
85% success
0/80
Asked in companies
OlaSiemensIndiaMart

You are given a number 'N'. Your task is to find Nth prime number.

A prime number is a number greater than 1 that is not a product of two smaller natu...

View more
Problem approach

Step 1  I opted for the Sieve of Eratosthenes approach.
Step 2  Store all prime numbers in a vector and return (n-1)th for Nth Prime Number.

Try solving now
2. Check whether second string can be formed from characters of first string
Easy
10m average time
90% success
0/40
Asked in companies
AmazonNagaaro

You are given two strings STR1 and STR2. You need to check whether STR2 can be formed from the characters of STR1. Both the strings can contain any characters.

For example:
View more
Problem approach

Step 1  The idea was to count frequencies of string 1 and deduct from frequencies of string 2 simultaneously.
Step 2  If frequency at any stage becomes negative, false should be returned.

Try solving now
3. Count derangements
Moderate
35m average time
60% success
0/80
Asked in companies
AmazonInfo Edge India (Naukri.com)Cisco

A Derangement is a permutation of ‘N’ elements, such that no element appears in its original position. For exam...

View more
Problem approach

Step 1  I followed the recursive approach initially, even though it passed all the cases.
Step 2  I still had time so changed it to DP, which reduced my time.

Try solving now
03
Round
Medium
Video Call
Duration40 minutes
Interview date1 Oct 2020
Coding problem3

Timing: 10:00 AM
Environment: Online (Webcam + Mic on)
The interviewer was friendly and to the point.

1. Detect and Remove Loop
Moderate
10m average time
90% success
0/80
Asked in companies
IBMDelhiveryAmerican Express

Given a singly linked list, you have to detect the loop and remove the loop from the linked list, if present. You have to make changes in the given linked list itself and return the updated li...

View more
Problem approach

Step 1: I went for the Hashing technique, which was more of a brute force approach.
Step 2: So, I went for a more optimized approach of Floyd’s Cycle-Finding Algorithm, which is 0(n) in Time and 0(1) in space. The interviewer was satisfied.

Try solving now
2. Spiral Order Traversal of a Binary Tree
Easy
20m average time
75% success
0/40
Asked in companies
SamsungPaytm (One97 Communications Limited)Tata Consultancy Services (TCS)

You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.

For example
For the given binary tree [1, 2,...
View more
Try solving now
3. Trapping Rainwater
Moderate
15m average time
80% success
0/80
Asked in companies
InfosysExpedia GroupTata Consultancy Services (TCS)

You have been given a long type array/list 'arr’ of size 'n’.


It represents an elevation map wherein 'arr[i]’ denotes the elevation ...

View more
Problem approach

Step 1  I preferred initially to traverse each array element and find the highest bars.
Step 2  To improve on the previous solution, instead of array traversal, I pre-computed the heights of the highest bars on left and right.

Try solving now
04
Round
Easy
HR Round
Duration20 minutes
Interview date1 Oct 2020
Coding problem3

Timing (In Evening)
Environment (Same as Technical Interview)

1. What are your Strengths and Weakness?
Problem approach

Tip 1: Be confident
Tip 2: Look at them with a straight back
Tip 3: Be honest and highlight your strengths.

2. Where do you see yourself in 5 years?
Problem approach

Tip 1 : Don't say things like the CEO of the company or where you're sitting.
Tip 2 : Try to read different answers and be confident.

3. Questions about the company.
Problem approach

Tip 1 : Before any interview have knowledge of what the company does.
Tip 2 : How it has performed over the years, what are its focus in business?

Start a Discussion
Similar interview experiences
company logo
Trainee Technology
3 rounds | 3 problems
Interviewed by Nagaaro
2643 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 1 problems
Interviewed by Nagaaro
401 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 4 problems
Interviewed by Nagaaro
296 views
0 comments
0 upvotes
company logo
Trainee Technology
3 rounds | 6 problems
Interviewed by Nagaaro
469 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Trainee Technology
2 rounds | 4 problems
Interviewed by Tata Consultancy Services (TCS)
793 views
0 comments
0 upvotes
company logo
Trainee Technology
2 rounds | 4 problems
Interviewed by HCL Technologies
2753 views
0 comments
0 upvotes