Jobra
🐞Step 1 of Jobra:AI Debugging Rounds
DSA+AIPreparing you for both.
JOBRA · AI DEBUG ROUND (PREVIEW)sum.cpp
// buggy snippet
int total(vector<int>& a, int n) {
    int sum = 0;
    for (int i = 0; i <= n; i++) { // 🐞        sum += a[i];
    }
    return sum;
}
A real codebase. A real bug. You + AI.

Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.

Prompt:Correct the loop condition
Tap 'Let Jobra fix it' below to simulate AI debugging...

MathWorks Engineering Development Group Interview Guide

28 min read

How the MathWorks EDG interview works: online assessment, group discussion, technical, managerial and HR rounds, from real candidate experiences.

In this article
On this page

How to Crack MathWorks: The Engineering Development Group Interview, From Real Experiences

Last reviewed November 20, 2026 · 21 min read · For campus new grads and interns applying to MathWorks' Engineering Development Group (EDG)

Built by the Codinzhub team. This guide is built from MathWorks Engineering Development Group (EDG) interview experiences that candidates shared, including posts on Codinzhub. The process changes by year, campus and team, so treat this as a map, not a promise.

The 30-second version. Candidates described an online assessment first: usually a 90-minute test with multiple-choice questions on aptitude, computer science and C, C++, Java or Python, plus 2 coding questions. Campus drives in India then moved to a group discussion, a technical interview of 50 minutes to 1.5 hours, a managerial round and an HR round. Forum posts describe a video interview, a manager call and a final virtual loop of about 4 hours with a 2-hour technical round. Technical rounds leaned on C++ and object-oriented programming. The habit that matters most: explain your approach and your resume projects out loud, because interviewers asked for reasoning, not only answers.

What this guide is, and what it is not

This guide is built from 24 candidate experiences of MathWorks' EDG interviews, covering 2021 to 2026. Ten are India campus reports, including all 6 shared on Codinzhub. Most of the other 14 are short Forum posts about the US-style process, so they describe format and timing more than questions.

It is:

  • A map of the process, stage by stage, as candidates described it
  • The question patterns that keep coming back, and the follow-ups to expect
  • A six-week plan and practice problems matched to those patterns

It is not:

  • A list of leaked questions or a promise of what you will be asked
  • An official description of MathWorks' process
  • An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.

Intern reports exist (4 in the data) but there are too few for a separate intern guide, so interns are covered in the level table.

Important things to know before you start

These are the MathWorks-specific facts that change how you prepare.

C and C++ fundamentals are the core of the technical round. Object-oriented programming (OOP) and C or C++ questions appeared in 7 of the 12 reports that described technical content: virtual functions, the diamond problem, abstract classes, malloc versus calloc, pointers and struct versus union. Practise predicting the output of short snippets and explaining why.

The coding answers may need two languages. Two older reports (2021 and 2021 to 2022) said the two OA coding questions had to be solved in two different languages. One 2025 intern said Python was not offered in the OA. Check the language list before you start.

Early rounds are eliminations. One 2026 campus report said every round eliminated candidates. Other reports described the group discussion and the three interviews as elimination rounds. Two reports said the three interviews ran in no fixed order, so do not assume the technical round comes first.

Round-by-round breakdown

Candidates described five stages: application, shortlisting, an online assessment, a group discussion followed by the interview rounds, and a decision.

Stage 1: Application, where candidates applied

Two routes appear in the data. All 6 Codinzhub reports and 4 other reports are on-campus drives in India. The Forum posts describe applying through MathWorks' careers site.

ChannelWhat candidates said
Campus drive10 reports. Four mention a company presentation before the interviews; the two that gave a length said about 30 minutes and about 90 minutes. One group discussion topic was based on it.
Careers siteForum posters applied online and got an assessment link. Three said the portal status changed to "Interview Process" after the assessment.

MathWorks' hiring page says you submit an application and receive a confirmation email with next steps. It lists full-time EDG roles and EDG internships as separate tracks.

What helped. Candidates credited knowing their resume projects well (2 reports) and paying attention to the pre-placement talk (one report used it in the group discussion).

Stage 2: Shortlisting, how candidates moved forward

