MathWorks Interview Questions, Process, and Tips for Freshers

Round duration - 90 mins
Round difficulty - Medium

- timing was 5:00 AM in the morning
- 2 coding questions and 10 MCQ
- MCQ tested variety of concepts like Database management, OOPS, pointers and C

Q1. Car Pooling
You are working as a cab driver. Your car moves in a straight line and moves toward the forward direction only. Initially, you have ‘C’ empty seats for the passengers.
Now, you are given ‘N’ ...read more
Ans. 
Build an array add the number at entry index and subtract the number at exit index. after constructing the array, make 2 variables max and cur. cur stores the maximum sum of currently and max stores the maximum sum encountered till now.
Answered by CodingNinjas
Add your answer
Q2. Distance Of Nearest Cell Having 1 In A Binary Matrix
You have been given a binary matrix 'MAT' containing only 0’s and 1’s of size N x M. You need to find the distance of the nearest cell having 1 ...read more
Ans. 
This is solved by an algorithm called multisource bfs, add all the land cells in a queue then apply bfs to find shortest distance of all water cells.
Answered by CodingNinjas
Add your answer

Round duration - 30 mins
Round difficulty - Easy

Round was technical + HR round

Q1. Basic HR questions
Was asked questions about my project, utility and problems faced and general HR type questions
Ans. 
Tip 1 : be confident while speaking
Tip 2 : Don't take it as an interview take it as a conversation
Tip 3 : When the interviewer asks if you have any questions, never say no always ask something
Answered by CodingNinjas
Add your answer

Math, Core CS concepts, DSA

GD on the EDG program at Mathworks

Q1. Stress on a specialised project based on your resume and choose location accordingly
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing: The test was conducted at around 6pm.

Q1. Optimal Strategy for a Game
You and your friend Ninjax are playing a game of coins. Ninjax place the 'N' number of coins in a straight line.
The rule of the game is as follows:
1. Each coin has...read more
Ans. 
This was a medium level DP problem which I was able to solve after some thinking.
Answered by CodingNinjas
Add your answer
Q2. Convert Bst To The Greater Sum Tree
You have been given a Binary Search Tree of integers. You are supposed to convert it to a greater sum tree such that the value of every node in the given BST is replaced...read more
Ans. 
I solved this problem using inorder traversal in tree.
First calculate the sum of all nodes present in the tree.
Then for each node the sum of all greater nodes can be updated using the total sum and the sum of nodes visited so far.
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was somewhere in the middle of the day and was around 60 mins long . 
It consisted of three sections 
one is aptitude 
then other was related to comm skills related
and the last one was 2 coding question ( each have to be done in different programming language ).

Q1. K-th Ugly Ninja
Ninja wants to hire some ugly ninjas in his team for doing ugly work. So he has made an array that contains primes integer ‘PRIME_ARR’.
Ninjas who are coming to audition have to take some...read more
Ans. Brute Approach
The idea here is to use the brute force approach and starting from ‘1’ find the ‘K’ ugly numbers till then remain in the loop.
 
• Declare a set for super ugly numbers.
• Insert the first ugly number into the set.
• Initialize array ‘PRIME_OF[N]’ of size ‘N’ with 0. Each element of this array is an iterator for the corresponding prime in the ‘PRIME_ARR[N]’ array.
• Initialize ‘ARR[i]’ array with ‘PRIME_ARR[N]’. T...read more
Answered by CodingNinjas
Add your answer
Q2. Pair count.
You are given an array ‘ARR’, and a positive integer ‘K’. Your task is to count the total number of pairs whose sum is divisible by ‘K’.
For example:
You are given, ‘ARR’ =[4, 3, 5, 1, 4, 5],...read more
Ans.  Brute Force
In this approach, try to iterate through all possible pairs in the array and count the number of pairs that are divisible by ‘K’.
 
Algorithm:
• Set count as 0
• Iterate i through all the indices of the arr
  • Iterate j from i + 1 to the size of arr
    • If arr[i] + arr[j] is divisible by k, increase count by 1.
• Return count
Space Complexity: O(1)Explanation:
O(1),
 
No Extra space is used in the array.
Time Complexity:...read more
Answered by CodingNinjas
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was a round with HR and these questions were asked

Q1. Basic HR Questions
-tell me about yourself
-challenge faced during project, how did you overcome it?
-describe your strengths.
-if you were to tell about yourself to a person, what would you tell him
-how would...read more
Add your answer

Mathematical reasoning , aptitude test, psuedocode