Qualcomm Software Developer Interview Questions, Process, and Tips

Linkedlist questions

Q1. Depth Os and C
Add your answer
Q2. Multi threading and semaphores
Add your answer

Nil nil nil nil nil nil

Q1. Nil nil nil nil nil nil
Add your answer
Q2. Nil nil nil nil nil nil boss good
Add your answer

Q1. Find the missing Number. Some questions of OS and DBMS
Add your answer

DataStructure C OS RTOS HARDWARE

Q1. String compare | string copy repeTED ELEMENT IN ARRAY LINKED LIST
Ans. 
The question is about string comparison, string copying, repeated elements in an array, and linked lists.
• String comparison involves comparing two strings to check if they are equal or not.

• String copying refers to creating a copy of a string.

• Finding repeated elements in an array involves identifying elements that occur more than once.

• Linked lists are data structures that consist of nodes linked together.
Answered by AI
Add your answer

Q1. More deep on domain knowledge os processor ARM arch
Add your answer

Q1. Binary tree(convert BT to min heap), dbms, networking questions, what happens when you type google.com in browser.
Add your answer
Q2. Swap 2 nos without using 3rd variable
Ans. 
Swapping 2 numbers without using a third variable
• Use arithmetic operations to swap the values

• Addition and subtraction can be used to swap the values

• XOR operation can also be used to swap the values
Answered by AI
Add your answer
Q3. Prison break question, can be found in leetcode discussion section
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:00 PM.

Q1. 
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...read more
Ans. Brute Force
1. We are given the function MERGEINTERVALS(), which takes a 2D vector representing the vector of intervals and returns another 2D vector which is the vector of merged intervals.
2. We create another function ISOVERLAP() to check if the current interval overlaps with the other interval.
3. Now we create an empty 2D vector “RES” to store finally merged intervals and another boolean vector “VIS” to mark if the current in...read more
Answered Anonymously
Add your answer
Q2. 
Search In Rotated Sorted Array Problem Statement
Given a rotated sorted array ARR of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
Note:
1. If 'K' is not present...read more
Ans. Naive Approach
Naively traverse the array and find if ‘K’ is present in ARR or not. If ‘K’ is present in ARR return its index else return -1.
Space Complexity: O(1)Explanation:
O(1), i.e. constant space complexity. 
Time Complexity: O(n)Explanation:
O(N), where N is the length of the array/list. 
 
We are iterating over the array/list ARR once. Hence, the time complexity is O(N).

Java (SE 1.8)

/*

    Time Compl...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on CodePair : Hackerearth. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Hackerearth & along with that You should have to explain your Code and Approach to the Interviewers.
The Interviewers were helpful and didn't hesitate in giving hints.
Timing - 11:00 A.M to 12:00 P.M

Q1. 
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...read more
Ans. Dynamic programming
• For every fountain, we can try to find the pair area = (left, right), where left and right are the leftmost and the rightmost index respectively where the current fountain can reach.For every index 'I' = 0 to 'I' = 'N' -1, 'LEFT' = max(0, 'I' - 'ARR'['I']) and  'right' = min('I' + ('ARR'['I'] + 1), 'N').
• Now we can sort the array of pairs in non-decreasing order according to 'LEFT' to find the mi...read more
Answered Anonymously
Add your answer
Q2. 
Bellman Ford Shortest Path Problem
Given a directed weighted graph comprised of vertices labeled 1 to N and M edges, where each edge connects two nodes u and v with a weight w representing the distance be...read more
Ans. Bellman-Ford Algorithm
In this algorithm, we have a source vertex and we find the shortest path from source to all the vertices.
For this, we will create an array of distances D[1...N], where D[i] stores the distance of vertex ‘i’ from the source vertex. Initially all the array values contain an infinite value, except ‘D[source]’, ‘D[source]’ = 0.
The algorithm consists of several iterations and in each iteration, we try ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a Google Meet Video Call. The HR was friendly and asked basic questions.
The timing was 2:00 PM to 2:30 PM.