Nvidia Software Developer Interview Questions and Answers for Freshers

Round duration - 60 Minutes
Round difficulty - Easy

It was in the morning. Because of covid test was from home. We had 50 MCQ and 1 coding question. The coding question was pretty easy. MCQ were mixed, we even had questions from machine learning.

Q1. 
Maximum Path Sum Between Two Leaves
Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.
...read more
Ans. 
Find the maximum path sum between two leaf nodes in a binary tree.
• Traverse the tree to find the maximum path sum between two leaf nodes

• Consider both cases where the path passes through the root and where it doesn't

• Keep track of the maximum sum while traversing the tree
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interview round. Questions were based on projects, database and one coding question

Q1. 
Longest Subarray Zero Sum Problem Statement
Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.
Input:
N (an integer, the length of the array)
arr (...read more
Ans. 
Find the length of the longest contiguous subarray that sums to zero in an array of integers.
• Use a hashmap to store the cumulative sum and its corresponding index.

• Iterate through the array, updating the sum and checking if the current sum exists in the hashmap.

• If the sum exists in the hashmap, update the maximum length of subarray with sum zero.

• Return the maximum length of subarray with sum zero.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Managerial round. Was asked questions on projects and management

Round duration - 10 minutes
Round difficulty - Easy

HR just asked about basic stuffs and all. Nothing technical

Q1. Check if the linked list is palindrome or not
Ans. 
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
• Traverse the linked list to find the middle node

• Reverse the second half of the linked list

• Compare the first half with the reversed second half to check for palindrome
Answered by AI
Add your answer
Q2. C string questions
Add your answer

Q1. Operating systems questions
Add your answer
Q2. Linked list and system design question
Add your answer

Q1. Linked list and double pointers
Add your answer

Questions regarding JS concepts. JS and React specific rounds, closures, Promises, etc

Q1. Solve a js problem to traverse a directory. Simple question
Add your answer

Q1. Managerial round to understand roles and responsibilities in previous orgs.
Add your answer