ServiceNow Interview Experience (On-Campus)
Question Details
ServiceNow visited our campus (BITS Pilani) during September for the position of Associate Software Engineer(ASE). There was one online coding round followed by three tech...
Full Details
ServiceNow visited our campus (BITS Pilani) during September for the position of Associate Software Engineer(ASE). There was one online coding round followed by three technical interviews.
Coding Round: The first round was held on 27th Sept and consisted of 15 MCQs on DBMS, Java, OS, Computer Network and 1 coding question. The MCQs were having easy-medium difficulty. And the coding question was Aggressive Cows, the language was different but it boils down to the same. The platform used was Hackerrank. After the online round, around 30 students were selected for interviews.
Technical Round -1: The interview began with questions like tell me about yourself & discussions on the projects. I did a research project & this caught their attention. The discussion went for ~10 min. After it, I was asked to code two data structures & Algorithm questions of easy-medium difficulty level. This round was held on 2nd Oct. The First question was Key Pair and could be found at https://www.geeksforgeeks.org/problems/key-pair5616/1 . I told four approaches from O(N^2) complexity involving brute-force to O(N) involving unordered map and the interviewer seemed satisfied with the answer. The second question was to design a data structure which could perform add(), remove() & calculate_product() in O(1) time. The question seems easy but one has to take care of the edge cases involving zeros. After this round, around 23 students were selected for the
next round which has scheduled on the same day.
Technical Round -2: The interviewer directly began with the coding questions and was very friendly & energetic. This round consisted of two questions of medium difficulty level. The interviewer asked me a warm-up question: Given two string, what's the length of the common prefix substring. After this, the interviewer began with the interview process. The first question was an extension of the warm-up question. Given two string,
return the length of the longest common substring. It can be found at https://www.geeksforgeeks.org/problems/longest-common-substring1452/1 . The second question was a bit tricky & difficult. Given n, print n-bit Gray Code sequence. For eg, if n = 2, the sequence would be 00 01 11 10. I face some difficulties while thinking of the solution, I told everything that came to my mind. The interviewer guided me & finally, I was able to solve it. After this round, around 17 students were selected for the
next round which has scheduled on the same day. Hiring Manager Round +
Technical Round: The interviewer first introduced himself and asked for the same. The round started with a brief discussion on Projects. The interviewer asked me to tell you about the project in which I faced the most difficulty. After the discussion, I was to code a graph question. The question was given a binary tree, perform invert operation on every edge. The invert operation changes the parent to child & vice-versa. Very few details were provided about the question & the interviewer wanted to see how one proceeds & thinks of implementing it. Like I mentioned the tree will get converted to a directed graph having multiple entry nodes & now every node would be having only one child. As there were many ways to go ahead, I discussed my approaches & was given feedback for the same. After the interview, I was asked if I had any doubts. I would advise preparing for some questions beforehand. The results came on the same day, around I0 people got selected for the summer internship & I was one of them.
About This Question
This is a reported interview question from a service now interview for a swe role (intern level) during the oa round reported in 2025.
It covers the following topics: Trees, Strings, Binary Tree, Sql, Graph, Graphs .
Difficulty rating: Easy
More Service Now Interview Questions
About Service Now Interview Reports
This question was reported by a candidate who interviewed at Service Now. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Service Now are the higher-signal extractions to take from this report.
For broader preparation context, the Service Now interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Service Now reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Service Now Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Service Now reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.