Webasto Roofsystems India Pvt Ltd, Software Developer Interview Questions and Answers

Normal DP question (LC med)

Q1. Tell me about About yourself
Add your answer
Q2. Describe your projects
Add your answer
Q3. How you implement machine learning algorithms in cars
Ans. 
Machine learning algorithms in cars are implemented through sensors, data collection, training models, and real-time decision-making.
• Collecting data from various sensors installed in the car, such as cameras, lidar, radar, and GPS.

• Training machine learning models using the collected data to recognize patterns and make predictions.

• Implementing real-time decision-making algorithms in the car's onboard computer to assist ...read more
Answered by AI
Add your answer

Quantitative, verbal

2 coding questions easy, medium

Q1. SQL queries, java, oops
Add your answer
Q2. Projects resume
Add your answer

An aptitude test is an exam used to determine an individual's skill or propensity to succeed in a given activity

Programming questions are an integral part of an interview for the developer's position

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

Q1. When should we use node js and java
Ans. 
Node.js is suitable for real-time applications and microservices, while Java is better for large-scale enterprise applications.
• Use Node.js for building real-time applications like chat apps, streaming services, and collaborative tools.

• Node.js is also great for developing microservices and APIs due to its lightweight and event-driven architecture.

• Java is ideal for building large-scale enterprise applications that requir...read more
Answered by AI
Add your answer

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
In Ninja Land there are ‘N’ cities numbered from 0 to ‘N’-1. The distance between each pair of cities is given by N * N matrix ‘DIST’ where ‘DIST[i][j]’ denotes the distance between city ‘i’ and ...read more
Ans. Brute force
This problem is an NP-Hard problem i.e there exists no polynomial-time solution for it. So we cannot do anything more than brute force for the exact solution. See this link for more information.
 
Algorithm
• This is a recursive algorithm.
• Create an empty integer list/vector ‘SELECTED’ of size ‘N’.
• Initialize an integer variable ‘RESULT’:= INF.
• We make a recursive function, let it be kCenterHelper(K, N, SELECTE...read more
Answered Anonymously
Add your answer
Q2. Beautiful String
Suppose we are given an empty string “inputString”. We have to convert this “inputString” into a “Beautiful String”
We can perform any number of operations on “inputString” to convert it...read more
Ans. Brute Force
The idea is to insert “abc” at every position in a string , “helperString” (initialised as an empty string) recursively and comparing it with the input string “inputString” at every recursive step. If the “helperString” comes out to be equal to input string “inputString” then return “True” to the function else “False”.
 
Algorithm:
 
• First make a recursive boolean  function “Solve” and pass “helpe...read more
Answered Anonymously
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. Multiplying Complex Numbers
You are given two complex numbers 'NUM1' and 'NUM2' as strings, “A+Bi” where ‘A’ represents the real part and ‘B’ represents the imaginary part.
You have to fi...read more
Ans. Mathematics
Let first and the second complex number be, ‘a + bi’ and ‘c+di’, then 
 
'RESULT' = (a + bi) *(c + di) = (ac + adi) = (bci + bd * (-1)) as i^2 = -1
 
‘RESULT’ = (ac - bd) + (ad+ bc) i 
 
The steps are as follows:
 
1. We will parse the input and extract the real and imaginary parts of the number.
2. Let ‘REAL1’, ‘IMG1’ store the real and imaginary part of the first number.
3. Let ‘REAL2’, ‘IMG2’ ...read more
Answered Anonymously
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.