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

SDE - 2

NVIDIA
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Journey
Preparing for my Nvidia interview wasn't easy. I had been at my current job for two years and hadn't practiced data structures and algorithms (DSA) much. However, I didn't want to miss the Nvidia opportunity, so I made a list of important DSA questions and practiced them diligently for a week. Although it was challenging after such a long break, I knew it was worth it. This journey taught me the importance of planning and staying committed to your goals.
Application story
A recruiter contacted me via LinkedIn, and I shared my resume with them. We then had a short phone call during which they asked me some basic questions, such as the type of work I'm doing in my current company, my preferred job location, the type of work I enjoy, and the specific projects I'm currently involved in. It was a casual conversation, primarily aimed at gathering basic information to determine if I am a good fit for the role.
Why selected/rejected for the role?
Facing rejection for the role was tough. Despite my efforts, I didn't secure it. However, I see it as a learning experience—a chance to improve and grow. I'll reflect on the interview, identify areas for development, and keep pushing forward. Rejection doesn't define me; it's a step towards success.
Preparation
Duration: 1 month
Topics: I focused on top DSA topics namely Trees, Graphs, DP and Binary Search.
Tip
Tip

Tip 1: Practice writing code without an IDE. It helps in better-memorizing syntax. 

Tip 2: Merely finding an answer to a question isn't always enough; strive for optimized approaches. 

Tip 3: Lastly, actual coding practice is crucial for improvement."

 

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

Tip 1: Keep it to one page. 

Tip 2: Try to organize the sections in the resume. For example, highlight your industry experience if you've been working for the past 2 years, followed by your college degrees and projects. Keep only what is relevant in the resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration75 minutes
Interview date20 Feb 2024
Coding problem1

It was an online round with a mix of questions. It had questions from topics DSA, OS, CN, Mental Ability, c/c++, and Python.

1. 2D matrix of integers

Moderate
30m average time
65% success
0/80
Asked in companies
AppleGrowwFlipkart

Given a 2d matrix of integers. The matrix contains only 1s, 2s and 0s. Each 2 represents a rotten tomato. Each rotten tomato can rot the next fresh tomato adjacent to it. 1s represents the fresh tomatoes and 0 means empty. Find out the minimum time that will be taken so all the tomatoes get rotten. Return -1 if this is not possible.

Problem approach

This question is very similar to the basic "Rotten Oranges: question. 
I applied BFS to resolve this question.

Try solving now
02
Round
Medium
Video Call
Duration90 minutes
Interview date26 Feb 2024
Coding problem2

My interview round was scheduled for around noon. I was interviewed by two individuals who were very calm and casual. Their friendly nature made me feel comfortable, and I didn't feel nervous. They gave me ample time to solve each problem.

1. Puzzle

You have got someone working for you each day and you repay them with a gold bar each day. The gold bar is segmented into 7 pieces. You must give the worker a piece of gold each day after the work is completed. What is the number of cuts that you can make to the gold bar to allow you to achieve this?

Problem approach

Tip 1: Try to first understand what the question means. 
Tip 2: Think of ways not brute force but something out of the box that might help you achieve this task. 
 

2. Next Permutation

Moderate
15m average time
85% success
0/80
Asked in companies
UberAdobeCurefit

We are given a number and we need to return the next greater number possible from that number after reshuffling the sequence of numbers. eg. If the number is 102, what are all greater numbers possible here., 201, 210, 120. But the answer that we will choose will be 120 because it is the next greater number after 102.

Problem approach

This is a medium-type question. First I was confused about the understanding of the question. Then after trying out the few questions and examples as stated by interviewers, I understood I needed to do some reshuffling of the number such that among all the greater numbers I got I needed to get the smallest among them. 

Then after trying out a few examples, I found that If I try to p...

View more
Try solving now
Join the Discussion
1 reply
profile
22 days ago

Can you explain how the BFS algorithm is used to solve the problem of finding the minimum time for all tomatoes to get rotten? merge fruit ask.

0 upvotes
0 replies
Reply
Similar interview experiences
System Software Engineer-2
4 rounds | 5 problems
Interviewed by NVIDIA
4542 views
1 comments
0 upvotes
Product Engineer
4 rounds | 4 problems
Interviewed by Squadstack
2617 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by NVIDIA
1997 views
0 comments
0 upvotes
Product Engineer
8 rounds | 14 problems
Interviewed by Squadstack
1351 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
3 rounds | 4 problems
Interviewed by HashedIn
7552 views
0 comments
0 upvotes
company logo
SDE - 2
3 rounds | 4 problems
Interviewed by Arcesium
962 views
0 comments
0 upvotes
company logo
SDE - 2
3 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
1103 views
0 comments
0 upvotes