i
MathWorks
Filter interviews by
Team work vs individual
LcS problem, timing 45 min
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: Inheritance in object-oriented programming languages like Java allows for polymorphism.
Memory management is the process of controlling and coordinating computer memory, assigning portions called blocks to various programs.
Memory management involves allocation, deallocation, and organization of memory blocks.
It ensures that each process gets the memory it needs and that memory is used efficiently.
Examples include dynamic memory allocation in C/C++, garbage collection in Java, and virtual memory management...
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
Timing: 90 mins
Environment: Online coding round
No of questions: 3 Questions(225 marks) were asked.
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...
Yes, the quick sort algorithm can be enhanced to achieve NlogN complexity in the worst case by using randomized quick sort or median of three pivot selection.
Use randomized quick sort to randomly select the pivot element, reducing the chances of worst-case scenarios.
Implement median of three pivot selection to choose a pivot that is closer to the median value, improving partitioning efficiency.
Consider using dual pivot...
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the substrings and counts to build the decrypted string
Track the position in the decrypted string to find the K'th character
You have 'N' jobs, each with a start time, end time, and profit. Your task is to identify the maximum profit that can be earned by scheduling these jobs such that...
The Weighted Job Scheduling problem involves maximizing profit by scheduling non-overlapping jobs with given start times, end times, and profits.
Sort the jobs by end time in ascending order.
Initialize an array 'dp' to store maximum profit at each job index.
For each job, find the latest non-overlapping job and update 'dp' with the maximum profit.
Return the maximum profit from 'dp'.
Round duration - 45 minutes
Round difficulty - Medium
Timing: evening
Environment: Virtual(remote)
Activity:
It was a resume screening + DSA round . There were 2 interviewers in this round. Initially , a brief introduction was given by them & later , they started with projects listed in my resume . They first asked me to explain about the projects , asked some questions related to its implementation & its actual use case in real world (where it can be used) .Later , they switched to DSA part , a total of 2 questions of easy medium difficulty level were asked . I only remember 1 question that was similar to Minimum platform problem.
After this , They asked me for favourite subjects. I said Operation Systems . Then , they asked for some concepts in OS , including CPU scheduling & its algos like Round robin , SJF etc and later asked which type of scheduling algorithm is used to design actual systems .
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...Determine the minimum number of platforms needed at a railway station so that no train has to wait.
Sort the arrival and departure times arrays in ascending order.
Use two pointers to iterate through the arrays and keep track of the number of platforms needed.
Increment the number of platforms needed when a train arrives and decrement it when a train departs.
Return the maximum number of platforms needed at any point.
Examp...
Round duration - 50 minutes
Round difficulty - Medium
It was System design round.Though , it also started with a brief introduction & later , asked about projects . As my project was related to test classification . In that context , they asked me to design a low level Suggestion system(In any preferred language) .
You are provided with a list of strings, DICTIONARY[]
, representing the correct spellings of words, and a query string QUERY
that may contain misspelled words. Your task is...
Given a list of correct spellings and a query string, return a list of suggested correct spellings if the query is misspelled.
Iterate through the dictionary to check for matching prefixes with the query string.
If a match is found, add the corresponding word to the list of suggestions.
Return the list of suggestions if the query is misspelled, otherwise return an empty list.
Tip 1 : Practice a lot of problems from leetcode/coding ninjas or some other platform.
Tip 2 : Participate in daily contests on codeforces, leetcode, kickstart, etc.
Tip 3 : Include new topics while learning/solving Data structures problems like tries, BIT, etc.
Tip 1 : Mention your competitve programming skills and profiles in resume if possible.
Tip 2 : While mentioning things in resume: mention by numbers.
Tip 3 : Make a neet resume in some standard format(maybe by using LaTeX)
Tip 4 : Have atleast 2 projects(on which you are confident) in resume
Tip 5 : Don't put false positive on resume.
Medium - Hard DSA Problem they ask
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DBMS.
Data integrity refers to the accuracy, consistency, and reliability of data throughout its lifecycle.
Data integrity ensures that data is accurate and consistent in storage and transmission.
It involves maintaining the quality and reliability of data over time.
Methods for ensuring data integrity include checksums, encryption, and error detection codes.
Examples of data integrity violations include data corruption, unautho...
A trigger is a special type of stored procedure that automatically executes when certain events occur in a database.
Triggers are used to enforce business rules, maintain data integrity, and automate repetitive tasks.
They can be triggered by INSERT, UPDATE, or DELETE operations on a table.
Examples of triggers include auditing changes to a table, updating related tables when a record is modified, or enforcing referential...
Clustered indexes physically order the data in the table, while non-clustered indexes do not.
Clustered indexes determine the physical order of data in the table, while non-clustered indexes do not.
A table can have only one clustered index, but multiple non-clustered indexes.
Clustered indexes are faster for retrieval of data, especially range queries, compared to non-clustered indexes.
Non-clustered indexes are stored se...
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions on DBMS.
UNION combines and removes duplicates, UNION ALL combines without removing duplicates.
UNION merges the result sets of two or more SELECT statements and removes duplicates.
UNION ALL merges the result sets of two or more SELECT statements without removing duplicates.
UNION is slower than UNION ALL as it involves removing duplicates.
Example: SELECT column1 FROM table1 UNION SELECT column1 FROM table2;
Example: SELECT column...
A cursor in PL/SQL is used to retrieve and process multiple rows of data one at a time.
Allows iteration over a result set
Retrieves data row by row
Can be used to update or delete rows in a table
Must be declared, opened, fetched, and closed
SQL query to fetch the nth highest salary from a table
Use the ORDER BY clause to sort salaries in descending order
Use the LIMIT clause to fetch the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
This was a managerial round with typical behavioral problems.
Tip 1 : Since this was a SQL post, I would suggest you to get the basics intact and try practicing few queries.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview in Aug 2016.
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA, OOPS and puzzles.
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes until the end of the list is reached
Ninja is exploring new challenges and desires to reverse a given number. Your task is to assist Ninja in reversing the number provided.
If a number has trailing ze...
Implement a function to reverse a given number, omitting trailing zeros.
Create a function that takes an integer as input and reverses it while omitting trailing zeros
Use modulo and division operations to extract digits and reverse the number
Handle cases where the reversed number has leading zeros by omitting them
Ensure the reversed number is within the constraints specified
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from end to start and append each character to a new string.
Use built-in functions like reverse() or slicing to reverse the string.
Handle special characters and numbers while reversing the string.
Ensure to consider the constraints provided in the problem statement.
Overloading in OOP is the ability to define multiple methods with the same name but different parameters.
Overloading allows multiple methods with the same name but different parameters to coexist in a class.
The compiler determines which method to call based on the number and type of arguments passed.
Example: having multiple constructors in a class with different parameter lists.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with question based on Web Dev, Cloud Computing, Networking etc.
TELNET is a network protocol used to establish a connection with a remote computer over a network.
TELNET stands for Telecommunication Network.
It allows a user to log in to a remote computer and execute commands as if they were directly connected to that computer.
TELNET operates on port 23.
It is not secure as the data is transmitted in plain text.
SSH (Secure Shell) is a more secure alternative to TELNET.
TELNET is insecure, while SSH is secure for remote access to servers.
TELNET sends data in plain text, while SSH encrypts data for secure communication
SSH uses public-key cryptography for authentication, TELNET does not
SSH provides secure remote access to servers, TELNET does not prioritize security
TELNET operates on port 23, while SSH operates on port 22
Given an array/list ARR
consisting of integers where each element is either 0, 1, or 2, your task is to sort this array in increasing order.
The input sta...
Sort an array of 0s, 1s, and 2s in increasing order.
Use a three-pointer approach to partition the array into sections of 0s, 1s, and 2s.
Iterate through the array and swap elements based on their values.
Time complexity should be O(n) to meet the constraints.
A hypervisor is a software that creates and runs virtual machines on a physical host machine.
Hypervisors allow multiple operating systems to run on a single physical machine
They provide isolation between virtual machines
Examples include VMware ESXi, Microsoft Hyper-V, and KVM
Cloud computing is like renting a computer over the internet instead of owning one.
Cloud computing allows users to access and store data and applications over the internet instead of on their own physical computer.
It offers scalability, flexibility, and cost-effectiveness as users can easily adjust their storage and computing needs.
Examples include services like Amazon Web Services (AWS), Microsoft Azure, and Google Cl...
The stages in the Software Development Life Cycle include planning, design, development, testing, deployment, and maintenance.
1. Planning: Define project scope, requirements, and timelines.
2. Design: Create architecture, UI/UX, and database design.
3. Development: Write code based on design specifications.
4. Testing: Verify functionality, performance, and security.
5. Deployment: Release the software to users or clients.
...
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA and OOPS. A detailed discussion on my projects was also carried out.
Given three sorted arrays A
, B
, and C
of lengths N
, M
, and K
respectively, your task is to find all elements that are present in all three arrays.
The first...
Find common elements in three sorted arrays and output them in order.
Iterate through all three arrays simultaneously using three pointers.
Compare elements at pointers and move pointers accordingly.
If elements are equal, add to result and move all pointers forward.
If elements are not equal, move pointer of smallest element forward.
A volatile variable is a variable that can be modified by multiple threads simultaneously.
Volatile variables are used in multithreading to ensure visibility of changes made by one thread to other threads.
They are not cached in thread's local memory, but always read from main memory.
They are typically used for flags or status variables that are accessed by multiple threads.
Example: 'volatile boolean flag = true;'
Multithreading in Java allows multiple threads to execute concurrently, improving performance and responsiveness.
Multithreading allows multiple threads to run concurrently within a single process.
Threads share the same memory space, allowing for efficient communication and data sharing.
Java provides built-in support for multithreading through the Thread class and Runnable interface.
Example: Creating a new thread using ...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 2 interview experiences
based on 7 reviews
Rating in categories
Software Engineer
122
salaries
| ₹13 L/yr - ₹30 L/yr |
Senior Software Engineer
80
salaries
| ₹21 L/yr - ₹47 L/yr |
Associate Software Engineer
48
salaries
| ₹12 L/yr - ₹27 L/yr |
Software Developer
28
salaries
| ₹10.1 L/yr - ₹33 L/yr |
Software Engineer2
27
salaries
| ₹22.5 L/yr - ₹32 L/yr |
24/7 Customer
Thomson Reuters
Oracle Cerner
Adobe