Nvidia - SDE Intern

2
Rounds
0
Min Read
Medium
Difficulty
✓ Selected
Status
Internship
September 14, 2025
Not Disclosed
Interviewed: March 1, 2024
Technologies:
C++Data Structures & AlgorithmsDynamic ProgrammingTrieGraphs

Interview Process

1

Online Assessment (OA)

February 15, 2024

I applied to Nvidia through on-campus recruitment in February 2024. The first round was an online assessment consisting of 2 CP+DSA questions and aptitude-based questions. The problems were of medium to hard level, testing both problem-solving skills and knowledge of data structures.

I completed the test within the allotted time, and results were received within 2–3 days. Soon after, I received an acknowledgment email confirming that I had qualified for the interview rounds.

2

First Technical Round

March 1, 2024

The first technical interview was an offline session. Overall, the experience was nice but slightly tougher. Both interviewers were great, helpful, and very supportive, which made the environment comfortable for discussion.

Question 1: Trie Problem

The first question was based on Trie, similar to the LeetCode Hard problem: Delete Duplicate Folders in System

I first asked a few questions regarding edge cases, and then explained my approach, which the interviewer was satisfied with.

I implemented the solution in a few minutes, but while running the code, we found some errors. After a few dry runs and discussion, I identified the bug and updated the code. It then worked correctly for the given inputs.

The interviewer then asked about different test cases since I had initially coded for specific cases only. I explained my approach for handling these follow-up cases conceptually, which was satisfactory.

Time taken: 35–40 minutes

Question 2: Dynamic Programming Problem

The second question was a Dynamic Programming problem, similar to the LeetCode Hard problem: Partition Array Into Two Arrays to Minimize Sum Difference

I started with a brute-force solution and explained the time and space complexity.

Then, I moved to the optimal solution, which the interviewer found satisfactory, and coded it successfully in a few minutes.

Time taken: 25–30 minutes

Detailed Experience & Tips

From my experience, DP, Trie, and Graphs seem to be Nvidia’s favorite topics. You are very likely to encounter problems related to these topics in both online assessments and coding interview rounds.

Nowadays, LeetCode questions are frequently asked directly in Nvidia interviews. My advice would be to avoid jumping straight to the optimal solution just because you have solved the problem before. Always explain brute-force solutions, corner cases, and approach reasoning first.

Constant practice is essential to develop the habit of solving problems as if the interviewer is right in front of you. This approach helps you explain your logic clearly, identify bugs quickly, and build confidence. The interviewer is more interested in how you optimize your solution and handle challenges, rather than just providing the perfect answer immediately.

By practicing in this way, you make the interview environment feel normal, which helps you stay calm, confident, and focused throughout the process.

Key Takeaways:

Nvidia favors Dynamic Programming, Trie, and Graph questions LeetCode hard problems are often directly asked Always explain brute-force, optimizations, and corner cases before coding Practice solving problems as if the interviewer is watching, it helps build confidence Interviewers value approach and optimization strategy more than just the correct answer

Anonymous

B.Tech Student

Class of 2024

Resources Used

LeetCode
GeeksforGeeks
InterviewBit

Share Your Story

Help other candidates by sharing your interview experience

Share Experience

Ready to Share Your Experience?

Join thousands of candidates sharing their interview journeys and help build a supportive community