Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Nagaaro interview experience Real time questions & tips from candidates to crack your interview

Software Developer

Nagaaro
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structures, OOPS, Python, Full stack Web development, System Design, Algorithms.
Tip
Tip

Tip 1 : Focus majorly on Data Structures and algorithms
Tip 2 : Master on One Programming Fundamentals
Tip 3 : Build one live Project on any tech stack.

Application process
Where: Campus
Eligibility: NO
Resume Tip
Resume tip

Tip 1 : Be concise and Confident what you have written in your resume.
Tip 2 : Make sure to mention any coding Profile which u practice on and one live project.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date20 Jan 2022
Coding problem4

First round has 4 coding Questions in which i have solved 3 complete and 1 partial.

1. Ninja And The New Year Guests

Moderate
30m average time
60% success
0/80
Asked in companies
Red HatAccentureCapegemini Consulting India Private Limited

Ninja has organized the new year party and invited all the programmers for it, as being the programmer also has been invited by Ninja.

To detect whether the guest is a programmer or not, Ninja has set some tasks for them, such that only programmers can code them.

You have also been asked to solve and code the following task to verify your identity.

Given two integers, 'N' and 'K' find the number of permutation arrays of 'N' integers from 0 to 'N' - 1 satisfying the below condition.

There should be at least 'K' positions in the array such that 'ARR[I] = I' ( 0 <= I < N ) satisfies.

You are required to output the answer modulo 10^9 +7.

EXAMPLE:
Input: 'N' = 4 'K' = 3 
Output: 1

There is only one permutation [0, 1, 2, 3] such that a number of elements with 'ARR[I] = I' is 'K' = 3.
Try solving now

2. Fibonacci Member

Easy
0/40
Asked in companies
SamsungMicrosoftAmazon

Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.


Try solving now

3. Pairs with difference K

Moderate
0/80
Asked in companies
AccentureGoldman SachsOracle

You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.

Note: Take absolute difference between the elements of the array.

Try solving now

4. Crazy Numbers

Easy
10m average time
90% success
0/40
Asked in companies
HCL TechnologiesKellton Tech Solutions LimitedNagaaro

Ninja loves playing with numbers. So one day, he wants to arrange a few numbers in the ‘N’ number of rows. The first row contains 1 number, the second row has two numbers, the third row has 3 digits, and so on.

Ninja starts placing numbers in increasing order, with absolute difference 1, starting from 1 and continuing till he encounters 9, and then he again restarts from 1.

You are given an integer ‘N’ denoting the given number of rows. Can you print the pattern that Ninja wants to create?

Pattern for N = 4:

   1
  23
 456
7891
Try solving now
02
Round
Easy
Video Call
Duration20 minutes
Interview date24 Apr 2022
Coding problem2

Every single question were based on the concept of data structure.
I have to answer my approach for solving a particular real life Problem.

1. Valid Parentheses

Easy
10m average time
80% success
0/40
Asked in companies
OracleSwiggyAmerican Express

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .


Return true if the given string 'S' is balanced, else return false.


For example:
'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach

Declare a character stack S.
Now traverse the expression string exp. 
If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
After complete traversal, if there is some starting bracket left in stack then “not balanced”.

Try solving now

2. Aptitude Question

Find the angle between the minute and The hour clock
if its 4:10

03
Round
Easy
HR Round
Duration15 minutes
Interview date25 May 2022
Coding problem1

1. Basic HR Questions

Why do u want to join Nagarro
Explain About Yourself.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

When does a stack underflow occur?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
Software Developer
3 rounds | 4 problems
Interviewed by Nagaaro
1108 views
0 comments
0 upvotes
company logo
Software Developer
4 rounds | 5 problems
Interviewed by Nagaaro
863 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 5 problems
Interviewed by Nagaaro
1130 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 9 problems
Interviewed by Nagaaro
585 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
3082 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
1824 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 8 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
0 comments
0 upvotes