Nagarro Interview Questions, Process, and Tips for Freshers

3 coding problems was given

Q1. Oops regarding questions
Add your answer
Q2. Sql
Add your answer

Aptitude test having 70 Questions that need to solve in 60 min.

Q1. Advanced Java programming questions.
Add your answer
Q2. Output of java program
Ans. 
Cannot answer without knowing the java program
• Need to know the code to determine output

• Output can vary based on input and logic

• Can provide answer if given the program
Answered by AI
Add your answer

Q1. Java 8 feature & Spring boot
Add your answer
Q2. Spring Boot Configurations
Add your answer

There will be quant logical reasoning grammmer communication questions

In this round there wi be 3 coding ques to pass the test cases within 1 or 1.5 hrs of time

Q1. Then there will be any dsa ques Any of the theory like validtion verification models likes waterfall agule etc after that hr round
Add your answer

Q1. In this round abiut our company Related questions your interests ehat you did on your last birthday nd ll
Add your answer

Aptitude test for roughly around, 30-40 mins. Easy test.

Coding test on mettle. Good Data structure questions.

Q1. Basic Android questions like DI, MVVM, Clean architecture.
Add your answer
Q2. What is MVVM and design patterns
Ans. 
MVVM is a design pattern that separates the UI from the business logic, promoting code reusability and maintainability.
• MVVM stands for Model-View-ViewModel

• Model represents the data and business logic

• View is the UI components that the user interacts with

• ViewModel acts as a mediator between the Model and View, handling user inputs and updating the Model

• Design patterns are reusable solutions to common problems in software...read more
Answered by AI
Add your answer
Q3. Explain Clean Architecture
Ans. 
Clean Architecture is a software design approach that separates concerns and enforces a clear structure for code organization.
• Clear separation of concerns between different layers (e.g. presentation, domain, data)

• Dependency Rule: inner layers should not depend on outer layers

• Use of interfaces to define boundaries between layers

• Focus on testability and maintainability

• Examples: Hexagonal Architecture, Onion Architecture
Answered by AI
Add your answer
Q4. Explain solid principles
Ans. 
SOLID principles are a set of five design principles in object-oriented programming to make software designs more understandable, flexible, and maintainable.
• Single Responsibility Principle (SRP) - A class should have only one reason to change.

• Open/Closed Principle (OCP) - Software entities should be open for extension but closed for modification.

• Liskov Substitution Principle (LSP) - Objects of a superclass should be re...read more
Answered by AI
Add your answer
Q5. Intents in android
Ans. 
Intents in Android are messaging objects used to request an action from another app component.
• Intents are used to start activities, services, and broadcast receivers in Android.

• There are two types of intents: explicit intents and implicit intents.

• Explicit intents specify the component to start by name, while implicit intents specify the action to perform.

• Example: Intent intent = new Intent(this, SecondActivity.class);
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

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

Q1. 
Crazy Numbers Pattern Challenge
Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that:
• The first row contains 1 number.
• The second row contains 2 numbers.
• Th...read more
Ans. 
Arrange numbers in a sequence in 'N' rows with increasing order and repeating after 9.
• Iterate through each test case and for each row, print numbers in increasing order with a loop.

• Keep track of the current number to print and reset to 1 after reaching 9.

• Handle formatting to align numbers correctly in each row.

• Ensure to print the correct number of rows based on the input 'N'.
Answered by AI
View 1 more answer
Q2. 
Count Pairs with Difference K
Given an array of integers and an integer K, determine and print the count of all pairs in the array that have an absolute difference of K.
Input:
The first line of the inp...read more
Ans. 
Count pairs in an array with a specific absolute difference.
• Iterate through the array and for each element, check if the element + K or element - K exists in the array.

• Use a hash set to store elements for constant time lookups.

• Keep track of the count of valid pairs found.
Answered by AI
Add your answer
Q3. 
Fibonacci Membership Check
Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.
Fibonacci Series...read more
Ans. 
Check if a given integer is a member of the Fibonacci series.
• Implement a function to check if the given number is a perfect square.

• Check if 5*N^2 + 4 or 5*N^2 - 4 is a perfect square to determine Fibonacci membership.

• Return true if the number is a perfect square of 5*N^2 + 4 or 5*N^2 - 4, otherwise false.
Answered by AI
Add your answer
Q4. 
Ninja and the New Year Guests Problem
Ninja has organized a new year party and wants to verify if the guests are programmers by challenging them with a coding task. As an invited programmer, you're tasked...read more
Ans. 
Compute the number of valid permutations of integers from 0 to N-1 such that at least K positions satisfy ARR[I] = I.
• Use dynamic programming to solve the problem efficiently.

• Consider the cases where K is equal to N or N-1 separately.

• Modulo the result by 10^9 + 7 to avoid overflow issues.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

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

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if given strings containing only parentheses are balanced or not.
• Iterate through each character in the string and use a stack to keep track of opening parentheses.

• If a closing parenthesis is encountered, check if the stack is empty or if the top of the stack matches the corresponding opening parenthesis.

• If all parentheses are balanced, the stack should be empty at the end.

• Return 'Balanced' if t...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy