Problem database last updated: June 20, 2025
28 problems · 5 Easy, 12 Medium, 11 Hard · Ranked #72 of 458
5 Easy
18% · avg 23%
12 Medium
43% · avg 59%
11 Hard
39% · avg 18%
Based on 28 reported problems, MathWorks interviews are significantly harder than average - 39% Hard vs 18% across all companies.
Compared to the industry average, MathWorks puts unusual emphasis on bitmask (7.1% of problems, 13.2x the industry average), greedy (25% of problems, 3x the industry average), simulation (10.7% of problems, 2.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (53.6%), string (35.7%), dynamic-programming (35.7%), greedy (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Count Subarrays With Fixed Bounds You are given an integer array nums and two integers minK and maxK. | Hard | Very Likely | arrayqueuesliding-window | Solve |
Maximum Number of Alloys You are the owner of a company that creates alloys using various types of metals. There are n different types of metals available, and you have access to k mach... | Medium | Very Likely | arraybinary-search | Solve |
Sell Diminishing-Valued Colored Balls You have an inventory of different colored balls, and there is a customer that wants orders balls of any color. | Medium | Very Likely | arraymathbinary-search | Solve |
Total Cost to Hire K Workers You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker. | Medium | Very Likely | arraytwo-pointersheap-priority-queue | Solve |
Reshape the Matrix In MATLAB, there is a handy function called reshape which can reshape an m x n matrix into a new one with a different size r x c keeping its original data. | Easy | Very Likely | arraymatrixsimulation | Solve |
Keyboard Row Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below. | Easy | Very Likely | arrayhash-tablestring | Solve |
Earliest Second to Mark Indices II You are given two 1-indexed integer arrays, nums and, changeIndices, having lengths n and m, respectively. | Hard | Very Likely | arraybinary-searchgreedy | Solve |
Count Anagrams You are given a string s containing one or more words. Every consecutive pair of words is separated by a single space ' '. | Hard | Very Likely | hash-tablemathstring | Solve |
Minimum Cost Tree From Leaf Values Given an array arr of positive integers, consider all binary trees such that: | Medium | Very Likely | arraydynamic-programmingstack | Solve |
Shopping Offers In LeetCode Store, there are n items to sell. Each item has a price. However, there are some special offers, and a special offer consists of one or more differe... | Medium | Very Likely | arraydynamic-programmingbacktracking | Solve |
Binary Tree Cameras You are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil... | Hard | Very Likely | dynamic-programmingtreedepth-first-search | Solve |
Last Substring in Lexicographical Order Given a string s, return the last substring of s in lexicographical order. | Hard | Very Likely | two-pointersstring | Solve |
Maximum Palindromes After Operations You are given a 0-indexed string array words having length n and containing 0-indexed strings. | Medium | Very Likely | arrayhash-tablestring | Solve |
Remove Colored Pieces if Both Neighbors are the Same Color There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color... | Medium | Very Likely | mathstringgreedy | Solve |
Earliest Second to Mark Indices I You are given two 1-indexed integer arrays, nums and, changeIndices, having lengths n and m, respectively. | Medium | Very Likely | arraybinary-search | Solve |
Pass the Pillow There are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holding the pill... | Easy | Very Likely | mathsimulation | Solve |
String Transformation You are given two strings s and t of equal length n. You can perform the following operation on the string s: | Hard | Very Likely | mathstringdynamic-programming | Solve |
Minimum Edge Reversals So Every Node Is Reachable There is a simple directed graph with n nodes labeled from 0 to n - 1. The graph would form a tree if its edges were bi-directional. | Hard | Likely | dynamic-programmingdepth-first-searchbreadth-first-search | Solve |
Longest String Chain You are given an array of words where each word consists of lowercase English letters. | Medium | Likely | arrayhash-tabletwo-pointers | Solve |
Split Array Largest Sum Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. | Hard | Likely | arraybinary-searchdynamic-programming | Solve |
Sum of Distances in Tree There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges. | Hard | Likely | dynamic-programmingtreedepth-first-search | Solve |
Convert Binary Number in a Linked List to Integer Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary repre... | Easy | Likely | linked-listmath | Solve |
Longest Repeating Character Replacement You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th... | Medium | Likely | hash-tablestringsliding-window | Solve |
Maximum Difference Between Increasing Elements Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 <= i < j < n and... | Easy | Likely | array | Solve |
Beautiful Arrangement Suppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i... | Medium | Likely | arraydynamic-programmingbacktracking | Solve |
Distinct Subsequences Given two strings s and t, return the number of distinct subsequences of s which equals t. | Hard | Likely | stringdynamic-programming | Solve |
Break a Palindrome Given a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string... | Medium | Likely | stringgreedy | Solve |
Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. | Hard | Likely | linked-listrecursion | Solve |
Count Subarrays With Fixed Bounds
SolveYou are given an integer array nums and two integers minK and maxK.
Maximum Number of Alloys
SolveYou are the owner of a company that creates alloys using various types of metals. There are n different types of metals available, and you have access to k mach...
Sell Diminishing-Valued Colored Balls
SolveYou have an inventory of different colored balls, and there is a customer that wants orders balls of any color.
Total Cost to Hire K Workers
SolveYou are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker.
Reshape the Matrix
SolveIn MATLAB, there is a handy function called reshape which can reshape an m x n matrix into a new one with a different size r x c keeping its original data.
Keyboard Row
SolveGiven an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below.
Earliest Second to Mark Indices II
SolveYou are given two 1-indexed integer arrays, nums and, changeIndices, having lengths n and m, respectively.
Count Anagrams
SolveYou are given a string s containing one or more words. Every consecutive pair of words is separated by a single space ' '.
Minimum Cost Tree From Leaf Values
SolveGiven an array arr of positive integers, consider all binary trees such that:
Shopping Offers
SolveIn LeetCode Store, there are n items to sell. Each item has a price. However, there are some special offers, and a special offer consists of one or more differe...
Binary Tree Cameras
SolveYou are given the root of a binary tree. We install cameras on the tree nodes where each camera at a node can monitor its parent, itself, and its immediate chil...
Last Substring in Lexicographical Order
SolveGiven a string s, return the last substring of s in lexicographical order.
Maximum Palindromes After Operations
SolveYou are given a 0-indexed string array words having length n and containing 0-indexed strings.
Remove Colored Pieces if Both Neighbors are the Same Color
SolveThere are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color...
Earliest Second to Mark Indices I
SolveYou are given two 1-indexed integer arrays, nums and, changeIndices, having lengths n and m, respectively.
Pass the Pillow
SolveThere are n people standing in a line labeled from 1 to n. The first person in the line is holding a pillow initially. Every second, the person holding the pill...
String Transformation
SolveYou are given two strings s and t of equal length n. You can perform the following operation on the string s:
Minimum Edge Reversals So Every Node Is Reachable
SolveThere is a simple directed graph with n nodes labeled from 0 to n - 1. The graph would form a tree if its edges were bi-directional.
Longest String Chain
SolveYou are given an array of words where each word consists of lowercase English letters.
Split Array Largest Sum
SolveGiven an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.
Sum of Distances in Tree
SolveThere is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.
Convert Binary Number in a Linked List to Integer
SolveGiven head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds the binary repre...
Longest Repeating Character Replacement
SolveYou are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...
Maximum Difference Between Increasing Elements
SolveGiven a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 <= i < j < n and...
Beautiful Arrangement
SolveSuppose you have n integers labeled 1 through n. A permutation of those n integers perm (1-indexed) is considered a beautiful arrangement if for every i (1 <= i...
Distinct Subsequences
SolveGiven two strings s and t, return the number of distinct subsequences of s which equals t.
Break a Palindrome
SolveGiven a palindromic string of lowercase English letters palindrome, replace exactly one character with any lowercase English letter so that the resulting string...
Reverse Nodes in k-Group
SolveGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent MathWorks interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
MathWorks interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. MathWorks interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
MathWorks has been reported to ask 28 distinct coding problems. The most common topics are array, string, dynamic-programming. 5 are Easy difficulty, 12 are Medium, and 11 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 28 reported problems, MathWorks interviews are significantly harder than average - 39% Hard vs 18% across all companies. 43% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real MathWorks coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a MathWorks interview with AIarrow_forward
