Filter interviews by
Basic c
I applied via Recruitment Consultant
Top trending discussions
I appeared for an interview before Mar 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was an online MCQ + coding round where we had 1 hour to solve the MCQ's and another 1 hour to solve 2 coding
questions. The MCQ's were related to both General and Technical Aptitude.
You are provided with the root node of a binary tree containing 'N' nodes and an integer value 'TARGET'. Your task is to determine the number of leaf nodes for which the sum of the no...
Calculate the number of leaf nodes in a binary tree with a path sum equal to a given target.
Traverse the binary tree from root to leaf nodes while keeping track of the sum along the path.
Recursively check if the current node is a leaf node and if the sum equals the target.
Increment a counter if the conditions are met and return the counter as the result.
Determine if two given numbers 'a' and 'b' are coprime, meaning they have no common divisors other than 1.
t
a_1 b_1
a_2 b_2
...
a_t b_t
true / false
...
Check if two numbers are coprime by finding their greatest common divisor (GCD) and determining if it is 1.
Calculate the GCD of the two numbers using Euclidean algorithm.
If GCD is 1, the numbers are coprime; otherwise, they are not.
Iterate through all pairs of numbers provided in the input.
Return true if GCD is 1, false otherwise.
Round duration - 50 Minutes
Round difficulty - Medium
This was a standard DSA round where I was given 2 coding questions - the first one was related to DP and the second one was of Linked List. I first explained my approach and then coded the solutions in a production ready manner by applying proper coding principles.
You are provided with 'N' pairs of integers such that in any given pair (a, b), the first number is always smaller than the second number, i.e., a < b. A pai...
Find the length of the longest pair chain that can be formed using given pairs.
Sort the pairs based on the second element in increasing order.
Iterate through the sorted pairs and keep track of the maximum chain length.
Update the chain length if the current pair can be added to the chain.
Return the maximum chain length at the end.
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return true
if it is a pali...
Check if a given singly linked list is a palindrome or not.
Use two pointers approach to find the middle of the linked list.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it's a palindrome.
Round duration - 60 Minutes
Round difficulty - Medium
This round started with 2 preety decent coding questions - one from DP and the other one was from Binary Search. This was followed by some questions from OOPS and then the interview ended with the interviewer asking me the famous 3-Ants and the Triangle Puzzle.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset sum is possible for each element and each sum value
Iterate through the array and update the 2D array accordingly
Check if the value at the last element and K is true to determine if a subset sum equals K
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Based on the pivot point, perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Static polymorphism is resolved at compile time, while dynamic polymorphism is resolved at runtime.
Static polymorphism is achieved through function overloading and operator overloading.
Dynamic polymorphism is achieved through virtual functions and function overriding.
Example of static polymorphism: function overloading in C++.
Example of dynamic polymorphism: virtual functions in C++.
Abstraction in OOP is the concept of hiding complex implementation details and showing only the necessary features to the outside world.
Abstraction allows us to focus on what an object does rather than how it does it.
It helps in reducing complexity and improving maintainability of code.
Example: In a car, we don't need to know the internal working of the engine to drive it. We just need to know how to operate the pedals
Round duration - 30 Minutes
Round difficulty - Easy
This was a Technical Cum HR round where I was first asked some basic OOPS related concepts and then we discussed
about my expectations from the company , learnings and growth in the forthcomig years. I would suggest be honest and
try to communicate your thoughts properly in these type of rounds to maximise your chances of getting selected.
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 applied via Naukri.com and was interviewed before May 2020. There were 5 interview rounds.
posted on 19 Aug 2015
I am excited to join the company because of its reputation for innovation and commitment to excellence.
I am impressed by the company's track record of developing cutting-edge technology.
I am drawn to the company's culture of collaboration and teamwork.
I am excited about the opportunity to work with a talented and experienced team of engineers.
I believe that the company's focus on quality and customer satisfaction align...
In 10 years, I see myself as a highly experienced engineer leading a team of talented individuals towards innovative solutions.
Leading a team of engineers towards successful project completion
Continuing to learn and stay up-to-date with new technologies
Mentoring and guiding junior engineers
Contributing to the growth and success of the company
Exploring opportunities for professional development and growth
I have had both failures and successes in my career as a Senior Engineer.
One of my biggest successes was leading a team that developed a new software system that increased efficiency by 50%.
I also had a failure when I underestimated the complexity of a project and it ended up being delayed by several months.
Another success was implementing a new process that reduced errors by 75%.
I learned from a failure when I didn't ...
posted on 22 Feb 2015
posted on 22 Mar 2015
Some of the top questions asked at the Automotive Robotics (India) Engineer III interview -
based on 4 reviews
Rating in categories
Design Engineer
156
salaries
| ₹2.8 L/yr - ₹8.3 L/yr |
Engineer 1
134
salaries
| ₹2.5 L/yr - ₹8.4 L/yr |
L2 Engineer
96
salaries
| ₹4.2 L/yr - ₹12 L/yr |
Senior Engineer
91
salaries
| ₹6.4 L/yr - ₹13.5 L/yr |
Senior Design Engineer
78
salaries
| ₹5 L/yr - ₹12 L/yr |
Siemens
Schneider Electric
Johnson Controls
Honeywell Automation