Qualcomm
52 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2563. Count the Number of Fair Pairs | Medium | 68.1% | TopicsArrayTwo PointersBinary SearchSorting |
| 4. Median of Two Sorted Arrays | Hard | 68.1% | TopicsArrayBinary SearchDivide and Conquer |
| 21. Merge Two Sorted Lists | Easy | 68.1% | TopicsLinked ListRecursion |
| Pow(x, n) | Medium | 57.5% | TopicsMathRecursion |
| 104. Maximum Depth of Binary Tree | Easy | 57.5% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 210. Course Schedule II | Medium | 57.5% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort |
| String to Integer (atoi) | Medium | 57.5% | TopicsString |
| 46. Permutations | Medium | 57.5% | TopicsArrayBacktracking |
| 88. Merge Sorted Array | Easy | 57.5% | TopicsArrayTwo PointersSorting |
| 136. Single Number | Easy | 57.5% | TopicsArrayBit Manipulation |
| 215. Kth Largest Element in an Array | Medium | 57.5% | TopicsArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect |
| 72. Edit Distance | Medium | 57.5% | TopicsStringDynamic Programming |
| 28. Find the Index of the First Occurrence in a String | Easy | 57.5% | TopicsTwo PointersStringString MatchingZ AlgorithmKnuth–Morris–Pratt AlgorithmBoyer–Moore String-Search Algorithm |
| 22. Generate Parentheses | Medium | 57.5% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| 225. Implement Stack using Queues | Easy | 57.5% | TopicsStackDesignQueue |
| 1163. Last Substring in Lexicographical Order | Hard | 57.5% | TopicsTwo PointersStringLyndon Factorization |
| 23. Merge k Sorted Lists | Hard | 57.5% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 11. Container With Most Water | Medium | 57.5% | TopicsArrayTwo PointersGreedy |
| 346. Moving Average from Data Stream | Easy | 57.5% | TopicsArrayDesignQueueData Stream |
| 14. Longest Common Prefix | Easy | 57.5% | TopicsArrayStringTrie |
| 338. Counting Bits | Easy | 57.5% | TopicsDynamic ProgrammingBit Manipulation |
| 852. Peak Index in a Mountain Array | Medium | 57.5% | TopicsArrayBinary SearchTernary Search |
| 152. Maximum Product Subarray | Medium | 57.5% | TopicsArrayDynamic Programming |
| 191. Number of 1 Bits | Easy | 57.5% | TopicsDivide and ConquerBit Manipulation |
| 62. Unique Paths | Medium | 57.5% | TopicsMathDynamic ProgrammingCombinatorics |
