Associate Software Engineer applicants have rated the interview process at KPIT Technologies with 2.6 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 78% positive. To compare, the company-average is 72% positive. This is according to Glassdoor user ratings.
Candidates applying for Associate Software Engineer roles take an average of 24 days to get hired, when considering 59 user submitted interviews for this role. To compare, the hiring process at KPIT Technologies overall takes an average of 15 days.
Common stages of the interview process at KPIT Technologies as a Associate Software Engineer according to 59 Glassdoor interviews include:
Skills test: 23%
One on one interview: 18%
Personality test: 14%
Phone interview: 10%
IQ intelligence test: 10%
Background check: 10%
Presentation: 8%
Other: 4%
Group panel interview: 2%
Drug test: 1%
Here are the most commonly searched roles for interview reports -
I applied online. I interviewed at KPIT Technologies (Chennai)
Interview
The interview was very easy but I unfortunately fumbled the bag. See that y'all prepare mostly on oops concepts and be strong in basic programming problems all de best (that's all I have to say but this software wants 30 minimum words so I'm writing theses)
The interview process at KPIT Technologies was straightforward. The interviewer first asked me to introduce myself and then moved directly to coding questions. I was asked to solve problems and I wrote the solutions in Python and explained the logic behind my code. The focus was mainly on problem-solving ability and understanding of the approach.Also they asked about your project
Interview questions [1]
Question 1
A question to read the file and compare it's content
. What is the approach to finding the frequency of elements using a map-based solution?
Ans. Use a map to count occurrences of each element in an array efficiently.
Initialize an empty map (or dictionary) to store element frequencies.
Iterate through the array, updating the count for each element in the map.
Example: For array [1, 2, 2, 3], the map will be {1: 1, 2: 2, 3: 1}.
After processing, the map contains the frequency of each unique element.
This approach has a time complexity of O(n) and space complexity of O(k), where k is the number of unique elements.
Easy to medium level difficulty question you must mention whatever you actually know in your resume don’t lie their
And focus on whatever written in your resume
Interviews will ask from resume only
Interview questions [1]
Question 1
Everything about your college that you mentioned in resume