First round comprised of two problems, which they asked me to explain the solution for them, no coding only explain solution,
Interviewer was polite and helpful. The questions were medium to easy.
1️⃣ Symmetric (Mirror) Binary Tree
Problem Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Key Concepts
DFS / BFS
Mirror comparison
Tree recursion
Queue-based traversal
2️⃣ Count Subarrays With All Distinct Elements
Problem Given an array, count the number of subarrays whose number of distinct elements is equal to the total number of unique elements in the entire array.
Key Concepts
Sliding Window
Frequency map
Two pointers
Exactly K distinct elements
The following metrics were computed from 2 interview experiences for the Innovaccer SDE-2 Backend role in India.
Innovaccer's interview process for their SDE-2 Backend roles in India is fairly selective, failing a large portion of engineers who go through it.
Candidates reported having very good feelings for Innovaccer's SDE-2 Backend interview process in India.