Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
NVIDIA interview experience Real time questions & tips from candidates to crack your interview
System Software Engineer-2
NVIDIA
upvote
share-icon
4 rounds | 5 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 3 months
Topics: Data structures, Linux kernel, Systems in depth, Dynamic Programming, Multi threaded systems, Locking and deadlock avoidance etc.
Tip
Tip

Tip 1 : Always be thorough with basic Data structures and algorithms like Linked list, stack, Queue, Tree, Graph. Algorithms like sorting, Searching, Tree traversals etc
Tip 2 : Try to dig deep around the past interview experiences pf other people on websites like glassdoor, GFG etc. Look for the type of questions they were asked and look for their insight as well so that you wouldn’t commit the same mistakes.
Tip 3 : Be confident though it is easier said than done. But treat every interview as two way street where interviewer is judging you and we as a candidate should also judge the interviewer because they can very well be your future teammates.

Application process
Where: Referral
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : I prefer describing my projects in depth
Tip 2 : Avoid putting any thing fake on the resume because your interviewer can be subject matter expert and wouldn’t buy the lie or will grill you for the same.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date4 Sep 2021
Coding problem2

Coding questions were of medium dificulty but there are various OS MCQs revolving around memory, Cache, Process management etc

1. MCQ Questions

OS MCQs revolving around memory, Cache, Process management etc. So be thorough with these concepts.

2. K - Sum Path In A Binary Tree
Moderate
35m average time
65% success
0/80
Asked in companies
AdobeJP MorganWalmart

You are given a binary tree in which each node contains an integer value and a number ‘K’. Your task is to print every path of the binary tree with the sum of nodes in the path as ‘K’.

Note:

View more
Problem approach

I was well aware of this problem. Tree Traversal and save paths in a vector with each recursion.

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date22 Sep 2021
Coding problem1
1. Implementation: HashMap
Easy
30m average time
90% success
0/40
Asked in companies
FlipkartSalesforceInnovaccer

Design a data structure that stores a mapping of a key to a given value and supports the following operations in constant time.

1. INSERT(key, value): I...
View more
Problem approach

I was thorough with pointers and buffers in C.
For hashmap. I used doubly linked list with Linux kernel list head

Try solving now
03
Round
Medium
Face to Face
Duration60 minutes
Interview date4 Oct 2021
Coding problem1
1. Operating System Questions

Virtual memory, Locking, mutex vs spinlocks, Interrupts, Softirqs etc

04
Round
Medium
Face to Face
Duration120 minutes
Interview date13 Oct 2021
Coding problem1

This was less on technical side and more on culture fit round

1. System Design Questions

Design a OS scheduler.

Join the Discussion
1 reply
profile
Harini |Level 2
3 months ago

what type of projects are preferred

 

0 upvotes
0 replies
Reply
Similar interview experiences
company logo
Product Engineer
4 rounds | 4 problems
Interviewed by Squadstack
2047 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by NVIDIA
1812 views
0 comments
0 upvotes
company logo
Product Engineer
8 rounds | 14 problems
Interviewed by Squadstack
983 views
0 comments
0 upvotes
company logo
Product Developer
3 rounds | 9 problems
Interviewed by Squadstack
756 views
0 comments
0 upvotes