All companies
Qualcomm
28 Easy23 Medium9 Hard60 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 1183 | Maximum Number of Ones | Hard | |
| 3163 | String Compression III | Medium | |
| 146 | LRU Cache | Medium | |
| 206 | Reverse Linked List | Easy | |
| 200 | Number of Islands | Medium | |
| 1 | Two Sum | Easy | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 25 | Reverse Nodes in k-Group | Hard | |
| 9 | Palindrome Number | Easy | |
| 20 | Valid Parentheses | Easy | |
| 48 | Rotate Image | Medium | |
| 231 | Power of Two | Easy | |
| 190 | Reverse Bits | Easy | |
| 19 | Remove Nth Node From End of List | Medium | |
| 836 | Rectangle Overlap | Easy | |
| 169 | Majority Element | Easy | |
| 141 | Linked List Cycle | Easy | |
| 344 | Reverse String | Easy | |
| 15 | 3Sum | Medium | |
| 70 | Climbing Stairs | Easy | |
| 876 | Middle of the Linked List | Easy | |
| 232 | Implement Queue using Stacks | Easy | |
| 50 | Pow(x, n) | Medium | |
| 8 | String to Integer (atoi) | Medium | |
| 622 | Design Circular Queue | Medium | |
| 2563 | Count the Number of Fair Pairs | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 2183 | Count Array Pairs Divisible by K | Hard | |
| 283 | Move Zeroes | Easy | |
| 297 | Serialize and Deserialize Binary Tree | Hard | |
| 2502 | Design Memory Allocator | Medium | |
| 58 | Length of Last Word | Easy | |
| 26 | Remove Duplicates from Sorted Array | Easy | |
| 407 | Trapping Rain Water II | Hard | |
| 104 | Maximum Depth of Binary Tree | Easy | |
| 7 | Reverse Integer | Medium | |
| 210 | Course Schedule II | Medium | |
| 392 | Is Subsequence | Easy | |
| 46 | Permutations | Medium | |
| 342 | Power of Four | Easy | |
| 88 | Merge Sorted Array | Easy | |
| 136 | Single Number | Easy | |
| 215 | Kth Largest Element in an Array | Medium | |
| 56 | Merge Intervals | Medium | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 72 | Edit Distance | Medium | |
| 28 | Find the Index of the First Occurrence in a String | Easy | |
| 22 | Generate Parentheses | Medium | |
| 225 | Implement Stack using Queues | Easy | |
| 1163 | Last Substring in Lexicographical Order | Hard | |
| 23 | Merge k Sorted Lists | Hard | |
| 11 | Container With Most Water | Medium | |
| 21 | Merge Two Sorted Lists | Easy | |
| 346 | Moving Average from Data Stream | Easy | |
| 14 | Longest Common Prefix | Easy | |
| 338 | Counting Bits | Easy | |
| 852 | Peak Index in a Mountain Array | Medium | |
| 152 | Maximum Product Subarray | Medium | |
| 191 | Number of 1 Bits | Easy | |
| 62 | Unique Paths | Medium |