Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 2 días. Acudí a una entrevista en JustDial (Kharagpur, West Bengal) en dic 2022
Entrevista
It was single round interview about 30 minutes duration. They asked me 2 coding question one was easy level other was medium level. Then they asked me questions from DBMS, SQL, OS and Data structures. These all question were easy and common.
Preguntas de entrevista [1]
Pregunta 1
Q. Number of island, standard leetcode coding question. Q2. DFS graph question/ Q3. Normal forms from Data base management system. Q4. Multiprocessing and Multitasking process difference Q5. Join two tables with having two columns same. Output person from a particular city. Write other query to output numner of person from that city. Q6. Time complexity, why searching algorithms has time complexity O(log*(n))
There was 3 rounds
Coding
Hr
And manager
The manager round is the toughest, he/she may ask you many analytical and mathematical puzzles which you need to be prepared for
Preguntas de entrevista [1]
Pregunta 1
We have two water jugs, one measures 4 Gallons (4G) while the other measures 9 Gallons (9G). But there is no measuring label mentioned on either of these two jugs, i.e., we cannot know the exact amount filled in the jug
3 rounds of interviews, 1 round: javascript basic questions, good tricky examples of different types of joins, mongoDB query. 2 rounds: went deeper into Object-oriented programming and mongo DB advanced queries.
Preguntas de entrevista [1]
Pregunta 1
3 rounds of interviews, 1 round: javascript basic questions, good tricky examples of different types of joins, mongoDB query. 2 rounds: went deeper into Object-oriented programming and mongo DB advanced queries.
I got a PPO from the company...For the interview about intern...They asked basic questions regarding the DSA, Algorithms and logical questions...Very nice company...Office is a bit far from the city
Preguntas de entrevista [1]
Pregunta 1
Write a code regarding intersection of two linked lists
