I applied through university. The process took 2 days. I interviewed at InsuranceDekho (Patiala) in Nov 2023
Interview
Hand written paper as Assessment -
Two coding questions
One was add two numbers represented as linked list.
Second was implementing LFU
Four rounds were there-
2 tech
1 managerial cum tech
1 hr
Some candidates were asked for attending all some have been directed directly to hr from tech rounds
Interview questions [1]
Question 1
Basic bineary search question.
Serialize and deserialise a binary tree.
Distribute candies with ratings.
Count inversions.
I applied through university. The process took 1 day. I interviewed at InsuranceDekho (Dehradun) in Jan 2024
Interview
Written, 1st round tech -easy
2nd round - dsa, sql questions easy to medium
3rd round : HR easy
Over all average
They demanded HTML,CSS, JAVASCRIPT but didn't ask anything from it
Interview questions [1]
Question 1
Written, 1st round tech -easy
2nd round - dsa, sql questions easy to medium
3rd round : HR easy
Over all average
They demanded HTML,CSS, JAVASCRIPT but didn't ask anything from it
I applied through university. The process took 2 days. I interviewed at InsuranceDekho (Gurgaon, Haryana) in Nov 2023
Interview
1. Coding Assessment :
Pen Paper Test
Duration: 45 minutes
Two leetcode medium DSA questions
2. Technical Interview 1:
Interviewer: (Team Lead with 10+yr experience)
(Cross questioned each and every unique word of my resume )
Friendly , Supportive, always use to give hints and he even discussed his approach to Improve/optimise my code
Always asked to write 2-3 Approaches with fully functional Code
Pen Paper Based
Duration: 90 min
Started with introductions followed by Data Structure and Algorithm (DSA) questions.
3. Technical Interview 2:
Interviewer : (Senior Team Manager 7+ Yr experience)
Friendly Nature
Pen Paper Based
Duration: 30 min
Started with Introduction , Hackathons , AI /ML Projects Discussion
Interview questions [1]
Question 1
- Delete given node in LinkedList
- Implement insert() delete() find() getRandom() in O(1)
- Clone a Binary tree with Random Pointer
- Design a DataStructure with Operations Push() Pop() Peak() PopMax() All operations must be less than O(n)
