Data

Tools

Indexes

Applications

Experiments

Awesome

An open API service indexing awesome lists of open source software.

https://github.com/elysian01/most-asked-interview-questions

Contains a list of most asked interview questions
https://github.com/elysian01/most-asked-interview-questions

Last synced: 8 months ago
JSON representation

Contains a list of most asked interview questions

Awesome Lists containing this project

README 

          
# Most-Asked-Interview-Questions

Contains a list of most asked interview questions



# Companies



## Qualcomm



https://www.geeksforgeeks.org/qualcomm-interview-experience-off-campus-2021/



https://www.geeksforgeeks.org/qualcomm-interview-experience-pool-campus-drive/



### Aptitude



Aptitude Section(20 MCQ Ques/30min with negative marking)



Questions in this section are from the following topics:



1. Work and wages

2. Seating arrangement

3. Profit and Loss

4. Percentage

5. Time and Speed

6. Data Interpretation

7. Ration and Proportion

8. Coding Decoding



### Problems



1. https://leetcode.com/problems/single-number/

2. https://leetcode.com/problems/count-array-pairs-divisible-by-k/description/

3. given a string say “AABCCC” , return it as “2A1B3C”. Constraint is say if u have 13'A’s as input , u have to print it as “9A4A”

4. https://www.geeksforgeeks.org/maximise-the-number-of-toys-that-can-be-purchased-with-amount-k/



5.  Reverse Linked List

6. Maximum Subarray Sum

7. Wildcard Pattern Matching

8. Valid Sudoku

9. Check Bipartite Graph

10. Remove Duplicates from Sorted Array

11. Word Search - l

12. First Missing Positive

13. Height of Binary Tree

14. Delete Node In A Linked List

15. First Unique Character in a String

16. Odd Before Even: You are given two sorted linked lists of length ‘N1’ and ‘N2’ respectively. Your task is to create a linked list with common elements such that all common odd elements are before common even elements. (relative order should be maintained)



17. Stack Implementation Using Array

18. Reverse Level Order Traversal

19. Middle Of Linked List

20. LRU Cache Implementation

21. Maximum of all Subarrays of size K

22. Stack using queue

23. Minimum Number of Platform Needed

24. Median in a stream

25. Flip given bits

26. Swap Adjacent Bit Pairs (You are given an integer 'N'. Your task is to find the number formed after swapping each even bit of 'N' in its binary representation with its adjacent bit on the right, assuming that the least significant bit is an odd bit.)



27. Print left view of a binary tree.

28. Implement your own memcpy.

29. Min distance between 2 given nodes in BT

30. Detech loop in CLL

31. Merge overlapping intervals Given 'N' number of intervals, where each interval contains two integers denoting the boundaries of the interval.



32. Search In Rotated Sorted Array 

33. There is a one-dimensional garden of length 'N'. On each of the positions from 0 to 'N', there is a fountain, and this fountain’s water can reach up to a certain range as explained further. In other words, there are 'N' + 1 fountains located at positions 0, 1, 2, 3, …. 'N' which can be activated in the garden.

You are given an integer 'N' and an array/list 'ARR' of length 'N' + 1, where each index of the array denotes the coverage limit of a particular fountain.

A fountain at index 'i' can water the area ranging from the position 'i' - 'ARR'['i'] to 'i' + 'ARR'['i'].

Your task is to find the minimum number of fountains that have to be activated such that the whole garden from position 0 to 'N' has access to the water from at least some fountain.



34. Bellman Ford Algo

35. Swap even and odd bits in given number

36. Remove k-th last node

37. Remove duplicate nodes from the linked list. Follow up -> what if the linked list contains nodes in a sorted manner



38. Modify the array such that every index contains the product of all the elements in the array except itself. Follow up -> what if it contains 0, what if it contains multiple 0s, negative numbers



39. Given a number and an array search the number in the array(not necessarily sorted).(Suggested him a linear scan). Follow up -> what if we receive a lot of queries for that array. (Suggested space vs time trade-off. Either maintain a HashSet or sort the array and binary search).



40. Convert LL to BT

41. Find missing smallest positive number in unsorted array

42. Find length of Loop

43. Implement strstr

44. Min distance between two given nodes of a Binary Tree

