GeeksforGeeks Question · Jul 2025 · Los Angeles

Nagarro Interview Experience | Set 5 (Pool Campus Drive)

SWE Phone Screen Easy

Question Details

Nagarro Software Pvt. Ltd. came for pool campus drive. There were two rounds. First round had two sections technical (20 Minute) and aptitude (40 Minute) of one hour.In T...

Full Details

Nagarro Software Pvt. Ltd. came for pool campus drive. There were two rounds. First round had two sections technical (20 Minute) and aptitude (40 Minute) of one hour. In Technical Section we have 20 single choice objective programming question from Basics of C Programming Language. Questions are quite easy. Some of them needs to select correct output of given program and some need to select correct program for given output in question. In aptitude section we have 40 single choice questions. Questions are typical from Math and Logical Reasoning. Second round had three subjective Programming questions. Q1. Write a Program to print the given matrix in wave like form.

Input Matrix: - 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Output :- 0 5 10 15 16 11 6 1 2 7 12 17 18 13 8 3 4 9 14 19 Q2. Write a Function to check if the given string contains the given number of unique characters (You should ignore case of character so ‘R’ & ‘r’ should be counted as same character.).

Input :- String : “NagarroisBestSoftwareCompany”. N = 17 Output :- True or False Q3. Write a Function to find the Increasing Subsequence whose sum is highest in which each number is greater than previous by one in the given array. If the difference is less than or greater than one then it is not considered as subsequence. Print the subsequence array and sum of the subsequence array.

Time complexity of program must be O(n).

Input array :- 1 , 2 , 3 , 4 , 5 , 3 , 4 , 5 , 6 , 7 , 9 , 10 , 11 , 12 , 8 , 9 , 10 , 21 , 35 , 36 , 37 , 22 Output :- Longest Subsequence : 35,36,37 Sum = 108 I think result is not declared yet or I didn’t clear because I didn’t get any mail from them till date. All Practice Problems for Nagarro !

Free preview — 6 questions shown. Unlock all Nagarro questions →

About This Question

This is a reported interview question from a nagarro interview for a swe role during the phone screen round reported in 2025.

It covers the following topics: Strings, Dynamic Programming, Sql, Arrays, Matrix .

Difficulty rating: Easy

About Nagarro Interview Reports

This question was reported by a candidate who interviewed at Nagarro. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.

Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Nagarro are the higher-signal extractions to take from this report.

For broader preparation context, the Nagarro interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.

How To Practice This Type of Question

Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.

Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Nagarro reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Nagarro Round

Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.

The single most predictive failure mode in Nagarro reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.