DSA Doctor
Verified Company Vault
Mathworks DSA Interview Questions
31 curated coding interview questions directly asked in Mathworks technical rounds, sorted by frequency with recency and difficulty diagnostics.
31
Total Questions
6 (19%)
Easy Problems
15 (48%)
Medium Problems
10 (32%)
Hard Problems
🔥 Most Tested Topics:
Arrays (10)Strings (9)Core DSA (8)Trees (5)Graphs (2)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 100.0% | 6m |
| 2861 | Maximum Number of Alloys | Medium | Arrays | Sorting / Prefix / Scan | 41.0% | 100.0% | all |
| 566 | Reshape the Matrix | Easy | Arrays | Sorting / Prefix / Scan | 65.0% | 100.0% | all |
| 3035 | Maximum Palindromes After Operations | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 46.5% | 100.0% | all |
| 2462 | Total Cost to Hire K Workers | Medium | Core DSA | Implementation / Reasoning | 43.6% | 100.0% | all |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium | Core DSA | Implementation / Reasoning | 30.2% | 100.0% | all |
| 1220 | Count Vowels Permutation | Hard | Backtracking | Backtracking | 61.3% | 87.5% | 6m |
| 2514 | Count Anagrams | Hard | Strings | Hashing / Sliding Window | 37.7% | 87.5% | all |
| 2038 | Remove Colored Pieces if Both Neighbors are the Same Color | Medium | Core DSA | Implementation / Reasoning | 63.1% | 87.5% | all |
| 1163 | Last Substring in Lexicographical Order | Hard | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 35.0% | 87.5% | all |
| 1130 | Minimum Cost Tree From Leaf Values | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 67.9% | 87.5% | all |
| 3049 | Earliest Second to Mark Indices II | Hard | Core DSA | Implementation / Reasoning | 22.6% | 87.5% | all |
| 3048 | Earliest Second to Mark Indices I | Medium | Core DSA | Implementation / Reasoning | 36.9% | 87.5% | all |
| 2444 | Count Subarrays With Fixed Bounds | Hard | Arrays | Sorting / Prefix / Scan | 69.2% | 87.5% | all |
| 500 | Keyboard Row | Easy | Core DSA | Implementation / Reasoning | 73.9% | 87.5% | all |
| 2582 | Pass the Pillow | Easy | Core DSA | Implementation / Reasoning | 56.6% | 87.5% | all |
| 968 | Binary Tree Cameras | Hard | Trees | DFS / BFS | 47.9% | 87.5% | all |
| 638 | Shopping Offers | Medium | Core DSA | Implementation / Reasoning | 52.5% | 87.5% | all |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 75.0% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 75.0% | all |
| 2851 | String Transformation | Hard | Strings | Hashing / Sliding Window | 27.2% | 62.5% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 62.5% | all |
| 2964 | Number of Divisible Triplet Sums | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 62.5% | all |
| 1328 | Break a Palindrome | Medium | Strings | Hashing / Sliding Window | 51.6% | 50.0% | all |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Linked List | Two Pointers | 82.4% | 50.0% | all |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | Arrays | Sorting / Prefix / Scan | 59.8% | 50.0% | all |
| 2559 | Count Vowel Strings in Ranges | Medium | Strings | Hashing / Sliding Window | 67.8% | 50.0% | all |
| 2831 | Find the Longest Equal Subarray | Medium | Arrays | Sorting / Prefix / Scan | 38.1% | 50.0% | all |
| 2697 | Lexicographically Smallest Palindrome | Easy | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 81.4% | 50.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 3335 | Total Characters in String After Transformations I | Medium | Strings | Hashing / Sliding Window | 45.6% | 50.0% | all |