J'ai postulé via un recruteur. J'ai passé un entretien chez ServiceNow (Hyderâbâd) en oct. 2022
Entretien
The biggest problem in facing Servicenow interviews is they are not language agnostic. They are more focused on Vanilla Javascript. Even if you crack problems using the language that you are comfortable with like Java/c++/Python etc, you ultimately need to solve the Javascript problems. Its like asking a French guy to write in Tamil. How many companies are using pure Javascript now a days with the advent of better developer friendly frameworks and Typescript. Very frustrating. If you can't solve some tricky Javascript BS problem (that the interviewer comes prepared with answer), you will be rejected.
Questions d'entretien [1]
Question 1
1. Linkedlist related DS problem (Easy) 2. Some tricky Javascript 3. Some tricky Javascript Okay, Javascript is not my area of expertise. And nowhere I mentioned Javascript in my resume. 4. Some tricky Javascript again
J'ai postulé via une autre source. J'ai passé un entretien chez ServiceNow (Hyderâbâd) en déc. 2025
Entretien
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
J'ai passé un entretien chez ServiceNow (Hyderâbâd)
Entretien
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
Questions d'entretien [1]
Question 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