Round 1 - Nvidia
Questions:
- Getting to know each other round with the Hiring Manager (HM).
- Program to print both the left view and right view of a BTree in a single API.
- Questions related to designing a Parking Lot, polymorphism, and virtual functions.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2 - Nvidia
Questions:
- Program to reverse the Linked List in group of k.
- Program to find minimum number of turns required to reach one node from another.
Candidate's Approach
- For the first question, the candidate was able to write the solution but did not get the expected output.
- For the second question, the candidate mentioned that the logic is based on Lowest Common Ancestor (LCA) but struggled to articulate the entire logic.
Interviewer's Feedback
No feedback provided.
Round 1 - Siemens EDA
Questions:
- Introduction round.
- Program to write a custom function to implement vector.
- Questions based on pointer to a pointer.
- Write a custom function for Shared Pointer.
- Minimum Number of Cameras Required in a Binary Tree.
- Find an element in a rotated array.
Candidate's Approach
- The candidate was able to write the program for the vector implementation but struggled with the shared pointer and the logic for operator overloading.
- For the binary tree question, the candidate was on the right track but got distracted by the interviewer's hints.
Interviewer's Feedback
No feedback provided.
Round 1 - Avalara
Questions:
- Simple greedy-based approach question.
- Questions about pointers, memory management, and SQL queries.
- STAR-based questions in the HM round.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 1 - Siemens EDA (Second Attempt)
Questions:
- Find Number of Pairs whose sum is a multiple of K.
- Write custom Atoi function.
- Questions on polymorphism.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2 - Siemens EDA
Questions:
- Satisfiability of Equality Equations.
Candidate's Approach
- The candidate used the Union Find algorithm but was informed that the solution was overly complicated and could have been simpler.
Interviewer's Feedback
No feedback provided.