got reject in nagarro
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.
Full Experience
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.
Interview Questions (11)
Polymorphism Concept and Implementation
Explain polymorphism and describe various ways to achieve it.
Stack vs. Queue
Differentiate between a stack and a queue data structure.
Graph vs. Tree
Explain the differences between a graph and a tree data structure.
Balanced Binary Tree vs. Binary Search Tree
Compare and contrast a balanced binary tree and a binary search tree.
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).
Implement Stack using Queues
Describe or implement how to create a stack data structure using two queues.
Reverse a Linked List
Describe or implement an algorithm to reverse a singly linked list.
Frog Jump Puzzle
The interviewer presented a 'frog jump puzzle'.
ACID Properties
Explain the ACID properties in the context of database transactions.
BFS vs. DFS
Differentiate between Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms.
Examples of BFS and DFS
Provide examples of scenarios or problems where BFS and DFS would be applied.