45. Delete a node from BST

46. Left View of Binary Tree

47. Intersection Point in Y Shapped Linked Lists

48. Check for BST

49. Detect Loop in linked list

50. Reverse Bits

51. Next Permutation

52. Array Subset of another array

53. Set Bits

54. Find Prime numbers in a range

55. Subsequence matching

56. Lowest Common Ancestor in a Binary Search Tree.

57. Sorted Linked List to Balanced BST

58. Function to check if a singly linked list is palindrome

59. Clone a linked list with next and random pointer

60. Given 2 strings find number of occurrences of one in another.

61. Given a number write a macro to set/unset a bit at a particular position k.

62. I have defined 2 global variables, one is initialized and another is uninitialized, in which segments would they be stored?

63. Write your own memcpy function handling all the corner cases.

64. Switch the values in two variables without using a third variable.

65. https://www.geeksforgeeks.org/extract-k-bits-given-position-numbe

66.  Given a value, delete all nodes from a linked list having that value.

67.  N meetings in a room.https://www.geeksforgeeks.org/activity-selection-problem-greedy-algo-1/

68.  Reverse a stack without using extra space.

69.  Construct a tree from pre-order and in-order traversal.

70.  Given an array which has numbers from 1 to n. There are 2 numbers replaced with 0. Find both numbers in O(n) time and O(1) space.

71.  BT LCA

72.  sum of nodes BT

73.  delete a node in  BT



### Important



1. What happened when you enter a URL on browser. Explain all in detail.  https://medium.com/@maneesha.wijesinghe1/what-happens-when-you-type-an-url-in-the-browser-and-press-enter-bb0aa2449c1a

2. What is little Endian and Big Endian. How to check for it ? https://www.geeksforgeeks.org/little-and-big-endian-mystery/

3. Difference between repeater, bridge, hub and router ? https://www.geeksforgeeks.org/network-devices-hub-repeater-bridge-switch-router-gateways/

4. Write a program to find it IP Address is valid or not

5. Examples of internal and external fragmentation.

6. Write a program to implement memcpy() on your own.

7. Write code snippet for function pointers.

8. How to differentiate between shared and private variables in thread in multithreaded environment?

9. Basic server client architecture in TCP.



### Operating System & C



1. What is mutex?

2. Difference between mutex and semaphores.

3. How do deadlocks occur and how do prevent deadlocks?

4. What is virtual memory and how it is achieved?

5. What is the advantage of using thread over process?

6. Then Interview jumped to OOPS concepts.

7. What is Inheritance and Constructer.

8. what is Segmentation, tell me the memory management techniques

9. Deadlock and its real time examples.

10. Questions on how two processes can communicate in OS, give different ways.

11. How will you handle 2 thread working on same MAP.

12. Questions on Storage classes in C.

13. What is a program, task and threads

14. what is priority inversion and priority inheritance.(Explained in detail by giving examples)

15. Asked me to explain C memory map, the interviewer gave a program and made me point out which variable goes to which part of memory.(Explained him correctly).

16. Asked me what are the different intermediate files while compiling and running a C program.

17. WAP to find whether a machine is little endian or big endian.(Explained him my approach, but he stopped me while I was trying to code it)

18. Priority Inversion and ways to tackle it

19. To explain race condition, deadlock, critical section problem with examples

20. Design the memory layout of a C program that he wrote

21. What is the use of pure virtual functions in c++.

22. What is static and dynamic linking. How does a compiler know if a function belongs to a statically linked source or a dynamically linked source.

23. What is a volatile/non-volatile memory.

24. What is RAM/ROM.

25. Structures and unions, the concept of padding in structures.

26. How memory is allocated using calloc and malloc functions.

27. How is free keyword different from delete.

28. How does free() know the size of memory to be deallocated? https://www.geeksforgeeks.org/g-fact-88/

29. How does a process look like in memory, the difference between global variables and static variables?

30. Different scopes of variables and to explain when each of them is used and why, when and how do we use the extern keyword.

31. What is a void pointer and how do we use it.

32. Threading concept and how stack behaves in multi-threading environment and few pThread concepts.

33. Page fault and steps followed to handle it.

