Candidatei-me online. O processo levou 1 semana. Fui entrevistado pela ServiceNow em abr. de 2024
Entrevista
This was for a UI dev position.1st Round was a live coding test in hackerrank based on Machine coding and one DS question followed by next two rounds with Hiring Manager in India and Staff Frontend Engineer at USA.
HM round involved general chat about the project and past experiences followed by Machine coding round in hackerrank.
Perguntas de entrevista [1]
Pergunta 1
1. In Round 1, they asked to create a class using Typescript that returns an immutable copy and checks if an object is a mutable object.
Next they asked machine coding problem to create a pagination based table component, where the no of buttons are dynamic based on rows per page.
In Round 2, they asked to create an autosuggest component that lists the users and clicking on the listed users, another selected users list should get populated with a search on that component as well.
Candidatei-me de outra forma. Fui entrevistado pela ServiceNow (Hyderābād) em dez. de 2025
Entrevista
Interviewer was rude and do not have enough time and constantly asking about AI and AI. I have already said I am learning that still chose to cut off me. If you do not have a slot then please provide better time. Do not play with Other's time
coding round
behavior round
A typical software engineer interview assesses coding, algorithms, data structures, system design, problem-solving, debugging, communication, and cultural fit through technical challenges, behavioral questions, and discussions about past projects and engineering principles
Fiz uma entrevista na empresa ServiceNow (Hyderābād).
Entrevista
2 DSA Round , 1 System design round and managerial Round , HR Round
Few questions related to my project and gave problem to solve
n number of sorted arrays need to merge in single array with o(k*logn) time complexity
Perguntas de entrevista [1]
Pergunta 1
Few questions related to my project and gave problem to solve
n number of sorted arrays need to merge in single array with o(k*logn) time complexity