ServiceNow interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

ServiceNow
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
I joined a service-based company after my graduation, and after gaining one year of experience and a good understanding of DSA, I started giving interviews for SDE1 roles.
Application story
After I saw the job on LinkedIn, I reached out for a referral. Luckily, I got referred, and then I received the interview call two weeks after applying.
Why selected/rejected for the role?
I met the eligibility criteria, and all the interviews went well. Also, I was asked about LLD in the third round, and I was able to answer it correctly. So, my design experience also helped me secure the role.
Preparation
Duration: 8 months
Topics: Arrays, Recursion, Dynamic Programming, Hashmaps, Trees, Linked Lists, Graphs, Stacks, and Queues, etc.
Tip
Tip

Tip 1: Try on your own, and start looking at the solution if you can't figure it out.
Tip 2: Revisit problems so that you don't forget them.
Tip 3: Make good notes, as it will make things easier in the future.

Application process
Where: Referral
Eligibility: 1+ years experience (Salary: 32 LPA)
Resume Tip
Resume tip

Tip 1: Highlight the main tech stacks in your projects.
Tip 2: Keep your resume to one page.

Interview rounds

01
Round
Medium
Telephonic
Duration5 minutes
Interview date19 Dec 2024
Coding problem3

I was asked about my work experience, the tech stack I am currently working with, my notice period, other formalities, and whether I am available for the Hyderabad location, among other things.

1. HR Question

Tell me about your work experience.

2. HR Question

Tell me about the type of tech stack you are currently working on, as well as your notice period.

3. HR Question

Are you available for the Hyderabad location and all other requirements?

02
Round
Medium
Face to Face
Duration60 minutes
Interview date21 Jan 2025
Coding problem2

1. Jump Game

Moderate
15m average time
85% success
0/80
Asked in companies
GoogleFlipkartDeutsche Bank

You are given an integer array, nums. You are initially positioned at the first index of the array, and each element in the array represents the maximum jump length you can make from that position.

Return true if you can reach the last index; otherwise, return false.

Try solving now
Easy
20m average time
80% success
0/40
Asked in companies
InfosysTata Consultancy Services (TCS)Urban Company (UrbanClap)

You are given an array ‘arr’ of ‘N’ distinct integers. Your task is to print all the non-empty subsets of the array.

Note: elements inside each subset should be sorted in increasing order. But you can print the subsets in any order, you don’t have to specifically sort them.

 

Problem approach

Iterate over the elements one by one.
For each element, pick the element, proceed recursively, and add the subset to the result.
Then, using backtracking, remove the element and continue finding subsets, adding them to the result.

Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date23 Jan 2025
Coding problem2

1. Largest rectangle in a histogram

Hard
25m average time
75% success
0/120
Asked in companies
DelhiveryCultfitGoldman Sachs

You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of the histogram bar. Consider that the width of each histogram is 1.

You are supposed to return the area of the largest rectangle possible in the given histogram.

For example :
In the below histogram where array/list elements are {2, 1, 5, 6, 2, 3}.

alt text

The area of largest rectangle possible in the given histogram is 10.
Problem approach
  1. Create an empty stack.
  2. Start from the first bar, and perform the following steps for every bar hist[i] where i varies from 0 to n-1:
  3. If the stack is empty or hist[i] is higher than the bar at the top of the stack, push i onto the stack.
  4. If the current bar is smaller than the bar at the top of the stack, keep removing the top of the stack while the top of the stack is greater than the current bar.
  5. Let the removed bar be hist[tp]. Calculate the area of the rectangle with hist[tp] as the smallest (shortest) bar.
  6. For hist[tp], the “left index” is the previous item in the stack (previous to tp), and the “right index” is i (the current index).
  7. If the stack is not empty, remove all remaining bars from the stack one by one and repeat steps 5 and 6 for each removed bar.
Try solving now

2. Right View

Moderate
35m average time
65% success
0/80
Asked in companies
UberApplePaytm (One97 Communications Limited)

You have been given a Binary Tree of integers.

Your task is to print the Right view of it.

The right view of a Binary Tree is a set of nodes visible when the tree is viewed from the Right side and the nodes are printed from top to bottom order.

Problem approach

The idea is to traverse the tree level by level and print the last node of each level (i.e., the rightmost node). A simple solution is to perform a level-order traversal and print the last node at each level.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
Software Engineer
2 rounds | 4 problems
Interviewed by ServiceNow
3703 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by ServiceNow
1205 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
3509 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
1409 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11083 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7002 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
8503 views
1 comments
0 upvotes