Innovaccer Interview Questions, Process, and Tips

Round duration - 7 days
Round difficulty - Easy

Web Development, Databases

Round duration - 60 minutes
Round difficulty - Medium

This was the final round and was a telephonic interview.

Q1. 
Implementation of HashMap with Constant Time Operations
Design a data structure that effectively stores a key-value mapping and performs specific operations in constant time.
Explanation:
Your data stru...read more
Ans. 
Design a data structure implementing HashMap with constant time operations like INSERT, DELETE, SEARCH, GET, GET_SIZE, IS_EMPTY.
• Use a combination of hash table and linked list to achieve constant time operations.

• For INSERT and UPDATE, hash the key to get the index and store the (key, value) pair in the linked list at that index.

• For DELETE, SEARCH, and GET, hash the key to find the index, then traverse the linked list a...read more
Answered by AI
Add your answer
Q2. 
Isomorphic Trees Problem Statement
You are provided with two arbitrary binary trees. Determine if both trees are isomorphic.
Explanation:
Two binary trees are considered isomorphic if one tree can be tr...read more
Ans. 
Determine if two binary trees are isomorphic by swapping left and right subtrees.
• Check if both trees are empty, return 'yes' if they are

• Perform the swap operation on any node at any level

• Compare the structures of both trees after swapping to determine isomorphism
Answered by AI
Add your answer