MathWorks Software Engineer Interview Questions & Rounds
How the MathWorks Software Engineer (EDG) interview works: HackerRank OA, GD, technical, managerial and HR rounds, from real candidate experiences.
On this page
How to Crack MathWorks: The Software Engineer Interview, From Real Experiences
Last updated November 20, 2026 · 27 min read · For campus interns and new grads joining the Engineering Development Group (EDG) in India
Built by the Codinzhub team. This guide is built from MathWorks Software Engineer (EDG) interview experiences that candidates shared, including OA questions on Codinzhub. The process changes by year, campus and track, so treat this as a map, not a promise.
The 30-second version. Every MathWorks Software Engineer (EDG) interview report here comes from an Indian campus drive. You start with a 90-minute HackerRank OA: 2 coding questions in most reports (3 on the November 2026 Codinzhub pages) plus aptitude, CS and C/C++/Java MCQs, with the two coding answers in two different languages in 8 of 14 reports. Shortlisted students then get a pre-placement talk about the EDG program, a 15- to 20-minute group discussion, and three interviews in any order: a technical round of about 60 to 65 minutes on OOP, C/C++ output questions and DSA in a shared HackerRank editor, a managerial round and an HR round. Results came the same day in two reports. The habit that matters most: know OOP and what your C++ code does, line by line, in both languages you pick.
What this guide is, and what it is not
This guide is built from 20 candidate experiences of MathWorks' Software Engineer (EDG) campus hiring in India: interview accounts from 2021 to 2026 and Codinzhub OA pages from November 2026. Most of the detailed interview accounts are from 2021 to 2023, so check each claim's year.
It is:
- A map of the campus process, stage by stage, as candidates described it
- The question patterns that keep coming back, from OOP and C++ output questions to OA problems
- 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.
- A guide for experienced or off-campus hires, which no record describes.
Important things to know before you start
These MathWorks-specific facts change how you prepare.
Two languages, not one. In 8 of 14 OA reports, the two coding answers had to be in two different languages, and in the technical interview three candidates picked two languages that the questions then followed. Two candidates were also asked to write some Python. Be fluent in a second language, not just your main one.
Language depth beats hard algorithms. OOP came up in 12 of 13 technical interviews, and predicting the output of pasted C/C++ code was the most repeated interview question (6 reports). Four reports rated the coding problems easy to medium, though some 2021 OA takers got hard dynamic-programming problems.
The company talk is part of the interview. The group discussion came straight after the pre-placement talk in 7 reports, and "what did you understand about EDG?" was asked in the managerial or HR round in 11 of 14 reports.
Round-by-round breakdown
Candidates described five stages: a campus drive, a shortlist set by the online test, the online assessment itself, an interview day (a pre-placement talk, a group discussion and three interviews), and the result, often on the same day.
Stage 1: Application, where candidates applied
Every one of the 20 records in this guide comes from an on-campus drive in India. No record describes a referral or an off-campus or experienced hire. This guide covers campus hiring into MathWorks' Engineering Development Group (EDG), which full-time engineers and interns join.
| Channel | What candidates said |
|---|---|
| Campus drive, full-time | Drives were reported in July 2022, August 2021 (four reports), November 2021, November and December 2023, and August and September 2026. |
| Campus drive, internship or internship plus full-time | Three drives hired for both tracks at once: full-time plus a 6-month internship, or internships and full-time roles together. Codinzhub OA pages show a further wave of drives from 4 to 9 November 2026, including an EDG intern drive at IIIT Hyderabad. |
| Track choice at the test | One 2021 candidate had to choose a Computer Science or a Core Engineering track for the test. |
What helped. One intern advised a strong resume with projects, internships and achievements, and knowing the company, its products and the EDG role before the drive.
Stage 2: Shortlisting, how candidates moved forward
No record describes a resume screen or recruiter call before the test. The online assessment (Stage 3) is the shortlist, and the interview day then starts with a company talk.
- The OA cut. Reported cuts: 141 students sat the test and 18 were shortlisted, with 15 more waitlisted (2023); more than 150 sat and 14 were shortlisted (2021); 22, about 25 and 45 students were shortlisted at other campuses; 50 went on to the group discussion at another; and 8 students were shortlisted in one intern drive.
- The pre-placement talk (PPT). On the interview day, MathWorks gave a talk about the company and the EDG program before the group discussion. Two reports put it at 30 minutes. In 7 of the 14 interview-day reports, candidates said to listen carefully, because the group discussion topic or later HR and managerial questions came from it.
- The interview day. After the group discussion, the technical, managerial and HR rounds came in any order, depending on which interviewer was free (6 of 14 reports). Four reports said every round was an elimination round.
Stage 3: Online assessment
Every campus candidate took an online assessment (OA), a timed test of multiple-choice questions (MCQs) and coding problems. No record describes a phone screen.
Online assessment
How it works. The 4 reports that name a platform say HackerRank. MCQ sections covered aptitude, CS fundamentals and programming languages: in 8 of 14 reports you attempted 2 of the C, C++ and Java sections (JavaScript was an option in some years), and in 8 of 14 there was an optional bonus Python section. In 8 of 14 reports, the two coding answers had to be written in two different languages. Test-case visibility and AI-tool rules were not reported.
At a glance
- Length: 90 minutes (11 of 11 reports that give a length).
- Questions: 2 coding questions plus MCQs in 12 of 17 records that give a count, up to a September 2026 full-time OA with about 50 MCQs. The 5 November 2026 Codinzhub pages that show a pattern list 3 coding questions, with 6 or 7 MCQs where MCQs are shown.
- What was asked: Aptitude (probability, permutations, time and distance), CS fundamentals (OS, DBMS, OOP, DSA), predict-the-output questions on C, C++ and Java, and 2 easy-to-medium coding problems.
- Most common: Maximum difference between increasing elements (3 reports from 2021 and 2022).
Two reports said the coding questions differed between candidates. One 2023 candidate passed 8 of 13 tests on the second problem and was still shortlisted. One intern test was not proctored and had negative marking.
| Question | What it tests | Level |
|---|---|---|
| Maximum difference between increasing elements (later minus earlier) | Single pass tracking the running minimum | New grad, Intern |
| Longest word chain where each step deletes one character | DP over words sorted by length | New grad, EDG (level not stated) |
| Cherry Pickup on a grid | Grid DP with two walkers | New grad |
| Minimum knight moves to reach a target square | BFS on a grid | EDG (level not stated) |
| Shortest maze path for Tom to reach Jerry, covering every cheese cell | BFS over (cell, collected set) states | New grad |
| Predict-the-output and syntax MCQs on C, C++ and Java code | Reading code precisely, C++ OOP and STL | New grad, Intern, New grad (postgrad) |
OA questions shared on Codinzhub. These 2026 pages show only the title, college and date publicly, so the topic is Not reported.
| Question | Drive | Topic |
|---|---|---|
| Maximum Elements Picked With At Most One Skip | IIIT Hyderabad, 4 November 2026 | Not reported |
| Count Subarrays Whose Product Is a Perfect Square | IIIT Hyderabad, 4 November 2026 | Not reported |
| Closest Pair of Points in a 2D Plane | IIIT Hyderabad, 4 November 2026 | Not reported |
| Minimum Number of Subsequences with a Majority Element | IIT Bombay, 4 November 2026 | Not reported |
| Count Subarrays That Can Be Rearranged into Palindromes | IIT Bombay, 4 November 2026 | Not reported |
| Maximize Beautiful Substrings | IIT Bombay, 4 November 2026 | Not reported |
| Minimum Swaps to Sort Using Zero | IIT Indore, 5 November 2026 | Not reported |
| K-th Pair in a Cartesian Product | IIT Indore, 5 November 2026 | Not reported |
| Cheapest Way To Wipe A Flagged Storage Tape | IIT Guwahati, 7 November 2026 | Not reported |
| Q1: Increasing elements | IIT Hyderabad, 9 November 2026 | Not reported |
| Q2: Initial elements | IIT Hyderabad, 9 November 2026 | Not reported |
| Q3: Choose exactly k indices from two arrays | IIT Hyderabad, 9 November 2026 | Not reported |
| Subarray sum | IIT Kharagpur, date not shown | Not reported |
See all MathWorks OA questions in the question bank.
Stage 4: The interview day
After the pre-placement talk came a group discussion (GD), then technical, managerial and HR interviews in whatever order interviewers were free. Managerial and HR were separate rounds in 11 of 14 reports and one combined round in 2; one 2022 intern drive had only an HR interview after the GD. No record describes a system design round.
Group discussion
At a glance
- Length: 15 to 20 minutes in 8 of 11 reports that give a length (10 to 30 minutes overall).
- Format: One topic per group; groups of 5 or 6 in 5 of the 7 reports that give a size. In 5 reports the talk ran in 2 or 3 sub-rounds: state a view, then add to others' points or debate.
- What was asked: The EDG program itself, or a general topic.
- Most common: Your understanding of the EDG program (6 of 14 reports).
The GD cut candidates in four reports (from 22 to 11 at one campus, from 45 to about 26 at another); in two reports nobody was eliminated. A 2026 candidate got "a random topic".
Reported prompts.
- Your understanding of the EDG program, what you like about it, its challenges and the top 3 reasons to join
- Teamwork versus individual work, and the qualities a good team player needs
- The skills you need to grow and excel in corporate life
- Does India need more new IITs? (for or against)
- Blended (online plus classroom) education in the pandemic era
- Current-affairs topics such as politics and demonetisation
Technical interview
At a glance
- Length: 60 to 65 minutes in 6 of 10 reports that give a length (30 to 90 minutes overall).
- Questions: Resume projects (8 of 13 reports, usually first), then OOP and C/C++ questions, then 1 to 4 DSA problems as code or pseudocode (DSA in 11 of 13).
- What was asked: OOP in C++ or Java in 12 of 13 reports, predicting the output of code, memory and pointers, operating systems (4 reports) and DSA.
- Most common: Predict the output of C/C++ snippets, with reasons (6 reports), then runtime polymorphism in code (5 reports).
The coding surface was a shared HackerRank editor (CodePair or code-share) in 7 of 13 reports. Three candidates picked two languages first and the questions followed that choice. Interviewers asked for the time and space complexity of each approach (3 reports), and two reports said pseudocode or the approach was enough. The 2026 Associate candidate had 4 easy-to-medium coding questions, then OOP code for virtual functions and the diamond problem.
| Question | Follow-up | Level |
|---|---|---|
| Predict the output of C/C++ snippets pasted into the editor, with reasons | Why the output is what it is, line by line | New grad, New grad (postgrad), EDG (level not stated) |
| Explain polymorphism, then show runtime polymorphism in code | Not reported | New grad |
| Implement multiple inheritance and resolve the diamond problem | Why Java does not support it directly | New grad, New grad (postgrad), Associate (campus) |
| Virtual and pure virtual functions, abstract classes and friend functions | Not reported | New grad, New grad (postgrad) |
| Dynamic memory: malloc vs calloc vs realloc, then allocate a 2D array | Not reported | New grad, EDG (level not stated) |
| Maximum sum with no two adjacent elements (House Robber) | Operator precedence, the interviewer's test cases, how you would debug | New grad, EDG (level not stated) |
| Create an object of a class whose only constructor is private | An array of child objects in the static function, then runtime polymorphism | New grad, New grad (postgrad) |
| Reverse a linked list in groups of k | Not reported | New grad |
Managerial and HR rounds
At a glance
- Length: Managerial 30 to 75 minutes (9 reports); HR 10 to 45 minutes (9 reports); the one combined round with a stated length took 50 to 55 minutes.
- Questions: Two separate rounds in 11 of 14 reports; one combined round in 2.
- Themes: The EDG program, projects, conflict, deadlines, pressure, leadership, strengths, location and why MathWorks.
- Most common: What did you understand about the EDG program from the PPT? (11 of 14 reports).
Both rounds were mostly behavioral, and three reports said interviewers wanted real examples from your own life. Four reports said every round on the day was an elimination round.
Reported questions.
- What did you understand about MathWorks and the EDG program from the PPT?
- A project deep dive: why that topic, team or solo, the challenges, then your professor's feedback
- Location preference, Bangalore or Hyderabad, and why
- Why MathWorks? One candidate with an internship elsewhere was asked why not stay there
- A conflict with a teammate or mentor, and how you resolved it
- Many tasks with near deadlines: how do you prioritise and manage your time?
- Strengths and weaknesses, and what you are doing about the weaknesses
- A time you showed leadership, or how you would lead a team
See all questions by round in the question bank.
Stage 5: Result and offer
Result. In the two reports that describe timing, decisions came fast. One 2023 candidate got an offer on the spot from HR at the end of the combined managerial and HR round, and one 2022 intern drive published its final list a few hours after the HR interviews. No record describes a hiring committee, a team-matching step or a level change after the interview day.
How many were picked. Final selections were small: 1 student at one campus, 3 at another (internship and full-time roles), 3 full-time with a 6-month internship plus 5 interns at a third, 3 of 25 at a fourth, and 5 full-time at a fifth. One intern drive selected 7 of 8 shortlisted students. The one 2026 candidate who was rejected gave no reason.
After you join. MathWorks' EDG careers page describes mentoring, technical coaching and leadership development, and the flexibility to explore different teams. Compensation is not covered here, because no source we could read gave it.
The Codinzhub Next-Round Playbook
Candidates who moved forward knew their two languages in depth, had listened to the company talk, and backed answers with real examples.
To get past the OA cut
- Practise coding the same problem in two languages. In 8 of 14 reports, the two coding answers had to be in different languages.
- Revise C, C++ and Java output questions and OOP, plus OS, DBMS and basic probability for the MCQs.
- Submit partial solutions. One 2023 candidate passed 8 of 13 tests on the second problem and was still shortlisted.
To get past the PPT and group discussion
- Take notes in the pre-placement talk on what EDG is and why you want it. The GD topic was the EDG program in 6 of 14 reports.
- Speak early, then build on others' points; 5 reports describe 2 or 3 sub-rounds ending with added inputs or a debate.
To get past the technical interview
- Know your projects: 8 of 13 technical interviews covered the resume, usually first.
- Say the output of a snippet line by line, with the reason (asked in 6 reports).
- Write OOP code, not just definitions: runtime polymorphism, an abstract base class, a private constructor with a static factory.
- Give the approach and complexity first. Write explicit checks such as
if (root != NULL), as one selected candidate advised.
To get past the managerial and HR rounds
- Answer with real examples; three reports said interviewers asked for them.
- Have a location preference (Bangalore or Hyderabad) with a reason; it was asked in 8 of 14 reports.
- Be ready to explain the EDG program again (11 of 14 reports).
How the loop differs by level
All the evidence is campus hiring, so the loop barely changes by level. What changes is the number of interviews and how deep the language questions go.
| Level | What candidates describe |
|---|---|
| EDG intern (campus) | Based on three records. A 90-minute HackerRank OA: 2 medium coding questions plus aptitude and pseudocode sections in one report, and 3 coding questions plus 6 or 7 MCQs on the 2026 IIIT Hyderabad Codinzhub page. Then a GD on the EDG role, and HR, managerial and a 90-minute technical round in any order. One 2022 intern drive had only an OA, a GD and an HR round, and 7 of 8 shortlisted students were selected. No system design. |
| Full-time EDG Engineer or Associate (new grad) | Based on nine records: seven full-time campus reports from 2021 and 2022, and two 2026 campus records titled Associate and SDE. OA, PPT, GD, then technical, managerial and HR rounds, separate in most reports. Example questions: predict the output of C/C++ snippets; explain and code runtime polymorphism; House Robber; multiple inheritance and the diamond problem. No system design. |
| Postgrad with work experience (campus) | Based on one 2023 record from a postgraduate student with a year of industry work. Same OA and GD, then a 65-minute technical round that went deep into Java (garbage collection, threads, synchronized) and C++ (pure virtual functions, deep copy, nullptr), and one combined managerial and HR round of 50 to 55 minutes that probed the work experience. No system design. |
Seven records do not state a level (an EDG drive from 2019 or earlier, one undated EDG article, and five Codinzhub OA pages, four dated November 2026, that do not show the role). No record describes an experienced or lateral hire in India.
Most-asked topics
Across 14 reports that described the OA or the technical interview, questions concentrated on programming-language fundamentals more than on algorithms. Aptitude MCQs (11 of 14) and an optional Python section (8 of 14) also appeared in most OAs. The surprise: OOP and C/C++ behaviour came up more often than any algorithm topic.
| Topic | What it means | Seen in | Reported examples |
|---|---|---|---|
| OOP in C++ and Java | Classes, inheritance, polymorphism, virtual functions, constructors | 14 of 14 reports | Runtime polymorphism in code; multiple inheritance and the diamond problem; only Bike and Car objects from a Vehicle base |
| C and C++ semantics | What code prints, pointers, memory allocation, language rules | 10 of 14 reports | Predict the output of pasted snippets; malloc vs calloc vs realloc; #define vs const |
| Operating systems and Java runtime | Memory, scheduling, deadlock, threads, garbage collection | 10 of 14 reports | Paging and virtual memory; deadlock and semaphores; Java garbage collection |
| Arrays, DP and greedy counting | Single passes, dynamic programming, counting tricks | 9 of 14 reports | Maximum difference between increasing elements; House Robber; Task Scheduler |
| Trees and graphs (DFS, BFS) | Traversals, searching, connected regions | 7 of 14 reports | Number of islands; sum of leaf nodes; minimum knight moves |
| Linked lists, stacks and queues | Pointer manipulation and building one structure from another | 5 of 14 reports | Reverse a linked list in groups of k; queue using stacks; sort a queue without extra space |
The question patterns that keep coming back
MathWorks campus interviews test whether you understand the languages you write, not only whether you can solve puzzles. Most questions fall into six patterns.
1. OOP in C++ and Java: polymorphism, inheritance, virtual, constructors
The most common pattern: OOP came up in all 14 OA and technical-interview reports. Interviewers ask you to write the classes, then change a constraint. If the question says "only these objects may exist", use an abstract base class or a private constructor with a static factory. If it says "call the right version at run time", use a virtual function in C++ or an overridden method in Java. If it says "two parents", talk about the diamond problem, virtual inheritance and Java interfaces.
Reported examples. Runtime polymorphism in code (5 reports); multiple inheritance and the diamond problem (4 reports); only Bike and Car objects from a Vehicle base class; an object of a class with a private constructor; a deep-copy constructor.
2. C and C++ semantics: output prediction, pointers and memory
Interviewers pasted short programs into the editor and asked what they print, and why, in 6 reports, and the OA has the same idea as MCQs. Trace by hand: which constructor runs, whether a copy is shallow, what sizeof gives, and whether the code compiles at all. For memory questions, say who allocates, who frees and what happens on failure.
Reported examples. Predict the output of C/C++ snippets; malloc vs calloc vs realloc, then a 2D array; #define vs const and struct vs union vs enum; when setting a pointer to nullptr helps.
3. Operating systems and Java runtime
OS questions appeared as OA MCQs in most reports and in 4 technical interviews; Java-runtime questions came when candidates chose Java. Separate paging (fixed-size pages) from segmentation (variable logical units). For concurrency, define the race, then the lock or semaphore that prevents it, then the conditions for deadlock.
Reported examples. Deadlock and semaphores; paging and virtual memory; CPU schedulers; Java garbage collection; Java threads and synchronized.
4. Arrays, DP and greedy counting
The core of the OA, and present in some interviews. If each answer depends on the best value so far, keep a running minimum in one pass. If choosing index i rules out i+1, write the take-or-skip recurrence. If identical items need spacing, count the most frequent item first.
Reported examples. Maximum difference between increasing elements (3 reports); longest word chain (2 reports); House Robber (2 reports); Task Scheduler.
5. Trees and graphs (DFS, BFS)
Seen in 7 of 14 reports, usually as short problems with a dry run. Use BFS for the fewest steps, DFS for connected regions or cycles, and a recursive traversal that returns a value to the parent for tree sums.
Reported examples. Number of islands; sum of all leaf nodes; maximum width of a binary tree; minimum knight moves.
6. Linked lists, stacks and queues
Seen in 5 of 14 reports, often as pseudocode. Draw the pointers first. Use slow and fast pointers for the middle node or the nth node from the end.
Reported examples. Reverse a linked list in groups of k; remove the nth node from the end; a queue using stacks; sort a queue without extra space.
Preparing for the managerial and HR rounds
The managerial and HR rounds are elimination rounds like the technical one (see Stage 4), and three reports said interviewers wanted real examples from your own life. Prepare stories, not opinions.
Build your story bank. Prepare six to eight real stories, each under two minutes, and know the EDG program well enough to talk about it for a few minutes. Cover the themes candidates were asked about:
| Theme | Reported prompt (paraphrased) | Related prompt or follow-up |
|---|---|---|
| EDG and MathWorks | What did you understand about EDG from the PPT? Why MathWorks? | Why not stay with your internship company? |
| Projects | A project you are proud of, and your part in it | Challenges, team or solo, your professor's feedback |
| Conflict | A disagreement with a teammate or mentor | Two teammates clash in a discussion: how do you respond? |
| Deadlines and priorities | Many tasks with near deadlines | Urgent work clashes with your weekend plans |
| Pressure | A time you were close to a deadline or under stress | Not reported |
| Leadership and initiative | A time you led a team, or an initiative you started | Not reported |
| Self-awareness | Strengths, weaknesses and areas to improve | Both personal and technical areas |
| Fit and logistics | Bangalore or Hyderabad, and which team or domain you want | The reason for each choice |
Structure each story. Use the STAR shape, which one 2023 candidate recommended: the situation in one line, the task, what you did, and the result. Then say what you learned. That candidate also warned not to bluff when you have no real example.
Expect depth. One report warned of cross-questions on every answer and advised never giving contradicting statements. One intern's HR interviewer also asked technical questions about the CV, so do not list a skill you cannot explain.
A six-week plan
The plan follows the patterns above, most common first, and ends with timed mocks that feel like the real day. Plan on two to three focused hours a day.
- Week 1: OOP in C++ and Java. Classes, constructors and destructors, copy constructors and deep copy, inheritance and the diamond problem, virtual and pure virtual functions, abstract classes and interfaces, private constructors with a static factory. Habit: write each concept as a 10-line program, not as a definition.
- Week 2: C and C++ semantics. Pointers, sizeof, malloc, calloc and realloc, struct vs union vs enum, #define vs const, static and const keywords, nullptr. Habit: predict the output of 10 short snippets a day and check them by running them.
- Week 3: Arrays, DP and greedy counting. Running minimum or maximum, prefix sums, take-or-skip DP (House Robber), word-chain DP, counting for scheduling. Habit: solve each problem twice, in your two chosen languages.
- Week 4: Operating systems and the Java runtime. Paging, segmentation, virtual memory, schedulers, race conditions, deadlock and semaphores; Java garbage collection, threads and synchronized if Java is one of your languages. Habit: explain each topic out loud in two minutes.
- Week 5: Trees, graphs, linked lists, stacks and queues. Tree sums and widths, BFS for fewest steps, DFS for islands and cycles, reversing a list in groups of k, a queue from two stacks. Add aptitude practice for the OA. Habit: dry-run each solution on one example by hand.
- Week 6: Mocks. Take two timed 90-minute OAs with 2 or 3 coding problems in two different languages. Do three 60-minute mock interviews in a shared online editor: resume, then OOP and output questions, then one DSA problem. Rehearse the EDG program and your stories out loud for the GD and the managerial and HR rounds.
Interns can spend less time on Java internals and more on OA practice. Postgraduates with work experience should expect deeper language questions.
Only two weeks? Spend four days on OOP in your two languages, three days on C and C++ output and memory questions, three days on array and DP problems in two languages, one day on OS basics, and three days on timed OAs, mock interviews and the EDG talk and stories.
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. The three most common patterns (OOP, C and C++ semantics, operating systems) have no good problem pages, so practise them with the week 1, 2 and 4 habits in the plan.
| # | Practice problem | Pattern | Seen in these experiences as |
|---|---|---|---|
| 1 | Maximum Difference Between Increasing Elements | Arrays, running minimum | Asked as-is in the OA in one 2022 report; two more reports describe the same problem |
| 2 | House Robber | DP, take or skip | Asked as-is in a 2022 technical interview; an older report asked the same no-two-adjacent sum |
| 3 | Longest String Chain | DP over words | Asked as-is in the OA (2 reports) |
| 4 | Task Scheduler | Greedy counting | Asked as-is in a 2021 technical interview |
| 5 | Number of Islands | Trees and graphs, DFS | Asked as-is in a 2021 technical interview |
| 6 | Minimum steps to reach target by a Knight | Trees and graphs, BFS | Asked as-is in an older OA |
| 7 | Maximum Width of Binary Tree | Trees, level order | Asked as-is in a 2021 technical interview |
| 8 | Reverse Nodes in k-Group | Linked lists | Asked as-is in a 2021 technical interview (pseudocode) |
| 9 | Implement Queue using Stacks | Stacks and queues | Asked as-is in a 2022 technical interview |
| 10 | Sorting a Queue without extra space | Queues | Asked as-is in an older technical interview |
| 11 | Shortest Path to Get All Keys | BFS over (cell, collected set) states | Similar to the OA maze where Tom must collect every cheese before reaching Jerry |
| 12 | Fraction Addition and Subtraction | Parsing and GCD | Similar to the OA problem that adds two fractions from a string and reduces the result |
How to handle a question you have never seen
Interview questions here are short and varied, often a new OOP twist or a snippet you have never read, so a repeatable method matters more than memorised answers.
- Repeat the problem and one example. Type the example into the shared HackerRank editor so you and the interviewer agree on it.
- Say the brute force and its complexity. Interviewers asked candidates to justify time and space complexity in three reports.
- Name the bottleneck. Repeated lookups suggest a hash map; repeated ranges suggest prefix sums; a best-so-far value suggests one pass with a running minimum; "only these objects may exist" suggests an abstract class or a private constructor.
- Say when you are stuck. One candidate who took time to work out how to create an object with a private constructor got a hint to use a static function.
- Code in small pieces while talking. Two reports said pseudocode or a clear approach was enough, so agree on the level of detail before you write.
- Dry-run one case and fix the wrong line. One 2021 interviewer asked for a dry run and then an optimisation, and another gave test cases to check the code.
Why candidates were rejected
Only one report in this dataset ends in a rejection, and it gives no reason, so what follows is where candidates said people dropped out and what they found hard. Treat these as candidate observations, not MathWorks' reasons.
- Not clearing the OA cut. The test was the biggest filter. In two reports, 18 of 141 students and 14 of more than 150 students reached the interviews.
- Being cut in the group discussion. The GD eliminated candidates in four reports: from 22 to 11, 7 cut at one campus, 2 of 6 in one group, and from 45 to about 26.
- Hard OA problems. One 2021 candidate said some classmates got hard dynamic-programming problems in the OA and struggled with them.
- Getting stuck on a C++ construction question. One candidate could not see how to create an object of a class with a private constructor until the interviewer hinted at a static function.
- Unpractised output questions. One selected candidate warned that C, C++, pointer and static-keyword output questions look confusing without enough practice.
- A 2026 rejection with no stated reason. The 2026 Associate candidate went through all five elimination rounds and was rejected. The report does not say which round decided it.
Selected vs. rejected: do this, not that
With only one rejected report, this table is built mostly from what selected candidates said helped them. Each row is a habit you can practise this week.
| Do this | Not that | What the reports show |
|---|---|---|
| Treat the PPT as prep: take notes on EDG and be ready to discuss it | Skipping or half-listening to the talk | In 7 of 14 interview-day reports, candidates said the GD or later rounds asked about the PPT. |
| Know OOP in your two languages: concepts and syntax, written as code | Definitions only | OOP came up in 12 of 13 technical interviews, often as code to write. One 2023 candidate said to know OOP in detail in both chosen languages. |
| Drill output questions: trace snippets by hand and say why | Guessing the output | Output prediction was the most repeated interview question (6 reports). One selected candidate said these questions look confusing without practice. |
| Practise DSA in a second language | Coding everything in one language | 8 of 14 OA reports required the two coding answers in two different languages. |
| Explain and optimise: give your approach, its complexity, then improve it | Jumping to a final answer | Interviewers asked for approaches and optimisation in 2 reports and complexity justification in 3. |
| Answer with real examples, using STAR | Generic or invented stories | Three reports said interviewers wanted real-life examples. One candidate warned that bluffing may backfire. |
If you remember only five things
- The process is an OA, then one interview day. A 90-minute HackerRank OA, then a pre-placement talk, a group discussion, and technical, managerial and HR rounds in any order.
- The OA wants two languages. 2 coding questions (3 on the November 2026 Codinzhub pages) plus aptitude, CS and language MCQs, with the two coding answers in different languages in 8 of 14 reports.
- The technical round is about language depth. OOP in 12 of 13 technical interviews, and output prediction on C/C++ code was the most repeated question.
- Listen to the PPT. The EDG program was the most common GD topic and was asked about in the managerial or HR round in 11 of 14 reports.
- Answer behavioral questions with real stories. Conflict, deadlines, pressure, leadership and location preference came up again and again.
FAQ
Does everyone take an online assessment?
Yes for campus hiring in this data: every record with process detail starts with the OA. No record describes an off-campus or experienced-hire route, so we cannot say how those work.
How many coding questions are in the OA?
It depends on the year. 12 of 17 records that give a count had 2 coding questions, including a September 2026 full-time OA. The 5 Codinzhub OA pages from November 2026 that show a pattern list 3 coding questions.
Do I need to know MATLAB?
No record says MATLAB was required. MathWorks' EDG careers page says you do not have to be a MATLAB expert. One intern OA offered a choice of a bonus MATLAB or Python section.
Is system design asked?
No record describes a system design round. Design questions were small class-design tasks inside the technical interview, such as allowing only Bike and Car objects from a Vehicle base class.
How long does it take?
The interview day itself is one day, and two reports describe a result the same day or a few hours later. One 2023 candidate took the OA on 7 November and interviewed on 1 December. No record gives a full end-to-end timeline.
Will the interviewer help me?
Sometimes. One candidate got a hint to use a static function, and two reports said a clear approach or pseudocode was enough in the technical round.
About this guide
The Codinzhub team researched and wrote this guide from 20 MathWorks Software Engineer (EDG) interview experiences, mostly from 2021 to 2026, including experiences and OA questions shared on Codinzhub. We kept only what candidates described, and we marked older reports by year. The questions are our own short summaries, and the practice links are similar problems, not the exact interview questions unless a row says so. If you interviewed recently, share your experience on Codinzhub and we will update this guide.
Disclaimer. MathWorks' process changes by role, year and campus. Use this guide to build a foundation, and confirm the current format with your placement cell or 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 101 questions
Maximum Elements Picked With At Most One Skip
A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad, 4 November 2026).
Count Subarrays Whose Product Is a Perfect Square
A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad, 4 November 2026).
Closest Pair of Points in a 2D Plane
A Mathworks online assessment question shared on Codinzhub (IIIT Hyderabad, 4 November 2026).
Minimum Number of Subsequences with a Majority Element
A Mathworks online assessment question shared on Codinzhub (IIT Bombay, 4 November 2026).
Count Subarrays That Can Be Rearranged into Palindromes
A Mathworks online assessment question shared on Codinzhub (IIT Bombay, 4 November 2026).
Maximize Beautiful Substrings
A Mathworks online assessment question shared on Codinzhub (IIT Bombay, 4 November 2026).
Minimum Swaps to Sort Using Zero
A Mathworks online assessment question shared on Codinzhub (IIT Indore, 5 November 2026).
K-th Pair in a Cartesian Product
A Mathworks online assessment question shared on Codinzhub (IIT Indore, 5 November 2026).
Cheapest Way To Wipe A Flagged Storage Tape
A Mathworks online assessment question shared on Codinzhub (IIT Guwahati, 7 November 2026).
Q1: Increasing elements
A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad, 9 November 2026).
Q2: Initial elements
A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad, 9 November 2026).
Q3: Choose exactly k indices from two arrays
A Mathworks online assessment question shared on Codinzhub (IIT Hyderabad, 9 November 2026).
Subarray sum
A Mathworks online assessment question shared on Codinzhub (IIT Kharagpur, date not shown).
15
A Mathworks online assessment question shared on Codinzhub.
16
A Mathworks online assessment question shared on Codinzhub.
17
A Mathworks online assessment question shared on Codinzhub.
18
A Mathworks online assessment question shared on Codinzhub (nitial elements: Codinzhub OA page (paywalled).
19
A Mathworks online assessment question shared on Codinzhub.
20
A Mathworks online assessment question shared on Codinzhub.
21
A Mathworks online assessment question shared on Codinzhub.
Keep preparing on Codinzhub
- MathWorks interview questions and experiences — OA questions and interview experiences candidates shared for MathWorks.
- Browse MathWorks online assessment questions — filter the Codinzhub question bank by company.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- Adobe Software Engineer interview guide — the Adobe process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.