Status: ME CS student, Top 10 CS school
Position: Engineer at Qualcomm
Location: Hyderabad, India
Date: July 27, 2020
Virtual Interview Consists of 5 rounds in total(written+3 Technical+HR) and all rounds were eliminative.
Round 1(Written 90 min): MCQs based on Operating Systems(CPU scheduling and Paging), DBMS(SQL queries and Transactions), C programming and C++, Aptitude and Logic based questions.
Round 2(Technical Interview 1 60 min) : started with discussion based on my projects
Ques 1: Do you know about Little Endian and Big Endian?( Me : Yes). Then find out your OS uses Little Endian or Big Endian.
I struggled a little here then he asked me to tell difference between structure and union(I mentioned C in my resume therefore this question came). I told the main differences.
Interviewer: can you do something with this differences to find out if your OS uses Little Endian or Big Endian.
I tried some more things and figured out that we can use Union in a way to find out this thing(I dont know if this was right but the interviewer moved to next question).
Ques 2: write a program in a single line to set last bit of an integer to 0 keeping the remaining bits as it is.
I struggled even here. Finally I wrote the program in C language:
return a%2==0?:a^1;// here a is the integer variable, if it is odd then subtract 1 or XOR 1.
Ques 3: Delete a node in a linked list.
Did it easily.
Ques 4: Find if a given string is palindrome or not.
Did easily.
All questions were coded from scratch on HackerRank platform.
Round 3(Technical Interview 2): started with basic questions on OS, threads and processes, paging, virtual memory and went in depth on each concept and moved to next question from the point where i told i dont know this depth.
Then questions on OOPS(I got rejected from 30 companies in past 3 months and every Company I interviewed for, such as PAYU, Oracle, etc had asked OOPS concepts questions so be prepared with your definitons and real life example)
Round 4(Technical Interview 3):
Ques 1: Given an array, find the maximum and minimum number in O(n) time and O(1) space
Did easily
Ques 2: Sorting a linked list
Tried hard but couldnt do
Ques 3: Stack code in C language
I did it in a simple way but he was expecting a complicated way which i knew but didnt do.
So this was it for me. Didnt got a HR call. Qualcomm is a mass recruiter and Questions are Easy and Medium level only and package is also good but i believe work there is not so good.
Compensation Details: https://leetcode.com/discuss/compensation/811360/Qualcomm-or-Engineer-or-Hyderabad
I got selected in Zopsmart, Here is my interview Experience: https://leetcode.com/discuss/interview-experience/887668/ZopSmart-or-Software-Engineer-or-Bangalore-or-09102020-Offer
All the best guys for your Interviews. Keep Coding.