Qualcomm Interview Questions — 48 DSA Problems

46 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Qualcomm LeetCode questions for software engineering interviews.

• String Compression III (MEDIUM) — String
• Maximum Number of Ones (HARD) — Math, Greedy, Sorting, Heap (Priority Queue)
• Reverse Linked List (EASY) — Linked List, Recursion
• Remove Nth Node From End of List (MEDIUM) — Linked List, Two Pointers
• Rotate Image (MEDIUM) — Array, Math, Matrix
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Reverse Bits (EASY) — Divide and Conquer, Bit Manipulation
• Middle of the Linked List (EASY) — Linked List, Two Pointers
• Design Memory Allocator (MEDIUM) — Array, Hash Table, Design, Simulation
• Majority Element (EASY) — Array, Hash Table, Divide and Conquer, Sorting, Counting
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Two Sum (EASY) — Array, Hash Table
• Valid Parentheses (EASY) — String, Stack
• Implement Queue using Stacks (EASY) — Stack, Design, Queue
• Palindrome Number (EASY) — Math
• Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
• Number of 1 Bits (EASY) — Divide and Conquer, Bit Manipulation
• Swap Nodes in Pairs (MEDIUM) — Linked List, Recursion
• Design Circular Queue (MEDIUM) — Array, Linked List, Design, Queue
• Permutations (MEDIUM) — Array, Backtracking
• Power of Four (EASY) — Math, Bit Manipulation, Recursion
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• First Unique Character in a String (EASY) — Hash Table, String, Queue, Counting
• Serialize and Deserialize Binary Tree (HARD) — String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree
• Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
• Single Number (EASY) — Array, Bit Manipulation
• Linked List Cycle (EASY) — Hash Table, Linked List, Two Pointers
• Count the Number of Fair Pairs (MEDIUM) — Array, Two Pointers, Binary Search, Sorting
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Rectangle Overlap (EASY) — Math, Geometry
• String to Integer (atoi) (MEDIUM) — String
• Find Winner on a Tic Tac Toe Game (EASY) — Array, Hash Table, Matrix, Simulation
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Reverse Integer (MEDIUM) — Math
• Maximum Depth of Binary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Two Sum II - Input Array Is Sorted (MEDIUM) — Array, Two Pointers, Binary Search
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Pow(x, n) (MEDIUM) — Math, Recursion
• Design Tic-Tac-Toe (MEDIUM) — Array, Hash Table, Design, Matrix, Simulation
• Trapping Rain Water II (HARD) — Array, Breadth-First Search, Heap (Priority Queue), Matrix
• Power of Two (EASY) — Math, Bit Manipulation, Recursion
• Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers
• Length of Last Word (EASY) — String
• Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
• Merge Intervals (MEDIUM) — Array, Sorting