ServiceNow Interview Questions, Process, and Tips

Q1. LDAP - SSO - OAUTH EMAIL INBOUND ACTIONS NOTIFICATIONS IN SERVICENOW WEBSERVICES - REST and SOAP response codes majorly and header and query parameters basic linux commands good to have SQL or javascript...read more
Add your answer

Q1. Difficult scenario faced , why do you want to change company
Add your answer

2 coding questions on DSA - Trees and Strings

Q1. DSA question on Arrays, Strings, Trees Basic Java Questions
Add your answer
Q2. N meetings Find sub Array sum 0
Ans. 
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.
Answered by AI
Add your answer

Q1. Can you tell me about yourself and your professional experience?
Ans. 
I am a detail-oriented professional with experience in operations management and process improvement.
• Over 5 years of experience in operations management

• Skilled in process improvement and efficiency

• Strong attention to detail and problem-solving abilities

• Previous roles include Operations Coordinator at Company X and Operations Manager at Company Y
Answered by AI
Add your answer

Q1. Scenario-based questions were presented for you to answer
Add your answer

Q1. Interview was for one hour and it was entirely on javascript. Questions were related to various javascript concepts such as hoisting, closures, prototypes, inheritance and web performance. Lot of code snip...read more
Add your answer
Q2. There were couple of coding questions as well
Add your answer

Q1. 2nd round was design round with the interviewer from US. Duration of interview was for 1 hour and he gave a problem statement.
Add your answer
Q2. He wanted to design an online card game and implement the basic functionality using pure javascript. He mentioned not to use any framework such as recact or vue/angular.
Add your answer

Q1. Interview was for 1 hour. It was coding round and interviewer asked couple of questions.
Add your answer
Q2. Questions were based on shortest path and sorting.
Add your answer

Q1. 4th round was with hiring manager based in US. Manager asked couple of basic coding questions involving inbuild array functions and objects.
Add your answer
Q2. Also gave a problem and asked to optimise the solution.
Add your answer

Simple coding test - DSA questions. Questions on JS

Q1. JS Concepts - Closures, Promise
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It starts with a brief introduction and then the interviewer move to coding questions

Q1. 
Pascal's Triangle Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Set Matrix Zeros 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]...read more
Ans. 
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 ...read more
Answered by AI
View 2 more answers

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?

Q1. 
K-th Smallest Element in BST
Your task is to find the ‘K-th’ smallest element in a given Binary Search Tree (BST).
Explanation:
A Binary Search Tree is a binary tree in which for each node, all elements...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. 
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'.
Answered by AI
Add your answer