Nagarro Associate Software Engineer Interview Questions, Process, and Tips

Round duration - 90 Minutes
Round difficulty - Easy

Q1. 
N-th Term Of Geometric Progression
Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.
Explanation:
The general form of a GP se...read more
Ans. 
Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.
• Iterate through each test case and apply the formula A * R^(N-1) to find the N-th term

• Use modular arithmetic to handle large calculated terms by returning the result modulo 10^9 + 7
Answered by AI
Add your answer
Q2. 
Remove String from Linked List Problem
You are provided with a singly linked list where each node contains a single character, along with a string 'STR'. Your task is to remove all occurrences of the stri...read more
Ans. 
Remove all occurrences of a given string from a singly linked list by starting from the end of the list.
• Traverse the linked list from the end to the beginning to efficiently remove the string occurrences.

• Check for the string 'STR' in each node and remove it if found.

• Continue checking for new occurrences of 'STR' after removal to ensure all instances are removed.

• Return the head of the modified linked list after processi
Answered by AI
Add your answer
Q3. 
Longest Increasing Subsequence Problem Statement
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...read more
Ans. 
Find the length of the longest strictly increasing subsequence in an array of integers.
• Use dynamic programming to keep track of the length of the longest increasing subsequence ending at each element.

• Iterate through the array and update the length of the longest increasing subsequence for each element.

• Return the maximum length found in the dynamic programming array as the result.
Answered by AI
Add your answer

Q1. Tell me about yourself.
Add your answer