Nvidia came on campus.

They allowed candidates having >70%. There were 150 candidates.

A test was conducted which was not easy. The four sections were:

• Quantitative Aptitude
• OS
• DS
• C language

Fourteen candidates were shortlisted for interviews and asked to visit the office the next day.

There were two tech interviews followed by an HR interview.

1. Tree problem: Maximize the sum of a set of elements from the tree such that if a node exists in the set, then its parent and children must not exist in the set.

2. Tell me some example of a problem statement you have liked so far. How did you solve it?

3. Bit manipulation question: Swap the lower 4 bits with the higher 4 bits per byte of an integer.

4. Stack using a linked list.

5. OS-related questions: Basic. Know the names of chapters from a textbook and the general idea of each chapter's topic and definition. It's not mandatory to know details, or you can even say you don't know.

6. Why Nvidia?