Gpu Interview Questions

171 gpu interview questions shared by candidates

I interviewed with AMD for multiple internship positions so I will be generalizing the interview question types. Most of the times you won't be asked behavioral questions. Work on your universities operating systems course and search for common operating systems interview questions online. Other than that work on your computer architecture and c programming skills (including bitwise operations).
avatar

GPU Drivers Engineer

Interviewed at AMD

4
Feb 2, 2022

I interviewed with AMD for multiple internship positions so I will be generalizing the interview question types. Most of the times you won't be asked behavioral questions. Work on your universities operating systems course and search for common operating systems interview questions online. Other than that work on your computer architecture and c programming skills (including bitwise operations).

One question was: Minimum number of moves required to make all array elements equal ~ 15 min And then a lot of small questions/multiple choices, i.e. what does the code print/do? For those, you had to be really quick.
avatar

Senior Software Engineer - GPU

Interviewed at CARIAD

3.5
Feb 1, 2024

One question was: Minimum number of moves required to make all array elements equal ~ 15 min And then a lot of small questions/multiple choices, i.e. what does the code print/do? For those, you had to be really quick.

A string A contains k lowercase letters and can form multiple subsequences (not necessarily contiguous). If each lowercase letter appears with the same frequency in a subsequence as in the original string, then this subsequence is considered a perfect subsequence. Given a string A, determine the number of its perfect subsequences.​ For example, in the string "abca", the subsequences "a", "b", "c", "a", "ab", "bc", "ca", "aa", etc., are all valid.

A string A contains k lowercase letters and can form multiple subsequences (not necessarily contiguous). If each lowercase letter appears with the same frequency in a subsequence as in the original string, then this subsequence is considered a perfect subsequence. Given a string A, determine the number of its perfect subsequences.​ For example, in the string "abca", the subsequences "a", "b", "c", "a", "ab", "bc", "ca", "aa", etc., are all valid.

Viewing 71 - 80 interview questions

See Interview Questions for Similar Jobs

Glassdoor has 171 interview questions and reports from Gpu interviews. Prepare for your interview. Get hired. Love your job.