Ixigo | SDE-1 | GuruGram | November 2021 | Offer

ixigo logo
ixigo
sde-1gurugram0.33 yearsOffer
February 9, 202228 reads

Summary

I interviewed for an SDE-1 position at Ixigo in GuruGram in November 2021 and was delighted to receive an offer on the same day. The interview process comprised three rounds, covering my technical knowledge in Java, OOPS, data structures, and algorithms, along with aspects of system design and behavioral questions.

Full Experience

My interview journey at Ixigo for the SDE-1 role began without an Online Assessment; I went straight into the interview rounds.

Round 1: Technical Interview (60 Min)

This round started with a basic introduction, followed by questions on Java and Spring IOC. The discussion quickly deepened into how Spring manages IOC properties, which eventually led to a discussion around Kahn's Algorithm and Topological Sort on Directed Graphs. I was also asked specific problems like Cycle Detection in Directed Graphs, and to explain Topological Sort using both BFS (Kahn's Algorithm) and DFS. Additionally, I was presented with the LeetCode problem 'Lowest Common Ancestor of a Binary Tree'.

Round 2: Technical Interview (60 Min)

This round was with the Reporting Manager and VP of Engineering. We discussed Java and OOPS concepts, followed by an in-depth discussion on Spring. I had to admit I wasn't aware of some of the very in-depth functionalities discussed. A key coding question I faced was to remove all redundant parentheses from an expression, for example, transforming (a+((b)+c)) into (a+(b+c)), while also handling edge cases. I explained a solution using two stacks, which seemed to satisfy the interviewer. Towards the last 10 minutes, the VP joined and asked me some behavioral questions.

Round 3: Technical/Behavioral Interview (30 Min)

This final round was with the CTO. It primarily focused on behavioral questions. I was asked to explain the working of my favorite app and its features. I chose Telegram, and the conversation became quite detailed, delving into features I might have included or removed. Finally, I was given some puzzles, which turned out to be basic math questions similar to what we solved in elementary school.

Verdict

I received confirmation from the recruiter about my selection on the same day of the interviews.

Interview Questions (7)

Q1
Spring IOC Management
Other

I was asked to explain how Spring manages its Inversion of Control (IOC) property. The discussion around this topic eventually tied into concepts like Kahn's Algorithm and Topological Sort on Directed Graphs.

Q2
Cycle Detection in Directed Graph
Data Structures & Algorithms

I was given a directed graph and asked to detect cycles within it.

Q3
Topological Sort (BFS/Kahn's Algorithm)
Data Structures & Algorithms

I had to implement or explain Topological Sort using a Breadth-First Search approach, specifically Kahn's Algorithm.

Q4
Topological Sort (DFS Discussion)
Data Structures & Algorithms

There was a conceptual discussion about performing Topological Sort using a Depth-First Search approach.

Q5
Lowest Common Ancestor of a Binary Tree
Data Structures & AlgorithmsMedium

I was presented with the problem: 'Lowest Common Ancestor of a Binary Tree'.

Q6
Remove Redundant Parentheses
Data Structures & Algorithms

Given an expression like (a+((b)+c)), I needed to remove all redundant parentheses to return the simplified expression, for example, (a+(b+c)). I also had to handle various edge cases.

Q7
Design Discussion: Favorite App Features
System Design

I was asked to explain the working of my favorite app and discuss its key features. I chose Telegram, leading to a deep discussion about design choices, features that could be improved, added, or removed.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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