MathWorks Coding Interview Questions
We track 31 coding questions asked at MathWorks, tagged with the algorithms and concepts they test. The most common: Array, String, Greedy, Dynamic Programming, Math.
Browse all 31 MathWorks questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array16.8%
- String10.6%
- Dynamic Programming9.7%
- Greedy8.7%
- Math7.1%
- Binary Search5.7%
- Hash Table4.5%
- Simulation3.7%
- Two Pointers3.7%
- Linked List3.4%
- Other (23)26.1%
How many questions involve each concept
Share of all 31 tracked MathWorks questions that touch each concept. Questions usually involve several, so these overlap.
- Array51.6%
- String32.3%
- Greedy29.0%
- Dynamic Programming25.8%
- Math22.6%
- Hash Table19.4%
- Binary Search16.1%
- Counting12.9%
- Heap (Priority Queue)12.9%
- Simulation9.7%
- Sorting9.7%
- Two Pointers9.7%
Where MathWorks differs from the average company
Concept weight at MathWorks relative to the average across all companies we track. Green means MathWorks leans on it harder than most.
- Greedy2.9×
- Counting2.5×
- Simulation2.2×
- Heap (Priority Queue)1.9×
- Depth-First Search0.74×
- Hash Table0.67×
- Sorting0.44×
MathWorks specialties
Concepts that show up at MathWorks but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 31 tracked MathWorks questions.
- Junior16% (5)
- Mid/Senior52% (16)
- Staff32% (10)
Every concept in MathWorks interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 16 | 51.6% | 16.8% |
| String | 10 | 32.3% | 10.6% |
| Greedy | 9 | 29.0% | 8.7% |
| Dynamic Programming | 8 | 25.8% | 9.7% |
| Math | 7 | 22.6% | 7.1% |
| Hash Table | 6 | 19.4% | 4.5% |
| Binary Search | 5 | 16.1% | 5.7% |
| Counting | 4 | 12.9% | 2.5% |
| Heap (Priority Queue) | 4 | 12.9% | 2.9% |
| Simulation | 3 | 9.7% | 3.7% |
| Sorting | 3 | 9.7% | 1.7% |
| Two Pointers | 3 | 9.7% | 3.7% |
| Depth-First Search | 2 | 6.5% | 1.7% |
| Linked List | 2 | 6.5% | 3.4% |
| Sliding Window | 2 | 6.5% | 1.7% |
| Backtracking | 1 | 3.2% | 0.6% |
| Binary Tree | 1 | 3.2% | 0.9% |
| Bit Manipulation | 1 | 3.2% | 0.6% |
| Bitmask | 1 | 3.2% | 0.6% |
| Breadth-First Search | 1 | 3.2% | 0.9% |
| Combinatorics | 1 | 3.2% | 0.7% |
| Game Theory | 1 | 3.2% | 0.9% |
| Graph Theory | 1 | 3.2% | 0.9% |
| Matrix | 1 | 3.2% | 1.1% |
| Memoization | 1 | 3.2% | 0.6% |
| Monotonic Queue | 1 | 3.2% | 0.9% |
| Monotonic Stack | 1 | 3.2% | 0.7% |
| Prefix Sum | 1 | 3.2% | 1.1% |
| Queue | 1 | 3.2% | 0.9% |
| Recursion | 1 | 3.2% | 1.7% |
| Stack | 1 | 3.2% | 0.7% |
| String Matching | 1 | 3.2% | 0.9% |
| Tree | 1 | 3.2% | 0.9% |
Practice a MathWorks interview
Take a realistic AI-led mock interview with questions MathWorks actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required