Nvidia Software Engineer2 Interview Questions and Answers

4 questions in one and a half hour

Q1. Linked List questions, Python questions, questions on cloud technology
Add your answer

Q1. Many lambda functions were asked
Add your answer
Q2. One question on circular queue
Add your answer
Q3. Code to be written on notepad not on IDE
Ans. 
Writing code on notepad instead of an IDE
• Ensure proper indentation and formatting

• Use comments to explain code

• Compile and test code manually

• Save frequently to avoid losing work
Answered by AI
Add your answer

Q1. Golang Concurrency questions, binary tree question
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. Tell me about yourself.
Add your answer
Q4. Why are you looking for a change?
Add your answer
Q5. Where do you see yourself in 5 years?
Add your answer

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