For campuses, the online assessment was the first filter. In the US-style process, a video interview and a manager call came before the final loop.

  1. Campus filter. One report said 18 of 141 students were shortlisted after the online test. One said 14 were shortlisted for interviews and 2 were selected. One 2021 report said 50 students were shortlisted for the group discussion.
  2. Video interview (3 forum reports, plus MathWorks' hiring page). The initial skills assessment is an online assessment plus recorded video responses. Posters took the coding test and the video interview on consecutive days in one case. One poster listed the prompts: a time you faced a challenge, a time you showed leadership, your biggest weakness or area to improve, and whether you are authorized to work in the US.
  3. Manager call. One 2025 poster had a 30-minute call with a manager about a week after the assessment, mostly about skills and qualifications. A final-round email followed 2 days later. Another poster said that, in the previous cycle, people heard from MathWorks 3 to 4 weeks after the video interview; that is second-hand.

Waiting times varied: one 2026 poster had heard nothing for 5.5 weeks while the portal still said "Interview Process".

Stage 3: Online assessment

Every report that described the start of the process had an online assessment (OA, a timed online test). On campus it doubled as the shortlist.

Online assessment

How it works. The usual format was a 90-minute test on a platform such as HackerRank with sections for mathematics or aptitude, computer science fundamentals, C, C++ and Java, and a bonus Python section, followed by 2 coding questions. Two 2026 posters said the HackerRank test offered a choice between coding questions and a MATLAB multiple-choice section. One 2025 poster described the coding as easy to medium, with string manipulation and sliding-window topics. Test-case visibility and AI-tool rules are Not reported.

At a glance

  • Length: 90 minutes (5 of 5 reports that gave a length)
  • Questions: 2 coding questions in 8 of 11 reports, plus multiple-choice questions; the four reports that gave a total counted 42 to about 50 questions
  • What was asked: Arrays, strings, prefix sums, sorting, grid BFS and dynamic programming
  • Most common: No single repeated question
QuestionWhat it testsLevel
Maximum difference between increasing elements of an arraySingle pass, running minimumNew grad
Cherry PickupGrid dynamic programmingNew grad
Count elements of one array that are at most each element of anotherSorting plus binary searchNew grad
Longest word chain by deleting one character at a timeHashing, dynamic programming over stringsNew grad
Smallest k where the first k binary digits outweigh the restPrefix sumsNew grad
Fewest moves for a knight to reach a target squareBFS on a gridNew grad
Minimum swaps to sort an arrayCycle decomposition, sortingNot reported
Key held the longest, from pairs of key and release timeSimulation, arraysNot reported

See all MathWorks OA questions in the question bank. MathWorks OA questions shared on Codinzhub:

QuestionDriveTopic
Subarray SumIIT KharagpurPrefix sums
Cheapest Way to Wipe a Flagged Storage TapeIIT GuwahatiDP
Q1: Increasing ElementsIIT HyderabadGreedy
Q2: Initial ElementsIIT HyderabadArrays
Q3: Choose Exactly K IndicesIIT HyderabadDP, selection
Minimum Swaps to Sort Using ZeroIIT IndoreSorting, greedy
K-th Pair in a Cartesian ProductIIT IndoreHeap, counting
Minimum Number of Subsequences With a Majority ElementIIT BombayHashing, DP
Count Subarrays That Can Be Rearranged into PalindromesIIT BombayHashing
Maximize Beautiful SubstringsIIT BombayStrings
Closest Pair of Points in a 2D PlaneIIIT HyderabadGeometry, divide and conquer
Count Subarrays Whose Product Is a Perfect SquareIIIT HyderabadPrefix products
Maximum Elements Picked With At Most One SkipIIIT HyderabadDP

Full MathWorks interview experiences on Codinzhub: EDG intern, IIIT Hyderabad (2026), SDE intern, IIT Hyderabad (2026-2027).

More Codinzhub questions: Browse MathWorks questions.

Stage 4: Group discussion and the interview loop

At campus drives in India, shortlisted candidates joined a group discussion (9 of the 10 India reports), then three interviews: technical, managerial and HR. Two reports said those three came in random order. Forum posts describe a final loop of about 4 hours made up of a 2-hour technical interview with an EDG engineer, a manager interview and an HR interview, held on Microsoft Teams in one report. MathWorks' hiring page describes virtual interviews with the EDG team followed by an in-person visit for full-time roles; the Teams report differs, so confirm with your recruiter.

Group discussion

At a glance

  • Length: 15 minutes (2 reports); under 30 minutes (1 report)
  • Questions: One topic per group, in groups of 5 to 10 students
  • Themes: Teamwork, workplace skills, the EDG program, current affairs

Candidates spoke for about a minute each, then added to others' points; one 2021 group had three sub-rounds (opinions, innovative ideas, debate). Reports described it as an elimination round, so contribute early and listen to others.

QuestionWhat it testsLevel
Teamwork and individual workCommunication, structured opinionNew grad
Skills needed to grow in corporate lifeCommunication, group dynamicsNew grad
Explain your understanding of the EDG programListening, company knowledgeNew grad
Politics or demonetization as a discussion topicOpinion under a time limitNew grad
Social media: boon or baneOpinion, balanced argumentNew grad

Technical interview

At a glance

  • Length: 50 minutes to 1.5 hours on campus (5 reports); 2 hours in the US-style loop (2 reports)
  • Questions: Several short questions, with 3 to 4 coding questions in the four reports that counted them
  • What was asked: OOP and C++, pointers and memory, linked lists, trees and graphs, sorting, complexity
  • Most common: Walking through a resume project (7 of 12 reports); no single coding problem repeated

The round usually opened with introductions and projects. Interviewers often cared about approach and complexity more than perfect code: one report said the interviewer wanted the approach, and another said breadth-first search had to be explained. Two reports used a shared HackerRank-style editor to paste code and ask for output with reasons. In the US-style loop, two posters said the first technical round included a review of their OA solutions; one described three parts: resume and behavioral questions, the OA review, then about 30 minutes of LeetCode-medium coding.

QuestionWhat it testsLevel
Walk through a resume project and its technologiesProject depthNew grad
Friend functions, abstract classes and pure virtual functionsC++ OOPNew grad
Only Bike and Car objects from a Vehicle base classAbstract classesNew grad
Write code for virtual functions and the diamond problemVirtual inheritanceNew grad
Output of C and C++ snippets on malloc, calloc and one-line allocationDynamic memoryNew grad
Explain polymorphism with practical examplesOOPNew grad
Reverse nodes in a linked list in groups of kLinked list pointer manipulationNot reported
Maximum width of a binary treeLevel-order traversalNew grad
A LeetCode-medium graph problem (BFS or DFS)BFS, DFSNew grad and Intern
Explain your OA solutions, complexity and what you would change for a failed testExplaining approach and complexityNew grad and Intern

See all technical questions in the question bank.

Managerial round

At a glance

  • Length: 40 minutes to 1 hour (4 reports); 2 US-style reports gave 45 and 30 minutes
  • Questions: Situational and project questions
  • Themes: Leadership, deadlines, team conflict, time management, pressure, the EDG program

Interviewers asked for real-life examples and logical, calm answers. One report (published 2024) said the interviewer looked for leadership, communication, calmness, a positive mindset and accountability. Because one 2026 report said every round eliminated candidates, treat this round as scored.

Reported questions.

  • How would you lead a team, or when did you show leadership?
  • How do you handle a tight deadline or multiple deadlines?
  • How do you handle a problem or disagreement within your team?
  • How do you manage different tasks and your time?
  • How do you handle stress, pressure or a tough situation?
  • What do you know about EDG, and what could be its drawbacks?
  • Describe your part in a project, how you managed time and how you convinced teammates.
  • What do you do when you do not know the solution to a problem?

See all behavioral questions in the question bank.

HR round

At a glance

  • Length: 30 to 45 minutes (4 reports)
  • Questions: General HR and motivation questions
  • Themes: Why MathWorks, strengths and weaknesses, location, scenarios

One report (published 2024) combined the managerial and HR rounds into one 50 to 55 minute interview and received an on-spot offer. Another 2026 report described a single HR or managerial round about projects, teamwork and motivation.

Reported questions.

  • Why MathWorks?
  • What are your strengths and weaknesses?
  • Tell me about yourself.
  • Which location, Bangalore or Hyderabad, and why?
  • What would you do about an urgent task that clashes with personal plans?
  • How would you resolve a conflict between two team members?
  • How do you feel about working with new technologies?
  • What do you know about MathWorks and the role, and how would you rate your own technical round?

Stage 5: Decision and offer

Decisions were mostly reported as outcomes, not as a separate committee step. One candidate (report published 2024) received an offer on the spot after the combined managerial and HR round and declined it for another opportunity. One 2026 campus candidate was selected, and one was rejected after an interview process in which every round was an elimination. Team matching, hiring committees, level changes and compensation are Not reported in any of the 24 reports.

MathWorks experiences shared on Codinzhub

These are full-time EDG and software engineer experiences that candidates posted on Codinzhub. Links to the original posts: Not stated.

CollegeRole and resultWhat was asked
IIT DharwadAssociate in EDG, rejected, 2026OA: 2 coding questions plus about 50 MCQs. GD: random topic. Technical: 4 coding questions, virtual functions, diamond problem, OS. Managerial: lead a team, deadlines, team problems. HR: Why MathWorks, strengths, weaknesses.
NIT WarangalSDE, selected, 2026OA: DSA, aptitude, OOP, OS, DBMS. Technical: DSA, C and C++, projects. HR or managerial: projects, teamwork, strengths, weaknesses, why MathWorks.
Not statedEDG, offered and declined, report published 2024OA: aptitude, CS, C and C++. GD: the EDG program. Technical: Vehicle class design, friend functions, deep copy, null pointers. Managerial and HR: deadlines, disagreements, leadership.
Not statedEDG, outcome not reported, 2022OA: two coding questions. GD: teamwork. Technical: malloc, calloc, struct versus union, #define. Managerial and HR: disagreements, location.
Not statedFTE, outcome not reported, 2021OA: 44 questions, 2 coding. GD: corporate skills. Technical: polymorphism, DSA. Managerial: conflict, leadership. HR.
Not statedEDG, outcome not reported, 2021 to 2022OA: 45 questions, 2 coding. GD: 15 minutes. Technical: queue sorting, pointers, OS. Managerial and HR: pressure, location.

The Codinzhub Next-Round Playbook

Candidates who moved forward explained their reasoning, knew their own resume and kept answers calm and specific.

To get past the campus shortlist and OA

  • Prepare all sections. Reports had aptitude, CS fundamentals, C, C++, Java and a bonus Python section, not only coding.
  • Practise solving 2 coding questions in 2 different languages, as two older reports required.
  • Write your own edge cases. Test-case visibility is Not reported, so do not rely on it.

To get past the group discussion

  • Speak early and briefly, then build on others' points: reports describe a one-minute turn followed by added points.
  • Read about the EDG program before the talk. One group was asked to explain it.

To get past the technical interview

  • Know every project on your resume. 7 of 12 technical reports involved resume projects.
  • Say the approach and complexity out loud. Reports said interviewers cared about approach and asked you to justify time and space.
  • Revise C++ OOP: abstract classes, virtual functions, constructors, destructors, deep copy.
  • For US-style loops, re-solve your OA problems and be ready to explain failed cases.

To get past the managerial and HR rounds

  • Answer with real examples, as interviewers asked.
  • Prepare Why MathWorks and a location preference. Why MathWorks appeared in 4 reports and location in 3.
  • Treat it as scored. One report (published 2024) described what the interviewer looked for: leadership, communication, calmness and accountability.

How the loop differs by level

The loop is built from the same parts across levels; the difference is mostly the number of rounds and who runs them.

LevelWhat candidates describe
InternBased on 4 reports (2025). An online test and video interview, then a first technical round with an engineer. One report said it had three parts: resume and behavioral questions, a review of your OA solutions, then about 30 minutes of coding. A manager interview followed in one report. MathWorks' hiring page adds a recruiter conversation.
New grad and full-timeBased on 9 labelled reports plus 11 with no level. India campus: OA, group discussion, technical, managerial, HR. US-style: OA with video interview, a manager call, then a 2-hour technical interview, a manager interview and an HR interview. Two posts mention a testing (SDET) variant of the EDG role with the same loop shape.

No report describes a system design round at any level. One campus report asked for a class-design answer (abstract Vehicle class).

Most-asked topics

Across 12 reports that described technical content, questions concentrated on language fundamentals more than on algorithms. Dynamic programming was rare in interviews and appeared mainly in the OA.

TopicWhat it meansSeen inReported examples
OOP, C and C++Classes, inheritance, pointers, memory, output tracing7 of 12 reportsDiamond problem; Vehicle base class; malloc versus calloc
Arrays, strings, sorting and searchingBasic data structure problems and their complexity6 of 12 reportsMaximum difference between increasing elements; implement quick sort
Trees and graphsTraversals, BFS and DFS5 of 12 reportsMaximum width of a binary tree; detect a cycle in a graph
Memory, OS and concurrencyAllocation, padding, processes and locks4 of 12 reportsSemaphore versus mutex; inode and FAT
Linked listsPointer manipulation on lists3 of 12 reportsReverse nodes in groups of k; merge k sorted lists
Dynamic programmingBreaking a problem into overlapping subproblems3 of 12 reportsCherry Pickup; non-adjacent maximum sum
Complexity analysisStating and justifying time and space3 of 12 reportsSearch and insert costs across structures

The question patterns that keep coming back

Most questions fall into a handful of patterns; learn to recognise the pattern under the story.

1. OOP, C and C++ fundamentals

This is the most common technical theme: 7 of 12 reports. It appears as concepts (abstract classes, polymorphism), as design (a Vehicle base class that cannot be instantiated) and as output questions with reasons. If asked about instantiation limits, think abstract class; if asked about copying, think copy constructor and deep copy.

Reported examples. Friend functions, abstract classes and pure virtual functions; code for virtual functions and the diamond problem; struct versus union versus enum; #define versus const; a use for a null pointer.

2. Arrays, strings, sorting and searching

6 of 12 reports. These show up in the OA and as short coding questions. For counting against another array, think sorting plus binary search; for a best pair in order, think a running minimum.

Reported examples. Count elements of one array at most each element of another; smallest k where the first k digits outweigh the rest; implement quick sort; binary search code.

3. Trees and graphs

5 of 12 reports. If asked for fewest steps on a grid, use BFS; for cycle or reachability, use DFS.

Reported examples. Fewest moves for a knight; maximum width of a binary tree; detect a cycle in a graph; mirror a tree and print it level by level.

4. Memory, OS and concurrency basics

4 of 12 reports. Expect definitions and short outputs.

Reported examples. Integer size, word size and padding; inode and FAT; semaphore versus mutex; one-line allocation and deallocation.

5. Linked lists

3 of 12 reports, all older posts (2021 or not dated). Know pointer manipulation without a compiler's help.

Reported examples. Reverse nodes in groups of k; reverse a list; merge k sorted lists; remove the nth node from the end; the middle of a list.

6. Dynamic programming and complexity

3 of 12 reports each. Learn the basics: DP appeared in the OA as grid and string problems, and complexity was a standing follow-up.

Reported examples. Cherry Pickup; longest word chain; maximum sum with no two adjacent elements.

Preparing for the managerial and HR rounds

These are separate interviews with their own questions. One 2022 report said the interviewer wanted real-life examples.

Build your story bank. Prepare six real stories, each under two minutes, each ending in a result. Cover the themes candidates were asked about:

ThemeReported prompt (paraphrased)Follow-up to expect
LeadershipHow would you lead a team, or when did you show leadershipNot reported
DeadlinesA tight deadline or several at onceNot reported
Team conflictA disagreement with a mentor or teammateNot reported
PressureA tough situation or stressNot reported
MotivationWhy MathWorks, and what excites youNot reported
ProjectsYour part, challenges, time managementWhether it was solo or team

Structure each story. State the situation in one line, what you did, the result, and what you would change.

Expect depth. Reports describe these rounds as lasting 30 minutes to 1 hour, and one candidate called the combined round one of the longest HR interviews they had experienced.

A six-week plan

The plan follows the patterns above, most common first, and ends with timed mocks that feel like the real round. Plan on two to three focused hours a day.

  1. Week 1: OOP, C and C++. Abstract classes, virtual functions, constructors, destructors, deep copy. Drill predicting output and explaining why.
  2. Week 2: Arrays, strings, sorting and searching. Write the complexity for every solution.
  3. Week 3: Trees and graphs. Draw the structure before coding; say what BFS or DFS returns.
  4. Week 4: Memory, OS basics and linked lists. Allocation, padding, semaphore versus mutex; list pointer manipulation without running code.
  5. Week 5: Dynamic programming and complexity. Basics only: grid and 1D problems seen in the OA.
  6. Week 6: Mocks. Two timed 60-minute technical mocks in a plain online editor, plus one aptitude and MCQ practice set. Rehearse your stories out loud.

Interns can spend less time on week 4 and week 5. Full-time candidates should add a 90-minute OA mock.

Only two weeks? Spend 4 days on OOP and C++, 3 on arrays, strings and sorting, 3 on trees, graphs and linked lists, 1 on OS basics, and 3 on timed mocks and your stories. That is 14 days.

Practice problems that match these experiences

These are well-known practice problems that match the patterns above. They are not claims about MathWorks' question bank unless a row says the problem was asked as-is. C++ OOP and OS questions have no verified problem-page analogue; practise those by writing your own short programs.

#Practice problemPatternSeen in these experiences as
1Cherry PickupGrid dynamic programmingAsked as-is in one report
2Maximum Difference Between Increasing ElementsRunning minimumOA question with the same idea
3Longest String ChainHashing and string DPLongest word chain by deleting a character
4Min Steps by KnightBFS on a gridFewest moves for a knight
5Number of IslandsBFS or DFSA graph problem at medium level
6Maximum Width of Binary TreeLevel-order traversalMaximum width of a binary tree
7Invert Binary TreeTree recursionMirror a binary tree
8Reverse Nodes in k-GroupLinked list pointersAsked as-is in one report
9Remove Nth Node From End of ListTwo pointersAsked as-is in one report
10Merge k Sorted ListsHeap or divide and conquerMerge k sorted linked lists
11House Robber1D dynamic programmingMaximum sum with no two adjacent elements
12Task SchedulerGreedy countingAsked as-is in one report

How to handle a question you have never seen

Most technical rounds are several short questions rather than one long problem, so a repeatable method matters more than memorised solutions.

  1. Repeat the problem and one example. Type it into the shared editor so you and the interviewer agree.
  2. Say the brute force and its complexity. Interviewers asked for time and space justification in at least 3 reports.
  3. Name the bottleneck. Repeated lookups suggest a hash map; repeated searching suggests sorting plus binary search; shortest steps suggest BFS.
  4. Say when you are stuck. One report mentions needing a hint on an optimised power function.
  5. Code in small pieces while talking. In a shared editor you may not be able to run code, so write helpers first.
  6. Dry-run one case and fix the wrong line. Reports said interviewers cared about approach more than runnable code.

Common preparation mistakes

The data has one rejected report and it gave no reason, so this section is editorial advice drawn from what interviewers asked for, not from rejection feedback.

  • Skipping C++ fundamentals. 7 of 12 technical reports included OOP or C and C++ questions.
  • Not knowing your projects. 7 of 12 reports opened with resume projects.
  • Silent coding. Reports said interviewers wanted the approach explained.
  • Ignoring the group discussion. It appeared in 9 of the 10 India campus reports and was called an elimination round in several.
  • Treating managerial and HR as formalities. They were separate rounds of 30 minutes to 1 hour, and one candidate with an offer described the combined round as very long.

Selected vs. rejected: do this, not that

No candidate described a perfect interview. These rows pair habits from the reports with the mistakes they counter.

Do thisNot thatWhat the reports show
Explain approach and complexity: talk through trade-offsGive only the final answer: say nothing while codingOne selected 2026 candidate said they were asked to explain and optimise, not just answer.
Know your projects: one-minute summary of eachMemorise project titles: skip the design choices7 of 12 technical reports started with projects.
Use real examples: from teams, deadlines and conflictGive generic answers: with no situation behind themA 2022 report said the interviewer asked for real-life examples.
Be calm and logical in situational questions: explain the stepsRush to a quick answer: skip the reasoningOne 2026 candidate said the main thing is to explain your handling logically and calmly.
Contribute early in the group discussion: add to others' pointsWait to be called on: stay silentThree reports described the group discussion, or every round, as elimination.

If you remember only five things

  1. The process. An online assessment, then on campus a group discussion and technical, managerial and HR rounds; Forum posts describe a video interview, a manager call and a 4-hour virtual loop.
  2. The round format. The OA is usually 90 minutes with 2 coding questions; interviews are several shorter questions.
  3. The core habit. Explain your approach and your resume projects out loud.
  4. The core topics. OOP, C and C++ first, then arrays, strings, trees and graphs.
  5. The practice surface. A shared online editor, so practise tracing output and writing code by hand.

FAQ

Is there an online assessment?

Yes. MathWorks' hiring page lists it as the first step after applying, and all 11 reports that described the start of the process had one.

Do I need MATLAB?

Not for most of the evidence. One campus report asked whether you have used MATLAB, and two 2026 posters said the test offered a MATLAB multiple-choice option.

Do I need dynamic programming?

Learn the basics. It showed up in the OA (Cherry Pickup, a word chain) and in one technical question, but rarely in interviews.

Is system design asked?

No report describes a system design round. One class-design question about a Vehicle base class appeared in a campus report.

How long does it take?

Not established. One 2025 poster had a manager call about a week after the test and a final-round email 2 days later; another 2026 poster had waited 5.5 weeks with no update.

Is the interview virtual or in person?

It varied. One India report (published 2024) used a virtual group discussion room, one Forum poster described Microsoft Teams, and MathWorks' hiring page describes an in-person visit for full-time roles.

Which language should I use?

Six reports mention C or C++ questions. One candidate chose C and C++ for a technical round, and Python was not available in one 2025 intern OA.

Other company and role guides


About this guide

The Codinzhub team researched and wrote this guide from 24 MathWorks Engineering Development Group interview experiences, covering 2021 to 2026, including experiences shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems, not the exact interview questions. If you interviewed recently, share your experience on Codinzhub and we will update this guide.

Disclaimer. MathWorks' process changes by role, year, campus and office. Use this guide to build a foundation, and confirm the current format with your recruiter.

Search the question bank

The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.

Showing 20 of 109 questions

  • Subarray Sum

    A Mathworks online assessment question shared on Codinzhub (IIT Kharagpur).

    On CodinzhubIIT KharagpurPrefix sumsCodingOnline assessment
  • Cheapest Way to Wipe a Flagged Storage Tape

    A Mathworks online assessment question shared on Codinzhub (IIT Guwahati).

    On CodinzhubIIT GuwahatiDPCodingOnline assessment
  • Q1: Increasing Elements

    A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad).

    On CodinzhubIIT HyderabadGreedyCodingOnline assessment
  • Q2: Initial Elements

    A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad).

    On CodinzhubIIT HyderabadArraysCodingOnline assessment
  • Q3: Choose Exactly K Indices

    A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad).

    On CodinzhubIIT HyderabadDP, selectionCodingOnline assessment
  • Minimum Swaps to Sort Using Zero

    A Mathworks online assessment question shared on Codinzhub (IIT Indore).

    On CodinzhubIIT IndoreSorting, greedyCodingOnline assessment
  • K-th Pair in a Cartesian Product

    A Mathworks online assessment question shared on Codinzhub (IIT Indore).

    On CodinzhubIIT IndoreHeap, countingCodingOnline assessment
  • Minimum Number of Subsequences With a Majority Element

    A Mathworks online assessment question shared on Codinzhub (IIT Bombay).

    On CodinzhubIIT BombayHashing, DPCodingOnline assessment
  • Count Subarrays That Can Be Rearranged into Palindromes

    A Mathworks online assessment question shared on Codinzhub (IIT Bombay).

    On CodinzhubIIT BombayHashingCodingOnline assessment
  • Maximize Beautiful Substrings

    A Mathworks online assessment question shared on Codinzhub (IIT Bombay).

    On CodinzhubIIT BombayStringsCodingOnline assessment
  • Closest Pair of Points in a 2D Plane

    A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad).

    On CodinzhubIIIT HyderabadGeometry, divide and conquerCodingOnline assessment
  • Count Subarrays Whose Product Is a Perfect Square

    A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad).

    On CodinzhubIIIT HyderabadPrefix productsCodingOnline assessment
  • Maximum Elements Picked With At Most One Skip

    A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad).

    On CodinzhubIIIT HyderabadDPCodingOnline assessment
  • Maximum difference between increasing elements of an array

    Level: New grad.

    Single pass, running minimumCodingOnline assessment
  • Cherry Pickup

    Level: New grad.

    Grid dynamic programmingCodingOnline assessment
  • Count elements of one array that are at most each element of another

    Level: New grad.

    Sorting plus binary searchCodingOnline assessment
  • Longest word chain by deleting one character at a time

    Level: New grad.

    Hashing, dynamic programming over stringsCodingOnline assessment
  • Smallest k where the first k binary digits outweigh the rest

    Level: New grad.

    Prefix sumsCodingOnline assessment
  • Fewest moves for a knight to reach a target square

    Level: New grad.

    BFS on a gridCodingOnline assessment
  • Minimum swaps to sort an array

    Level: Not reported.

    Cycle decomposition, sortingCodingOnline assessment
Page 1 of 6

Keep preparing on Codinzhub

Ready for the next topic?

Keep track of what you’ve learned.