Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 3 semanas. Acudí a una entrevista en KPIT Technologies en nov 2023
Entrevista
Firstly,
Online assessment will be taken, it consists of general Aptitude, and 2 coding questions, in which I attempted all the aptitude questions. I cleared the first coding question but for the other problem I could partially clear the test cases.
Verdict: selected
Secondly, you'll have a technical interview on superset platform and the technical interview will be based on the four pillars, i.e., DSA, DBMS, CN and OS and apart from them your tech stack will also be looked into.
Verdict: clear
Thirdly, some students got another technical round but I got only a single one and my third round was an HR round. Your generic knowledge, and your command on your skills will be checked, and other general hr conditions.
Verdict: selected
Tips:
Prepare DBMS, OS and CN concepts very thoroughly along with your tech stack and for DSA practise basic DSA questions.
Preguntas de entrevista [1]
Pregunta 1
How do you find a data when it is in less amount and when huge amounts of data is present.
2. Oops concepts like hierarchy
3. JVM and its properties.
4. How do you sort a graph(just algo)
5. Perform a constructor overloading(coding done on superset platform)
Acudí a una entrevista en KPIT Technologies (Pune)
Entrevista
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
Preguntas de entrevista [1]
Pregunta 1
A question to read the file and compare it's content
Acudí a una entrevista en KPIT Technologies (Pune)
Entrevista
. 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.
Acudí a una entrevista en KPIT Technologies (Bengaluru)
Entrevista
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
Preguntas de entrevista [1]
Pregunta 1
Everything about your college that you mentioned in resume