MathWorks Software Developer Intern Interview Questions, Process, and Tips

2 easy DSA questions

Q1. Interest in Matlab
Ans. 
I have a strong interest in Matlab due to its powerful data analysis and visualization capabilities.
• I have experience using Matlab for data analysis and visualization in my academic projects.

• I find Matlab's syntax to be intuitive and easy to learn.

• I appreciate Matlab's extensive library of functions for various mathematical and engineering tasks.
Answered by AI
Add your answer

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 Capacity Problem
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...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 Anonymously
Add your answer
Q2. 
Distance To Nearest 1 in a Binary Matrix Problem
Given a binary matrix MAT containing only 0s and 1s of size N x M, find the distance of the nearest cell containing 1 for each cell in the matrix.
The dis...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 Anonymously
Add your answer

Round duration - 30 mins
Round difficulty - Easy

Round was technical + HR round

Q1. Tell me about your project, its utility, the problems you faced, and any general HR questions you encountered.
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 Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Timing: The test was conducted at around 6pm.

Q1. 
Optimal Strategy for a Coin Game
You and your friend Ninjax are engaged in a strategic game involving coins. Ninjax arranges 'N' coins in a linear sequence.
The rules of the game are as follows:
1. Each...read more
Ans. 
This was a medium level DP problem which I was able to solve after some thinking.
Answered Anonymously
Add your answer
Q2. 
Convert BST to Greater Sum Tree
Given a Binary Search Tree (BST) of integers, your task is to convert it into a greater sum tree. In the greater sum tree, each node's value should be replaced with the sum...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 Anonymously
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 Problem Statement
Ninja is looking to hire 'ugly ninjas' whose numbers have all prime factors from a given list. Your task is to help him find the K-th ugly ninja.
You will be given an ar...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 Anonymously
Add your answer
Q2. 
Count Pairs Divisible by K
You are given an array ARR and a positive integer K. Your task is to count the total number of pairs within the array whose sum is divisible by K.
Example:
Input:
ARR = [4, 3...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 Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was a round with HR and these questions were asked