Problem database last updated: June 20, 2025
9 problems · 5 Easy, 3 Medium, 1 Hard · Ranked #156 of 458
5 Easy
56% · avg 23%
3 Medium
33% · avg 59%
1 Hard
11% · avg 18%
Based on 9 reported problems, Nagarro interviews are in line with industry averages - 11% Hard vs 18% overall.
Compared to the industry average, Nagarro puts unusual emphasis on sliding-window (22.2% of problems, 4.7x the industry average), hash-table (55.6% of problems, 2.5x the industry average), string (44.4% of problems, 1.6x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are hash-table (55.6%), string (44.4%), array (44.4%), sliding-window (22.2%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Count Number of Ways to Place Houses There is a street with n 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can... | Medium | Very Likely | dynamic-programming | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc... | Hard | Likely | hash-tablestringsliding-window | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Remove Duplicates from Sorted Array Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o... | Easy | Likely | arraytwo-pointers | Solve |
Contains Duplicate Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. | Easy | Likely | arrayhash-tablesorting | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Subarray Sum Equals K Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k. | Medium | Likely | arrayhash-tableprefix-sum | Solve |
Valid Anagram Given two strings s and t, return true if t is an anagram of s, and false otherwise. | Easy | Likely | hash-tablestringsorting | Solve |
Count Number of Ways to Place Houses
SolveThere is a street with n 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can...
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Minimum Window Substring
SolveGiven two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc...
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Remove Duplicates from Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o...
Contains Duplicate
SolveGiven an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Subarray Sum Equals K
SolveGiven an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
Valid Anagram
SolveGiven two strings s and t, return true if t is an anagram of s, and false otherwise.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Nagarro interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Nagarro interviews focus heavily on hash-table, string, array problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Nagarro interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Nagarro has been reported to ask 9 distinct coding problems. The most common topics are hash-table, string, array. 5 are Easy difficulty, 3 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 9 reported problems, Nagarro interviews are in line with industry averages - 11% Hard vs 18% overall. 33% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: hash-table, string, array. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Nagarro coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Nagarro interview with AIarrow_forward
