Ho sostenuto un colloquio presso ServiceNow (Hyderabad)
Colloquio
There is new type of racism which has got evolved, which I came to know when I was interviewed in ServiceNow. If you are from NIT or IIT then interviewers will listen to you else you are not even worth to get listened. If you have friends over there then, yuhooo, job is yours.
Interviewer will open geeksforgeeks infront of you (was able to see the reflection through their glasses :-) ) and ask questions from there. When you discuss the solution with them, as they are blinded by the solution over there, nothing fruitful comes out of that.
When I asked them the solution. They gave answers like google it, its on some forum etc etc. In short they would have also not able to code the solution which they were asking
It's good to see companies like these. They give you some different experience and any experience, always has some value.
11
Altre recensioni di colloqui per Senior Software Engineer presso ServiceNow
Ho presentato la mia candidatura tramite un'altra fonte. Ho sostenuto un colloquio presso ServiceNow (Hyderabad) nel mese di dic 2025
Colloquio
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
Ho sostenuto un colloquio presso ServiceNow (Hyderabad)
Colloquio
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
Domande di colloquio [1]
Domanda 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