Mercedes-Benz Research and Development India Design Engineer & Modeler Interview Questions and Answers

Q1. Project Related Questions
Add your answer
Q2. 1 DSA and System Design Problem
Ans. 
Implement a function to reverse a linked list
• Create a new linked list to store the reversed elements

• Traverse the original linked list and insert each node at the beginning of the new linked list

• Update the head of the new linked list as the last node of the original linked list
Answered by AI
Add your answer

Q1. More Technical Questions on Project
Add your answer

Q1. Scenario Based Questions
Add your answer
Q2. Checking to fit in culture
Add your answer

Q1. Spring boot, java 8 and microswrvices
Add your answer
Q2. Basic question about spring framework
Add your answer

Q1. Basic details asked about my last project that i have worked.
Add your answer
Q2. Basic details about last project
Add your answer

Just normal MCQ test.

Q1. SELL ABD BUY 1 array question(easy level)
Ans. 
This question involves buying and selling items in an array.
• The array must contain strings.

• You need to implement a function to buy and sell items from the array.

• Provide examples of buying and selling operations.
Answered by AI
Add your answer

Normal DP question (LC med)

Round duration - 120 minutes
Round difficulty - Hard

There was 2 parts. First part problems were based on Quantitative Aptitude. Problems were of 3 types- Easy, Medium and Hard with different scores. Difficulty keeps on increasing if you answer correctly and keeps on decreasing if you answer incorrectly.
First part was of 45 mins.
Second part consisted of 2 coding problems- Medium, Hard. One was based on Greedy and other was a difficult DP + Bitmask problem.
Coding part had more weightage than Aptitude.

Q1. 
K Centers Selection Problem
In Ninja Land, there are cities numbered from 0 to N-1. The distances between each pair of cities are represented by an N * N matrix 'DIST', where 'DIST[i][j]' is the distance ...read more
Ans. 
The problem involves selecting K cities to install servers in Ninja Land to minimize the maximum distance from any city to a nearest server.
• Iterate through all possible combinations of K cities to select for server installation.

• Calculate the maximum distance from any city to the nearest server for each combination.

• Choose the combination that minimizes the maximum distance.
Answered by AI
Add your answer
Q2. 
Beautiful String Verification
Given a non-empty string inputString, determine if it can be converted into a 'Beautiful String' using the defined operation.
You can perform any number of operations to con...read more
Ans. 
Determine if a given string can be converted into a 'Beautiful String' using a specific operation.
• Check if the input string is already a 'Beautiful String' by checking if it contains 'abc' in the correct positions.

• If 'abc' is present in the input string, check if the left and right portions satisfy the defined conditions.

• If the conditions are met, return 'True', otherwise return 'False'.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

There were 3 interviewers in my panel. The most senior panellist asked q. related to my interests and internship experience.
Other 2 asked questions related to Coding and subjects. There was 1 coding question which was implementation based and involved many corner cases. They were checking if I was able to figure out different corner cases and handle those. 
There were situation based questions also asked. One question was on system design of Arogya Setu App.

Q1. 
Complex Number Multiplication
Calculate the product of two complex numbers represented as strings in the form “A+Bi”. Here, ‘A’ represents the real part, and ‘B’ represents the imaginary part.
Explanatio...read more
Ans. 
Calculate the product of two complex numbers represented as strings in the form 'A+Bi'.
• Parse the input strings to extract real and imaginary parts of both complex numbers

• Perform multiplication of the complex numbers using the formula (a+bi)*(c+di) = (ac - bd) + (ad + bc)i

• Format the result as a string in the form 'A+Bi' and return
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round involved basic questions related to background and behaviour. It was basically a cultural fit round.

Probability, time & distance

Advantages and disadvantages of paperless office

Q1. Previous work experience
Add your answer

All types of aptitude, verbal, coding questions, and technical questions.

Q1. Resume related and basic computer science concepts
Add your answer

Dotnet,c#,sql,MVC,ASP.NET

Previous experience, scenario based, project architecture

Q1. When is your notice period?
Add your answer