Envié una solicitud electrónica. El proceso duró 1 semana. Acudí a una entrevista en Manhattan Associates (Bengaluru) en may 2010
Entrevista
There are 3 rounds of actual interview before a discussion with the HR
1) Written interview (Objective, Technical - Mainly about the basics albeit at a detailed level, mainly for a basic screening)
2) Technical Discussion (With a senior resource on technology based questions and puzzles at a level more advanced than level 1)
3) Managerial Discussion (A mix of technical/functional/behavioral discussion)
If a candidate is through with the above rounds he/she's lined up for a discussion with the HR Manager.
Preguntas de entrevista [1]
Pregunta 1
This profile you're going to take up is almost similar to the profile that you were on in your previous organization. Will you still be willing to take this job up? (Asked by the manager when I said I was leaving the previous company for the profile)
Acudí a una entrevista en Manhattan Associates (Bengaluru)
Entrevista
Very professional and smooth process. Questions were all what you would expected for a java developer interview. Interviewer was patient and friendly.
Learn your basic OOPS, multi threading and some code optimisation and you're good
Preguntas de entrevista [1]
Pregunta 1
How will you improve db performance if slowness if observed
Acudí a una entrevista en Manhattan Associates (Bengaluru)
Entrevista
Basic of Java , ops concept, multiple threading, collection
Basic of Sql-
Sql queries ( joins, groupby , update)
Should have knowledge of procedure, triggers
Hibernate and spring boot
Hibernate queries, mapping , spring ioc container and some annotation
Acudí a una entrevista en Manhattan Associates (Bengaluru)
Entrevista
Consisted of 4 rounds- 2 technical, 1 director and an hr round.
Technical round consisted of coding problem around strings and maps, java8 streams, multithreading and collections
Director round was 45 min discussion focused on experience and past projects, standard managerial round questions.
Preguntas de entrevista [1]
Pregunta 1
Longest substring without repeating character, leetcode
