DSA Doctor
Verified Company Vault
30d Active
Palo Alto Networks DSA Interview Questions
45 curated coding interview questions directly asked in Palo Alto Networks technical rounds, sorted by frequency with recency and difficulty diagnostics.
45
Total Questions
11 (24%)
Easy Problems
29 (64%)
Medium Problems
5 (11%)
Hard Problems
🔥 Most Tested Topics:
Arrays (15)Strings (11)Trees (8)Core DSA (6)Design (4)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 100.0% | 30d |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 100.0% | 3m |
| 2831 | Find the Longest Equal Subarray | Medium | Arrays | Sorting / Prefix / Scan | 38.1% | 100.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | all |
| 706 | Design HashMap | Easy | Design | Data Structure Design | 66.6% | 87.5% | 3m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 87.5% | 3m |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 87.5% | 3m |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 75.0% | 6m |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 75.0% | 6m |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 75.0% | 6m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | 6m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 75.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 75.0% | all |
| 2086 | Minimum Number of Food Buckets to Feed the Hamsters | Medium | Arrays | Sorting / Prefix / Scan | 48.4% | 75.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | all |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 62.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 62.5% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 62.5% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 62.5% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 62.5% | all |
| 252 | Meeting Rooms | Easy | Greedy | Greedy | 59.4% | 50.0% | all |
| 64 | Minimum Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 68.2% | 50.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 50.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 50.0% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 226 | Invert Binary Tree | Easy | Trees | DFS / BFS | 80.1% | 50.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 43 | Multiply Strings | Medium | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 112 | Path Sum | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 54.9% | 50.0% | all |
| 113 | Path Sum II | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 62.2% | 50.0% | all |
| 870 | Advantage Shuffle | Medium | Core DSA | Implementation / Reasoning | 54.6% | 50.0% | all |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 50.0% | all |
| 92 | Reverse Linked List II | Medium | Linked List | Two Pointers | 51.5% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 54.8% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 50.0% | all |