Status: Student
Location: New Delhi, India
Date: July, 2018

The process consisted of two phases:- 1)Coding Round, 2)Three Technical Interviews.

Day 1: Coding Round

4 coding Questions on Hackerrank platform. The questions were as follows:-

1. Postfix to Prefix
2. Dynammic programming - coin change problem
3. Tree traversal
4. Graph simple graph traversal

I solved 3 out of the 4 questions, which were enough to qualify for the next day's interviews.

Day 2: Technical Interviews

Round 1

They extensicely checked projects on the resume. The asked about my interests and lastest trends in the IT industry. I worked on an web development project a year back, the interviewer asked few questions about how I went through the project. I felt they wanted to validate my work.

Basic coding question to be solved on paper with pen:-

Q) "Remove second occurrence of alphabets in a sentence"
Example: Input : Game of Thrones Output : Game of Thrns

Solution: I solved it using hashing and the interviewer seemed satisfied with the approach.

Round 2

In this round they asked only coding questions:

Q1)"Sorting Algorithm"
solution: Solved using Merge Sort. Was asked to improve Time Complexity and Space Complexity.

Q2)"DP->Longest Palindromic Subsequence"
solution: Solved using tabular method which was correct.

Q3)"Tree -> convert a graph into a tree without losing its integrity
solution: Solved using modification of Kruskal’s Minimum Spanning Tree .

Note: All questions were ask to explain while being writting/coded on paper

Round 3

Mostly HR questions (Hobbies, interests, interpersonal relationship scenarios etc)
They also asked one simple coding question OOPS related:

Q) "Write a class for an Employee given certain public/private attributes"
solution: explained certain variables and methods that need to be encapsulated, accordingly wrote the necessary classes.