DSA Doctor
Verified Company Vault
Ixl DSA Interview Questions
17 curated coding interview questions directly asked in Ixl technical rounds, sorted by frequency with recency and difficulty diagnostics.
17
Total Questions
3 (18%)
Easy Problems
11 (65%)
Medium Problems
3 (18%)
Hard Problems
🔥 Most Tested Topics:
Arrays (5)Core DSA (4)Strings (4)Heap (2)Linked List (2)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 100.0% | 3m |
| 598 | Range Addition II | Easy | Core DSA | Implementation / Reasoning | 58.7% | 100.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 87.5% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 87.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 87.5% | all |
| 592 | Fraction Addition and Subtraction | Medium | Core DSA | Implementation / Reasoning | 66.4% | 87.5% | all |
| 634 | Find the Derangement of An Array | Medium | Arrays | Sorting / Prefix / Scan | 41.7% | 87.5% | all |
| 166 | Fraction to Recurring Decimal | Medium | Core DSA | Implementation / Reasoning | 30.9% | 87.5% | all |
| 691 | Stickers to Spell Word | Hard | Strings | Hashing / Sliding Window | 50.9% | 87.5% | all |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 87.5% | all |
| 353 | Design Snake Game | Medium | Design | Data Structure Design | 40.0% | 75.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 75.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 75.0% | all |
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | Arrays | Sorting / Prefix / Scan | 41.4% | 62.5% | all |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.5% | 62.5% | all |
| 717 | 1-bit and 2-bit Characters | Easy | Strings | Hashing / Sliding Window | 49.6% | 62.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 50.0% | all |