Coding questions
MathWorks Online Assessment
Overview
Here is how public prep guides and student write-ups describe the MathWorks online assessment. This is not an official company brochure.
EDG process mixes OA, GD, HR, managerial, and technical - often not in a fixed order.
Usual selection rounds
Rounds students usually mention: Online assessment → Group discussion → HR → Managerial → Technical (order can vary; knockout)
| Item | From student reports |
|---|---|
| Platform | HackerRank (intern account: non-proctored ~1.5h) |
| Online test summary | Aptitude + coding (2 medium) + pseudocode (C/C++/Java basics). |
| Eligibility notes | Drive-specific |
| Branches (reported) | CS track or Core Engineering track - choose one |
Online test sections
| Section | Questions | Time | Notes |
|---|---|---|---|
| Aptitude | - | part of ~1.5h | Profit/loss, interest, ratios etc. |
| Coding | 2 medium | - | - |
| Pseudocode | - | - | C/C++/Java basics |
Extra notes from sources
- PPT content can be quizzed later - GFG FTE account stresses watching the PPT.
Sample practice question styles
These are practice questions for speed - not claimed to be from a real MathWorks live paper.
Coding Q1: Coin change (min coins)
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
MathWorks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q2: Binary search
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
MathWorks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q3: Move zeros
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
MathWorks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Coding Q4: Rotate array
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
MathWorks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Prep tips from those student reports
- Watch the PPT
- C/C++ fundamentals + medium DSA
- Be conversational in managerial/HR
Sources
- MathWorks EDG Interview Experience (On-Campus) - GFG (gfg)
- MathWorks Interview Experience for EDG Intern - GFG (gfg)
These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.