J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Citicapital Commercial Corp
Entretien
First an online test is conducted, which tests your basic knowledge of DS-Algo, then there are 2-3 rounds of interview, initial rounds are technical and last is HR, with elimination at each stage.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 2 jours. J'ai passé un entretien chez Citicapital Commercial Corp en sept. 2021
Entretien
It was a great experience , it consisted of 1 online technical test , 1 technical round , 1 hr round.
so total 3 stages .
They were more into projects and experiences only !
Questions d'entretien [1]
Question 1
1. What are your projects ?
2.Why did you make this project , how did yo get this idea?
3.Why haven't you made diverse projects ?
4. You prefer Team projects or Solo projects?
My projects were all Android Applications that's why they asked me this :
5. What is the basic design algo of google maps
6. How will you design an app for Citibank where people would know about the nearby citibank ATMs and suggest them what routes they can take.
7. Suppose we tell you to design an app for us , what are the things and resources you will ask us for?
Next in HR ROUND :
1.Projects explanations
2.Tell me your regrets
3.Suppose you have infinite time , how will you spend your time?
4.Have you faced an issue in banking things and what will you suggest the bank to solve it ?
5.Hobbies
6.What do you know about citibank?
7.Why citibank?
8.What are your day to day learnings?
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 1 jour. J'ai passé un entretien chez Citicapital Commercial Corp (Pune) en oct. 2020
Entretien
There was a coding round. Students who passed had an interview.
Round 1: Concentrated on DSA and basic C/C++.
Round 2: HR round but they asked few technical questions too. Focussed on IT projects and database management.
Questions d'entretien [1]
Question 1
Sorting algorithms, binary trees, graphs, linked lists, arrays and vectors
