Nvidia | System Software Engineer, Distributed Systems | Coding | Phone Screen
dennis·Interview Date:December 17, 2025Region:UnspecifiedHiring Team/Org:General Hire
find the number of good subsequence all element in subsequence are unique min(sub)=a, max(sub)=b, all element between [a,b] should be present in subsequence return numbers of all good subsquences example: 13 11 4 12 5 4 6+4+1=11 3 1 1 2 8 5+3+2=10
Sign in to view the full interview experience
Create or use your InterviewDB account to read the full Warren post and all shared details.
Sign in to continue0