ServiceNow Software Quality Engineer Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Easy

Type of Questions No. of Questions
Quantitative 20
Logical and Reasoning 20
Verbal 20
Section II: Coding Section
Number of Questions: 2
Time Duration: 60 min
Level of Difficulty: Easy-Medium
Type of Questions: String Manipulation and Tree based Question

Q1. 
Binary Tree Mirror Conversion Problem
Given a binary tree, your task is to convert it into its mirror tree.
A binary tree is a data structure where each parent node has at most two children.
The mirror ...read more
Add your answer
Q2. 
Palindromic Partitioning Problem Statement
Given a string ‘str’, calculate the minimum number of partitions required to ensure every resulting substring is a palindrome.
Input:
The first line contains a...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was a non eliminatory round comprising of 3 sections with a total time of 30 minutes.
Section I: Technical MCQ’s
Number of Questions: 20
Level of Difficulty: Medium -High
Programming Output questions and questions from CN, DBMS, OS and DS were asked.
Section II: Aptitude and Logical Section
Number of Questions: 10
Level of Difficulty: Easy
Section III: Coding Section
Number of Questions: 2
Level of Difficulty: Easy-Medium

Q1. 
Leaders in an Array Problem Statement
You are given a sequence of numbers. Your task is to find all leaders in this sequence. A leader is defined as an element that is strictly greater than all the elemen...read more
Add your answer
Q2. 
Spiral Matrix Path Problem
You are provided with a two-dimensional array named MATRIX of size N x M, consisting of integers. Your task is to return the elements of the matrix following a spiral order.
In...read more
Add your answer

Round duration - 80 minutes
Round difficulty - Medium

The interview went for about 75-80 minutes. I was not able to answer almost all the answers
correctly but gave almost 75% correct answers. The interviewer mainly focused on the problem
solving ability and the quality of conceptual knowledge.
1: Basic Introductory Questions
2: 2-3 Puzzle Questions 
3: Some basic Questions on DSA- about stacks, queue, arrays, memory storage accessing,
Advantages and Dis of Linked list over arrays,
4: Operating System: In all the rounds , Operating System questions were asked in abundance.
Though the questions were basic, they focused more on our concepts like how easily we were
able to explain it to them.
Questions on Kernels, Types of Kernel, Why OS, memory allocation in OS were asked.
5: Test Cases Question: We have to think and answer the possible questions while testing the
cases.
i: Test cases for a login page window.
6: Heavy discussions on the projects I have done. Why we preferred to use a particular
technology. What was my role in the project and so on.
7: I was asked to code some questions.

Q1. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Add your answer
Q2. 
Cycle Detection in a Linked List
Determine if a given Singly Linked List of integers forms a cycle.
Explanation:
A cycle exists in a linked list if a node's next pointer points back to a previous node, ...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

This round of interview was took by a senior person of the company. It was a bit lengthy as we
had more of a discussion rather than just a QnA round. The interview went for more than 90
minutes and was tougher than the first round.
1: There was a long discussion on what I written in my resume. The projects I had done,
Extracurricular and co-curricular activities I had written on the resume, the skills I have
mentioned. All of it. So be careful of whatever you mention in the resume.
2: Next he asked me a bunch of coding questions which were some very popular ones
I was asked to code in my preferred language. So there wasn’t any language barrier and for all the
questions the interviewer asked for the most optimized approach.
As I was able to answer all the questions, I wasn’t asked any more questions.
3: After the coding questions, I was asked a lot of questions of Operation System and OOPS.
i: Fragmentation- Internal and External
ii: Concepts of Kernel
iii: File Management
iv: Virtual functions and Friend Functions
v: Function Overloading And Overriding
vi: What is paging and Demand Paging?
4: Interview puzzles:
5: Testing Based Questions-
i: Five new inventions in a glass frame and the test cases to test the working a frame.
ii: Design test cases for a shopping application.
The interviewer was quite satisfied with the test cases I answered. As the main trick to solve
these kind of interview questions is to design the test cases with giving every small function an
eye and then forming all possible scenarios for the same

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Add your answer
Q2. 
Find K'th Character of Decrypted String
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...read more
Add your answer
Q3. 
Queue Using Stacks Problem Statement
Implement a queue data structure which adheres to the FIFO (First In First Out) principle, utilizing only stack data structures.
Explanation:
Complete predefined fun...read more
Add your answer
Q4. 
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
...read more
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

This was also similar to the last two Technical Interviews and was also easier from them. The
interview went for about 70 minutes and it was tilted more towards managerial side and less
technical questions were asked.
1. Program to Count set nits in an integer. (I answered 4 possible solutions to him and he was
satisfied) 
2: Working of Bubble Sort and Insertion Sort ( I was asked to dry run the solution mainly to
check the internal working of swapping and comparison)
3: Some Mathematical Puzzles
4: Design test cases for OLA Application
5: Design test cases for GMAIL Application
6: Situation based questions

Round duration - 15 minutes
Round difficulty - Easy

It was the last round and an eliminatory round as well. It was a 15 minutes long discussion round
about college life, interests, and hobbies. The HR also asked our preferred joining location
between Noida and Bangalore which gave us many hopes of our selection.
Three candidates from our college went till the HR Round.

Question related to operating system and computer network

Q1. Traverse all child nodes in tree
Ans. 
Traverse all child nodes in a tree data structure
• Use depth-first or breadth-first traversal algorithms

• Recursively visit each child node starting from the root node

• Consider using a stack or queue data structure for traversal

• Example: Traverse all nodes in a binary tree
Answered by AI
Add your answer

Q1. Question related to cloud and oops
Add your answer

Q1. Question related to my background and how web site work
Add your answer

Q1. JavaScript , coding questions
Add your answer

Q1. Coding problem, JavaScript and nodejs question
Add your answer

Q1. Explain OOPS concept and how you apply it in your implementation
Ans. 
OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
• OOPS focuses on the concept of classes and objects

• Encapsulation: bundling data and methods that operate on the data within a single unit

• Inheritance: allows a class to inherit properties and behavior from another class

• Polymorphism: ability to present the same interface for diffe...read more
Answered by AI
View 1 more answer
Q2. Difference between Comparable and Comparator. Difference between Abstract Class and Interface
Ans. 
Comparable is an interface used for natural ordering, Comparator is an interface used for custom ordering. Abstract class can have method implementations, Interface cannot.
• Comparable interface is used to define the natural ordering of objects. Example: String class implements Comparable interface for natural ordering based on alphabetical order.

• Comparator interface is used to define custom ordering of objects. Example:...read more
Answered by AI
View 1 more answer
Q3. Given a string. Find the number of occurrences of each character
Ans. 
Count occurrences of each character in a given string
• Create an array to store the count of each character

• Iterate through the string and increment the count of each character in the array

• Return the array with counts for each character
Answered by AI
Add your answer
Q4. Given an array. Remove the number of duplicates
Ans. 
Remove duplicates from an array of strings
• Iterate through the array and store each element in a set to keep track of unique values

• Create a new array with the unique values from the set
Answered by AI
Add your answer
Q5. Given a student object having name and grade data variables. Sort the object on the basis of highest grade.
Add your answer

Written coding test
Basic coding questions
Only c c++
Easy level

Q1. Bit manipulation
Add your answer
Q2. Rtos concepts,c coding concepts like structures,pointers
Add your answer

Q1. About projects more detailly
Add your answer
Q2. About memory management and layout in c
Add your answer