got reject in nagarro

Result
Rejected
Posted
16 Sept 2025
318 reads

Summary

I recently interviewed at Nagarro for about 20 minutes, covering a range of technical topics. Despite correctly answering most rapid-fire questions and receiving positive feedback from the interviewer, I was ultimately rejected from the position.

How it went

I had a rapid-fire interview round at Nagarro that lasted approximately 20 minutes. The questions spanned various technical areas, including core programming concepts like polymorphism, data structures (stacks, queues, graphs, trees, linked lists), database concepts (joins, ACID properties), and algorithms (BFS, DFS, 'implement stack using queue', 'reverse LL', 'frog jump puzzle'). While I felt confident in most of my answers, I admit to mixing up balanced binary trees with complete binary trees and struggling with a specific part of the joins question. Throughout the interview, I had the impression the interviewer wasn't fully attentive, as I frequently had to confirm his presence. Despite this, he provided positive feedback, stating the interview was good. However, two days later, I received an email from HR informing me that I had not cleared the round, which came as a surprise given the initial feedback.

Questions asked (11)

  1. 01

    Polymorphism Concept and Implementation

    Other

    Explain polymorphism and describe various ways to achieve it.

  2. 02

    Stack vs. Queue

    Data Structures & Algorithms

    Differentiate between a stack and a queue data structure.

  3. 03

    Graph vs. Tree

    Data Structures & Algorithms

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

  4. 04

    Balanced Binary Tree vs. Binary Search Tree

    Data Structures & Algorithms

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

  5. 05

    SQL Joins and Types

    Other

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

  6. 06

    Implement Stack using Queues

    Data Structures & Algorithms · Medium

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

  7. 07

    Reverse a Linked List

    Data Structures & Algorithms · Easy

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

  8. 08

    Frog Jump Puzzle

    Data Structures & Algorithms · Medium

    The interviewer presented a 'frog jump puzzle'.

  9. 09

    ACID Properties

    Other

    Explain the ACID properties in the context of database transactions.

  10. 10

    BFS vs. DFS

    Data Structures & Algorithms

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

  11. 11

    Examples of BFS and DFS

    Data Structures & Algorithms

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

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Nagarro recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!