i
ServiceNow
Filter interviews by
Clear (1)
I applied via Job Portal and was interviewed in Oct 2024. There were 3 interview rounds.
2 questions in coding assessment
Two coding questions, minimum window substring, other I forgot
I applied via Approached by Company and was interviewed in Jan 2024. There was 1 interview round.
Hashmap is a data structure that stores key-value pairs and allows for quick retrieval of values based on keys.
Hashmap is typically implemented using an array of linked lists or a balanced binary search tree.
Each key is hashed to determine its index in the array, where the corresponding value is stored.
Collision handling is important in hashmap design to address cases where multiple keys hash to the same index.
Hashing ...
Topological sort is a linear ordering of vertices in a directed acyclic graph where for every directed edge uv, vertex u comes before vertex v.
Create a list to store the topological ordering of vertices.
Find a vertex with no incoming edges and add it to the list.
Remove the vertex and its outgoing edges from the graph.
Repeat the process until all vertices are added to the list.
ServiceNow interview questions for designations
Get interview-ready with Top ServiceNow Interview Questions
The Tower of Hanoi is a classic problem that involves moving disks from one peg to another, following specific rules.
Start by moving the top n-1 disks from the source peg to the auxiliary peg.
Move the largest disk from the source peg to the target peg.
Move the n-1 disks from the auxiliary peg to the target peg.
Repeat the process recursively for the n-1 disks on the auxiliary peg.
Continue until all disks are moved to th
I applied via Company Website and was interviewed before Mar 2023. There was 1 interview round.
I applied via LinkedIn and was interviewed in Sep 2022. There were 4 interview rounds.
I was interviewed in Oct 2022.
2 coding questions on DSA - Trees and Strings
Given an array of N meetings, find a subarray with sum 0.
Use a hash table to store the cumulative sum of the array elements.
If the same sum is encountered again, it means the subarray between the two indices has a sum of 0.
Handle edge cases like when the subarray starts from index 0 or when the subarray ends at the last index.
I was interviewed in May 2022.
Round duration - 60 Minutes
Round difficulty - Easy
It starts with a brief introduction and then the interviewer move to coding questions
You are provided with an integer N
. The objective is to return a 2-dimensional list representing Pascal’s triangle up to row N
.
A Pascal's triangle is a triangular arr...
Return a 2D list representing Pascal's triangle up to row N.
Iterate through each row up to N, calculating each value based on the values from the previous row
Use a nested loop to generate the triangle efficiently
Consider edge cases like N=1 separately to return [[1]]
Remember to handle the constraints given in the problem statement
Given an N x M
integer matrix, if an element is 0, set its entire row and column to 0's, and return the matrix. Specifically, if a cell has a value 0 (i.e., matrix[i][j]...
To solve the Set Matrix Zeros problem, we can use O(1) space by utilizing the first row and column to store information about zeros in the rest of the matrix.
Iterate through the matrix and use the first row and column to mark rows and columns that need to be zeroed out.
After marking, iterate through the matrix again and zero out the rows and columns based on the marks in the first row and column.
Remember to handle the ...
Round duration - 60 Minutes
Round difficulty - Easy
It starts with a brief introduction and then the interviewer move to coding questions. It basically consists of two coding questions
and some general questions like why should we hire you?
Your task is to find the ‘K-th’ smallest element in a given Binary Search Tree (BST).
A Binary Search Tree is a binary tree in which for each node, all elements...
Find the K-th smallest element in a Binary Search Tree.
Implement a function to find the K-th smallest element in a BST
Traverse the BST in-order and keep track of the count of nodes visited
Return the value of the K-th smallest node
Handle cases where the K-th smallest element does not exist by returning -1
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible combinations of three integers in the array and check if x^2 + y^2 = z^2.
Use a nested loop to generate all possible combinations efficiently.
Return 'yes' if a Pythagorean triplet is found, otherwise return 'no'.
Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
Top trending discussions
Some of the top questions asked at the ServiceNow Software Engineer interview -
The duration of ServiceNow Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 10 interviews
3 Interview rounds
based on 34 reviews
Rating in categories
Software Engineer
414
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
345
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
121
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Data Analyst
90
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
76
salaries
| ₹0 L/yr - ₹0 L/yr |
Salesforce
Oracle
SAP
Microsoft Corporation