Nvidia Game Developer Interview Questions and Answers

Q1. Java basic knowledge and deep knowledge
Add your answer
Q2. Java, theory, oops, dbms
Add your answer

Q1. Bfs tree traversal
Ans. 
BFS tree traversal visits nodes level by level starting from the root.
• Start at the root node and visit its children before moving on to the next level.

• Use a queue data structure to keep track of nodes to visit next.

• BFS is often used to find the shortest path in unweighted graphs.
Answered by AI
Add your answer
Q2. Resume and core
Add your answer

There were 2 DSA medium level questions

Q1. Leetcode medium problem on hashmap
Add your answer
Q2. Binary search tree plus heap question
Add your answer

Q1. Basic HR question on why you want to work at this company
Add your answer
Q2. Technical questions on OOPS and a problem on system design
Add your answer

40 MCQ's, 2 Coding question

Q1. Dijkastra's Algorithm
Ans. 
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.

• It works by maintaining a set of nodes whose shortest distance from the starting node is known.

• The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...read more
Answered by AI
Add your answer
Q2. Snake and Ladder
Add your answer

Two easy coding problems with few mcqs

Q1. Design google contacts
Ans. 
Google Contacts is a web-based address book application.
• Users can add, edit, and delete contacts

• Contacts can be organized into groups

• Users can import and export contacts

• Contacts can be searched and filtered

• Integration with other Google services like Gmail and Calendar
Answered by AI
Add your answer
Q2. Problems related to C
Add your answer

Round duration - 70 Minutes
Round difficulty - Medium

Interviewer was very nice and made me feel pretty comfortable. We talked about our hobbies for about 10mins and then he asked about my projects and which was my favourite of all. He then asked me a coding question. Which was like pretty easy and I gave him the optimized approach right away. He was satisfied with my approach and just moved on to the next part. He asked me some basic questions related to Operating Systems(related to deadlocks and semaphores). He even asked some basic questions related to OOPS. Then he gave me the next question. This was like a pretty new question for me and I took some time to understand the problem statement and then took some time to think about the logic. I was also sharing my approach with interviewer as well.I finally told him about my approach. He told me that my approach was fine but there also was some other approach but normally no-one would come up with that approach until they have previously solved the question.

Q1. Count elements in all subtrees
You are given an arbitrary tree consisting of 'N' nodes numbered from 0 to 'N' - 1. You need to find the total number of elements in all the subtrees of the g...read more
Ans. 
We need to find the number of nodes in subtree for each and every node in the tree.
Answered by CodingNinjas
View 1 more amswer

Round duration - 30 Minutes
Round difficulty - Easy

Interviewer seemed to be a senior manager.He just asked about me and started with the interview.Interviewer asked me to design a standard map(hash-map). I gave him my approach and he also asked me to devise a hash function for it. I also gave him a hash function and he seemed to be pretty satisfied.

Q1. System Design Question
Design a basic hash map.
Ans. 
Tip 1 : Get the requirements clear by asking questions
Tip 2 : Try sharing your approach with interviewer 
Tip 3 : Share your approach with the interviewer at each and every step.
Answered by CodingNinjas
Add your answer