ServiceNow Interview Questions, Process, and Tips

Q1. How you manage dependencies
Ans. 
I manage dependencies by identifying, tracking, and communicating them effectively.
• Identify all dependencies early on in the project

• Create a dependency matrix to track relationships

• Regularly communicate with stakeholders to ensure dependencies are being managed effectively
Answered by AI
Add your answer
Q2. How do you prioritize your TASK
Add your answer
Q3. Previous experience of conflict management
Add your answer

Q1. Minimum number of platforms required for a railway station.
Ans. 
Minimum 2 platforms required for a railway station.
• At least 2 platforms are required for trains to arrive and depart simultaneously.

• Additional platforms may be required based on the frequency of trains and passenger traffic.

• Platforms should be long enough to accommodate the longest trains that will use the station.

• Platforms should also have appropriate facilities for passengers, such as seating, shelter, and signage.
Answered by AI
Add your answer
Q2. Set of numbers from an array that can form nearest sum to the given number
Ans. 
Find set of numbers from an array that can form nearest sum to the given number.
• Sort the array in ascending order

• Use two pointers approach to find the nearest sum

• Return the set of numbers
Answered by AI
Add your answer

Q1. Trapping Rain water problem
Ans. 
Trapping Rain Water Problem
• The problem involves calculating the amount of water trapped between bars in a histogram

• The solution involves finding the maximum height of bars on both sides of each bar and subtracting the height of the bar itself

• This can be done using two arrays to store the maximum height of bars on the left and right side of each bar
Answered by AI
Add your answer
Q2. Least cost to travel from source to destination(DP problem)
Ans. 
The problem is to find the least cost to travel from source to destination using dynamic programming.
• Use dynamic programming to solve the problem

• Create a 2D array to store the minimum cost to reach each cell

• Fill the array using the recurrence relation: minCost[i][j] = cost[i][j] + min(minCost[i-1][j], minCost[i][j-1], minCost[i-1][j-1])

• The final answer will be stored in minCost[m][n], where m and n are the coordinates ...read more
Answered by AI
Add your answer

Q1. Interfaces, diamond problem, abstraction, OOPs concepts, inheritance, abstract classes, Race condition, Normalization
Add your answer
Q2. Arrays coding question and a DP problem in mid to high level of difficulty.
Add your answer
Q3. System design question
Add your answer

Q1. DP problems (mid - high difficulty)
Add your answer

Q1. Level order traversal of Binary tree
Ans. 
Level order traversal of Binary tree
• Use a queue to traverse the tree level by level

• Enqueue the root node and then dequeue it and enqueue its children

• Repeat until the queue is empty
Answered by AI
Add your answer

Q1. Tell me about yourself
Ans. 
I am a dedicated and detail-oriented professional with a background in HR and a passion for supporting employees.
• Background in HR

• Detail-oriented

• Passionate about supporting employees
Answered by AI
Add your answer

Q1. Since my role is analyst role they have asked me questions in sql and they were of medium level
Add your answer

Q1. In this they asked about the projects that I have done and sql questions of moderate to high level
Add your answer

Q1. Basic behavioural questions
Add your answer

Profit and loss, numerals, algebra

Q1. Introduction, tell me about yourself, and installations of virtualization and many..
Add your answer