20 questions · from 3 interviews

Nagarro interview questions

Every question candidates reported from their Nagarro interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Nagarro coding and DSA questions

  1. 01

    Stack vs. Queue

    Differentiate between a stack and a queue data structure.

    From got reject in nagarro

  2. 02

    Graph vs. Tree

    Explain the differences between a graph and a tree data structure.

    From got reject in nagarro

  3. 03

    Balanced Binary Tree vs. Binary Search Tree

    Compare and contrast a balanced binary tree and a binary search tree.

    From got reject in nagarro

  4. 04

    Implement Stack using Queues

    Describe or implement how to create a stack data structure using two queues.

    Medium · From got reject in nagarro

  5. 05

    Reverse a Linked List

    Describe or implement an algorithm to reverse a singly linked list.

    Easy · From got reject in nagarro

  6. 06

    Frog Jump Puzzle

    The interviewer presented a 'frog jump puzzle'.

    Medium · From got reject in nagarro

  7. 07

    BFS vs. DFS

    Differentiate between Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms.

    From got reject in nagarro

  8. 08

    Examples of BFS and DFS

    Provide examples of scenarios or problems where BFS and DFS would be applied.

    From got reject in nagarro

  9. 09

    Chocolate Arrangement

    Arrange chocolates in a way to avoid specific constraints (e.g., no two same adjacent types, maximize variation).

    Medium · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

  10. 10

    Find Maximum Length Subarray with Bitwise OR = 1

    Given a binary array, find the longest subarray where the bitwise OR of all elements is exactly 1.

    Medium · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

  11. 11

    Find Numbers with Exactly 3 Set Bits < N

    Given an integer N, count how many numbers less than N have exactly 3 set bits in their binary form.

    Medium · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

  12. 12

    DP Jumping Problem (Jump to i+1 or i+3)

    From index 0, you can jump to i+1 or i+3 to reach the end. Each index has a score. Maximize the total score.

    Medium · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

Nagarro system design questions

  1. 01

    Scale API handling 1000k+ requests/sec

    Your API is handling 1000k+ requests per second and performance is degrading. How would you scale and optimize it?

    From Recently Appeared for Nagarro Interview sharing my experience

  2. 02

    Ensure idempotency for payment API receiving duplicate requests

    You are building a payment API and receiving duplicate requests. How will you ensure idempotency?

    From Recently Appeared for Nagarro Interview sharing my experience

  3. 03

    Maintain data consistency when order creation fails after money deduction

    Money is deducted from the account but order creation fails. How will you ensure data consistency?

    From Recently Appeared for Nagarro Interview sharing my experience

Nagarro other questions

  1. 01

    Polymorphism Concept and Implementation

    Explain polymorphism and describe various ways to achieve it.

    From got reject in nagarro

  2. 02

    SQL Joins and Types

    Explain SQL joins, list different types of joins, and compare inner join with outer join (potentially referring to full outer or right/left outer).

    From got reject in nagarro

  3. 03

    ACID Properties

    Explain the ACID properties in the context of database transactions.

    From got reject in nagarro

  4. 04

    Basic SELECT Query

    Simple query using SELECT, WHERE, ORDER BY on a single table.

    Easy · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

  5. 05

    LEFT JOIN Query

    Join two tables and return unmatched records from the left table. Tip: Be comfortable using LEFT JOIN and handling NULL values in filters.

    Medium · From Nagarro Online Assessment – Java Dev (3-5 Years) | DSA + SQL + Java + Spring Boot | Mettl

Nagarro interview questions FAQ

What questions are asked in Nagarro interviews?

Candidates reported 20 distinct questions across 3 Nagarro interviews. 12 coding and DSA questions, 3 system design questions, 5 other questions.

How difficult are Nagarro interview questions?

Of the questions candidates rated, 22% were easy, 78% medium and 0% hard.