Solicité el puesto a través de un captador. El proceso duró 2 meses. Acudí a una entrevista en ServiceNow (San Diego, CA) en mar 2024
Entrevista
This was an interview for a San Diego-based front-end role on the Digital Customer Experience (DXC) team. Overall the interview process at ServiceNow was streamlined. A recruiter reached out on LinkedIn and I applied shortly after. All interviews were scheduled for 45 minutes on Zoom but several ran long. I had 3 interviews with engineers and 1 final interview with the hiring manager.
The technical interviews were slightly easy (coming from someone who has never received an offer from a big tech company). All started with some discussion of past experience followed by some technical coding. The recruiter provided vague but accurate guidance about what to expect for each round.
The first interview asked for pseudocode for validating matched parentheses, a simple problem with a linear-time solution.
The second interview asked for pseudocode to implement LRU Cache. I was unimpressed with this interviewer: I suggested that this could be done either with an ordered dictionary/hashmap or doubly-linked list. The interviewer seemed unaware of the ordered hashmap approach which is the technically superior option because it uses less memory. He insisted on the linked list implementation because "not all languages have an ordered dictionary" which is more true for linked lists. We proceeded to spend the rest of the interview implementing a doubly-linked list.
The third interview went through many front-end technical questions: JavaScript variable scoping/shadowing, centering nested divs, flattening an array, and implementing a throttling function. This was a fast-paced interview using their Hackerrank interface, so thankfully I was prepared to work quickly.
The hiring manager interview was uneventful, talking about previous experience and role-based access control. This interview felt like a cross-examination and left a cold impression of the hiring manager. I was told that they collaborate often with their teams in India so evening calls are somewhat common.
They had a fast turnaround for the verbal offer: $150k base salary, $15k target bonus, $60k RSU over 4 years ($15k annual RSU), no sign-on bonus for a total annual compensation of $180k. The recruiter previously quoted a base salary range of $145k to $160k for San Diego. I was disappointed in this offer which was low compared to public data and their range. The recruiter shared that all feedback from the interview rounds was extremely positive and I have a MS in CS. After the recruiter learned I had another pending offer, they refused to negotiate before hearing the competing offer. I accepted the other offer without negotiating with ServiceNow. The other role & product was much more exciting even if ServiceNow could match the compensation package.
Preguntas de entrevista [4]
Pregunta 1
Valid Parentheses (LeetCode #20)
Describe a procedure to determine whether all parentheses are correctly matched. No running code is necessary.
Solicité el puesto por otro medio. Acudí a una entrevista en ServiceNow (Hyderabad) en dic 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
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
Preguntas de entrevista [1]
Pregunta 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