Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Genesys (Chennai) nel mese di ott 2020
Colloquio
Interview consisted of 5 rounds.
Round 1 (Online Screening Test) : They test your knowledge in Operating Systems, Computer Networks, C , C++, Aptitude and 1 Coding Question
Round 2 (Technical Interview) : Here they test your based programming skills and OOPs concepts. It went for 1 hour.
Round 3 (Technical Interview -Advanced): You are required to solve 2 advanced programming questions.
Round 4 (Technical Interview- Director): This round was a discussion with the Director about company and its growth and more about your role in the team. They will ask you solve some simple puzzles.
Round 5 (HR Round): This is a formal round.
Recruiter was nice and helpful.
Domande di colloquio [1]
Domanda 1
1. BFS and DFS
2. Rotate matrix by 90 degree
3. String Manipulation
4. Array Manipulation and Sorting
5. Questions based on your Resume.
The process started with an HR phone interview, followed by a conversation with the Manager. After that, I received a take-home assignment with a one-week deadline, and the final stage was a live coding session.
Domande di colloquio [1]
Domanda 1
What is the difference between TypeScript and JavaScript?
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Genesys nel mese di set 2025
Colloquio
Had a call with a recruiter. They said I'll get a technical interview in 2 weeks. Then randomly got an email that I've been rejected from the position with no explanation
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Genesys (Chennai) nel mese di giu 2024
Colloquio
The hiring process consisted of 5 rounds:
1 - Technical test based on OS, CN, Aptitude, Output questions and a coding question
2 - Basic coding interview
3 - Advanced coding interview
4 - Puzzle solving round
5 - HR interview
Domande di colloquio [1]
Domanda 1
Coding question - Largest subsequence sum in a tree for a given path.
