ServiceNow Software Engineer Interview Questions and Answers

Q1. LRU Cache question and couple on array
Add your answer

Q1. System Design question related to Lift
Add your answer

Q1. Managerial, project related and SQL
Add your answer

Q1. Write an algo for tower on hanoi in 7 steps
Ans. 
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...read more
Answered by AI
Add your answer

Q1. Meeting rooms from leetcode
Ans. 
The Meeting Rooms problem involves determining if meeting times overlap using intervals.
• Use an array of intervals to represent meeting start and end times.

• Sort the intervals by start time to facilitate comparison.

• Check for overlaps by comparing the end time of the previous meeting with the start time of the current meeting.

• If any meeting starts before the previous one ends, there is an overlap.
Answered by AI
Add your answer
Q2. Maze path dynamic programming
Add your answer

Q1. Js questions related to classes, event loop closure, etc
Add your answer

Q1. Problem solving questions related to arrays and strings.
Add your answer

Q1. Project related questions and js questions.
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

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