J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 semaines. J'ai passé un entretien chez Coriolis Technologies (Pune) en mai 2024
Entretien
There were three rounds
First Online Assessment in which there were questions regarding Aptitude,SQL,OOPS and DSA coding questions followed by 2 technical interviews in which they mainly asked about project , SQL and DSA
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 jours. J'ai passé un entretien chez Coriolis Technologies (Pune) en mai 2024
Entretien
Round1:(Online Assessment)
It was containing three coding questions, 1 SQL question, and 10 aptitude questions.
Coding: 1 easy, 1 medium, 1 hard. (array, mathematics, strings)
SQL It was an easy Question.
Aptitude: These were easy to medium level.
Round 2:(Technical 1)
It was purely a Technical round.
Topics Asked:
Pointers
OOPS
Operating systems
DBMS
Linked List
Complexity analysis
Stack/Heap
He asked me everything in depth.
Preparation: You can use “GFG Articles” to prepare for the first round as it was just basic but in-depth.
Round 3:(Technical Round 2):
Questions d'entretien [1]
Question 1
Questions:
Why do we need to encapsulate the member function in the class, the same function can be used globally.
How an inheritance is working.
Add a node at the end of the linked list at runtime.
Delete the node with a given value.
where binary trees are used in real life.
In the execution context who provides us with the stack?
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Coriolis Technologies (Pune)
Entretien
It consist of 3 rounds. First one is online test on Hacker rank. It consist of three coding questions leetcode medium but do not include DP and Graph. It has question related to binary search, stack, queue, binary . One database question. First technical interview question asked were two sum , three sum .In second Interview question asked were related to algorithm of graph simple dfs, bfs, and implementation of linked list.
