J'ai postulé en ligne. J'ai passé un entretien chez Anusha Projects (Hyderâbâd) en févr. 2022
Entretien
Online Application:
Start by searching for job openings on IBM's official careers website.
Submit your resume and cover letter through the online application system.
Screening Call:
If your application is shortlisted, you may receive an initial phone call from a recruiter.
This call is often used to discuss your background, skills, and interest in the position.
Technical Assessment:
Depending on the role, you might be required to complete a technical assessment or test.
This could include coding exercises, problem-solving challenges, or technical quizzes.
Phone or Video Interviews:
IBM may conduct one or more rounds of phone or video interviews.
These interviews could involve technical questions related to the position, behavioral questions, and discussions about your past experiences.
On-Site Interviews:
For certain positions, especially those at higher levels or requiring specialized skills, IBM may invite you for on-site interviews.
On-site interviews may include meeting with multiple team members, technical assessments, and discussions about your qualifications and the company culture.
Behavioral Interviews:
You might be asked behavioral questions to assess how you handle different situations and challenges.
Managerial Interviews:
Depending on the role, you may have interviews with managers or executives to discuss your fit for the te
Autres retours d’entretien d’embauche pour un poste comme Software Engineer chez Anusha Projects
J'ai passé un entretien chez Anusha Projects (Bengaluru)
Entretien
It was moderate not upto the mark. But it was a good experience. I have learnt a lot of things and i changed in myself. So i should improve more for the better result.
J'ai postulé en ligne. Le processus a pris 1 jour. J'ai passé un entretien chez Anusha Projects (Bengaluru) en janv. 2019
Entretien
Good hr manager it took 40-50 min of conversion
Que about oops concept data strixture polymorphism single linklißt double link list circular bubble sort binary search insertion sort selection sort heap tree heap sort strings