34. How to check if a given number is a power of 2, only using bitwise operators.

35. Different System calls and why do we use them.https://www.geeksforgeeks.org/operating-system-introduction-system-call/

36. Difference between Kernel and Operating System.

37. Different phases of Compiler and in-detail explanation of each of the phases.

38. How compiler does intermediate code optimization?

39. What are Static and Dynamic Libraries?https://www.geeksforgeeks.org/static-vs-dynamic-libraries/

40. Why do we use Cache Memory?

41. What is Cache Coherence Protocol and when do we use them.

42. Difference between Scheduler and Dispatcher.

43. What are the applications of Unions? and problem-related to Unions.

44. Let us suppose there are multiple .c files and you want a function from a particular file can only be accessed in that c file only. (Ans- Use static keyword)

45. What is Volatile keyword?

46. A lot of questions from IPC, Cache, Paging.

47. https://www.geeksforgeeks.org/inline-functions-cpp/

48. 



### Random



1. So I was asked to write a DockerFile for a python app, write commands to build an image,run as container

2. Difference between SQL and NoSQL . followed by, I was asked to write SQL query for a given question.

3. Difference between Primary Key and Foreign key

4. Some Questions on my NodeJS, Python projects

5. Use of stack and queue DS.

5. Difference between stack and heap memory. Asked me to explain by writing a simple program.

6. Questions on Function pointers and usage.



### OOPS



1. Implement Runtime Polymorphism with Multilevel Inheritance

2. Virtual functions

3. functions overloading, overriding.



#### MISC



1. Tell me the difference between stack and heap memory.

2. Describe a few deadlock avoidance schemes.

3. Implement the malloc() and free() operations. Describe only the strategy for doing so, not the code.

4. What is “I” in ACID properties?

5. Describe the virtual function in C++.

6.A window of size k is sliding from left to right in an array of size n. Find out the maximum number in the window at each window position.

7. What do you understand by clustering index?

8. Describe your final year project in detail. How would you describe your role in the same?

9. There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules. Give us a method of debugging it.

10. What are the various techniques by which fault tolerance can be ensured in systems? (Different redundancy techniques)

11. A pair of redundant systems is operating. Give us a method of ensuring that when one of them goes down, the other one will take over its operation.

Suppose a 4-inch cube is painted on all the sides. If this piece is cut into smaller cubes of side 1 inch each, how many cubes will be left unpainted at all?

12. Devise a program to check whether a binary tree is BST or not.

13. Supposing that two of the nodes of a Binary Search Tree (BST) are interchanged, give us a method to fix (or correct) this BST.

14. Out of given choices, pick out the Super Key from the lot.

15. Questions based on function pointers and its usage.

16. Devise an algorithm to check if there is a loop in a doubly linked list.

17. Considering GRANT is used to grant privileges to perform the queries, specify the command which is used to remove these permissions.

18. Write a program to delete a node, given only a pointer to the node in a circular linked list.

Questions on call back functions.

19. How would you define HADOOP? Describe the underlying principle of HADOOP and illustrate some of its features like Map Reduce?

20. Describe some salient features of the cloud?

21. Write a program to return a stream of bytes from a function.

22. What do you understand by the term cloud computing?

23. Describe the difference between a Public and Private cloud.

24. Write a code to reverse a single linked list.



### Some behavioral questions were asked, like



1. What i would do if I was given a task that takes 20 days to finish, but deadline is just 2 days?

2. How would I approach a problem/Issue in an application?

3. What I would if i was given a task that i have no idea about? What if no seniors are available to help you out ?

4. What would you do if a customer wants you to solve an issue immediately within an hour ?



5. At Qualcomm you might have to do multiple tasks such as attend meetings related to your work as well as complete work for your client. How will you cope up with the same?

6. Logical or choice-based questions: You have a cake. Describe a method to divide it into eight pieces using only three lines.

7. How do you define your goals in life? Do you make plans and strategies for the future or grab opportunities as they come?

8. Would you be interested in changing your domain? If yes, why?

9. Asked me about my biggest fear of my life.

10. Tell me something about yourself.

11. what makes you different from other candidates.

12. strengths and weakness.

13. biggest challenge faced till now.

14. Why do you want to join Qualcomm.