Filter interviews by
I applied via Referral and was interviewed before Jun 2020. There was 1 interview round.
Springs are used in various applications and come in different types and pitches.
Types of springs include compression, extension, torsion, and constant force springs.
Pitch refers to the distance between adjacent coils in a spring.
Pitch can be measured in metric or imperial units.
The pitch of a spring affects its strength and flexibility.
Examples of applications for springs include automotive suspension systems, door hi
Top trending discussions
I applied via Company Website and was interviewed in Nov 2022. There were 2 interview rounds.
Mechanical engineering production
The sales process involves identifying potential customers, engaging with them, presenting products or services, overcoming objections, and closing the sale.
Identifying potential customers through market research and lead generation
Engaging with customers through effective communication and building relationships
Presenting products or services in a compelling way to meet customer needs
Overcoming objections by addressin...
I was interviewed in Sep 2021.
The procedure to place an AUDI involves several steps.
Ensure the parking spot is large enough for the car
Turn off the engine and engage the parking brake
Shift the car into neutral gear
Use the keyless entry or manually lock the car
Exit the car and ensure all doors are locked
Check the surroundings for any obstacles or hazards
Return to the car and double-check all doors are locked
Walk away from the car and enjoy your day!
posted on 11 Nov 2023
I applied via Approached by Company and was interviewed in Oct 2023. There were 4 interview rounds.
Just normal MCQ test.
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.
I applied via Campus Placement
Normal DP question (LC med)
I was interviewed in Dec 2020.
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.
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 ...
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.
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...
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'.
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.
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.
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
Round duration - 30 minutes
Round difficulty - Easy
HR round involved basic questions related to background and behaviour. It was basically a cultural fit round.
Tip 1 : Focus on Data Structures, Algorithms as >= 75% of your interview will be dedicated to it. Practice as much as you can.
Tip 2 : Learn the fundamentals of C, C++, OS, SQL as that are basic expectations of interviewer.
Tip 3 : Keep 2 descent projects in resume. Try to have an internship. It will make your resume strong.
Tip 1 : Try to keep relevant information only. Add all your skills and achievements.
Tip 2 : Try to have links of your coding and Github profiles.
Tip 3 : Add 2 to 3 project with small descriptions. Try to keep bullet points. Do mention the Tech Stack.
Tip 4 : Don't lie on any skill. Write only those on which you have worked.
I applied via Approached by Company and was interviewed before Jul 2022. There were 2 interview rounds.
I applied via Campus Placement
Junior Engineer
54
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Mercedes-Benz Research and Development India
Audi
Jaguar Land Rover
Volvo