O processo levou 1 semana. Fui entrevistado pela Automation Anywhere (Bengaluru) em ago. de 2019
Entrevista
Had to wait for 3 hours for in person interview. Interviewer was very arrogant and his attitude was very bad. He was in a hurry and he didnt had patience to listen to the answers.
Perguntas de entrevista [2]
Pergunta 1
Find middle of the linked list and the time complexity should be less than n/2?
Write a program to read a file in parallel by 5 different threads and update the read values into the database? Each thread will read different sections of the file.
Candidatei-me online. O processo levou 7 semanas. Fui entrevistado pela Automation Anywhere (San Jose, CA) em out. de 2025
Entrevista
It first was a phone screen, then a technical phone screen, behavioral screen, then an onsite of 4 interviews with lunch in between over a period of a few weeks
Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Automation Anywhere (Nova Deli) em dez. de 2021
Entrevista
There were total 4 rounds. Online test (2 coding problems ), followed by 2 technical interviews mostly based on problem solving, design, current experience, then HR discussion.
It was my one of the best interview experience.
All interviewers very nice, knowledgeable. There was proper communication at each step.
Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela Automation Anywhere (Madrid) em out. de 2021
Entrevista
I applied through Naukri . The process was good and HR kept in constant touch to give me information about the rounds . The process took nearly 1 month , some rescheduling happened from my end as well as their end .
Unusually consists of 4 rounds.
1 coding test, 2 Technical , Technical Architect, Director.
Questions were based on DS and problem solving , java core, multithreading, restfull services and system design and scenarios on implementation and designs.
Perguntas de entrevista [1]
Pergunta 1
merge 2 sorted linked list, hotel management designs scenarios, application authentication and authorization, binary tree questions, permutations of characters in a string .
