AmbitionBox Service Now Developer and Administrator Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

In first round they asked me 2 coding questions where he asked me to code as close as possible to the actual one.

Q1. 
Ninja and Sorted Array Merging Problem
Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...read more
Ans. 
Merge two sorted arrays into one sorted array in place.
• Use two pointers to compare elements from both arrays and place them in the correct position in ARR1.

• Start from the end of ARR1 and compare elements from both arrays, placing the larger element at the end of ARR1.

• Continue this process until all elements from ARR2 are merged into ARR1.
Answered by AI
Add your answer
Q2. 
Word Distance Calculation
Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...read more
Ans. 
Find the smallest distance between two words in a document for multiple queries.
• Iterate through the document array to find the indices of the two words in each query.

• Calculate the absolute difference between the indices to get the distance.

• If a word from the query is not present in the document, return the length of the document array.

• Repeat the process for each query and output the smallest distance for each.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Then in the second round they asked a little about tree and told me to code 2 codes.

Q1. 
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te...read more
Ans. 
The problem requires implementing a function to return the level order traversal of a binary tree.
• Implement a function that takes the root of the binary tree as input and returns the level order traversal of the tree.

• Use a queue data structure to perform level order traversal.

• Process each level of the tree one by one, starting from the root node.

• Print the node values at each level in the order they appear from left to ...read more
Answered by AI
Add your answer
Q2. 
Combination Sum Problem Statement
Given an array of distinct positive integers ARR and a non-negative integer 'B', find all unique combinations in the array where the sum is equal to 'B'. Numbers can be c...read more
Ans. 
Find all unique combinations in an array where the sum is equal to a given target sum, with elements in non-decreasing order.
• Use backtracking to generate all possible combinations.

• Sort the array to ensure elements are in non-decreasing order.

• Track the current combination and sum while backtracking.

• Terminate recursion when the sum equals the target sum.

• Avoid duplicates by skipping elements that have been used in previou
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 minutes
Round difficulty - Medium

This was a online test round where I was given 3 DSA questions to be solved in 60 minutes.

Q1. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves finding the number of distinct ways to climb to the Nth stair by taking one or two steps at a time.
• Use dynamic programming to solve the problem efficiently.

• The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

• Handle base cases for N=0 and N=1 separately.

• Consider using modulo 10^9+7 to avoid overflow in calculations.
Answered by AI
Add your answer
Q2. 
Optimal Strategy for a Coin Game
You are playing a coin game with your friend Ninjax. There are N coins placed in a straight line.
Here are the rules of the game:
1. Each coin has a value associated wit...read more
Ans. 
The problem involves finding the optimal strategy to accumulate the maximum amount in a coin game with specific rules.
• Start by understanding the rules of the game and how players take turns to choose coins.

• Consider the scenario where both players play optimally to maximize winnings.

• Iterate through different strategies to determine the best approach for selecting coins.

• Keep track of the total winnings accumulated by eac...read more
Answered by AI
Add your answer
Q3. 
Generate All Parentheses Combinations
Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered w...read more
Ans. 
Generate all possible valid parentheses configurations using N pairs.
• Use backtracking to generate all possible combinations of parentheses.

• Keep track of the number of open and close parentheses used.

• Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.

• Base case: when the length of the generated string is 2*N, add it to the result array.
Answered by AI
Add your answer

Q1. What is your weakness
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Total of 8 questions:

4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.

Q1. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of the running sum modulo K.

• Use a hashmap to store the frequency of remainders.

• For each prefix sum, check how many previous prefix sums have the same remainder.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Ans. 
Sort an array in a wave-like pattern where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap elements at even indices with their adjacent odd indices to form a wave pattern.

• There can be multiple valid wave arrays, so any valid wave array is acceptable.

• Ensure the first element is greater than or equal to the second element to start the wave pattern.
Answered by AI
Add your answer
Q2. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
Convert a given integer number into its corresponding word representation.
• Implement a function that takes an integer as input and returns the word representation of that number.

• Break down the number into its individual digits and convert each digit into its word form.

• Handle special cases like numbers between 10 and 19, and multiples of 10.

• Combine the word forms of individual digits to form the final word representation
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.

Q1. How does Facebook store comments in its database?
Ans. 
Facebook stores comments in its database using a combination of relational and non-relational databases.
• Comments are typically stored in a relational database like MySQL for structured data storage.

• For scalability and performance, Facebook may also use a NoSQL database like Cassandra or HBase for storing comments in a denormalized format.

• Metadata related to comments such as likes, timestamps, and user information may b...read more
Answered by AI
Add your answer

Some database questions,some java questions .

Q1. What is the difference between javascript and jQuery.
Ans. 
JavaScript is a programming language used for web development, while jQuery is a library built with JavaScript to simplify HTML document traversal and manipulation.
• JavaScript is a programming language, while jQuery is a library written in JavaScript.

• JavaScript can be used for a wide range of tasks, while jQuery is mainly used for DOM manipulation and event handling.

• JavaScript is a core technology for web development, w...read more
Answered by AI
Add your answer
Q2. Define different types of join
Ans. 
Different types of joins are used in SQL to combine rows from two or more tables based on a related column between them.
• Inner Join: Returns rows when there is at least one match in both tables.

• Left Join (or Left Outer Join): Returns all rows from the left table and the matched rows from the right table.

• Right Join (or Right Outer Join): Returns all rows from the right table and the matched rows from the left table.

• Full ...read more
Answered by AI
Add your answer
Q3. Define multithreading concept and exception handling.
Ans. 
Multithreading allows multiple threads to run concurrently, while exception handling deals with errors in a program.
• Multithreading involves running multiple threads simultaneously to improve performance and responsiveness.

• Threads share the same memory space but have their own program counter and registers.

• Exception handling is a mechanism to handle errors or exceptional situations in a program.

• It helps prevent the prog...read more
Answered by AI
Add your answer

Q1. Data management intern , based in excel .interview questions
Add your answer

C, C++, Java, PHP i can do this programming for coding test

Q1. What is Java? What is Class? What is Polymorphism? What is Backend web development? What is Data Abstraction? What is Artificial Intelligence? What is a software? What is Frontend web development? What i...read more
Ans. 
Java is a popular programming language used for developing a wide range of applications.
• Java is an object-oriented language.

• It is platform-independent and can run on any device with a Java Virtual Machine (JVM).

• Java is known for its robustness, security, and scalability.

• It is widely used in web development, mobile app development, and enterprise software development.
Answered by AI
View 1 more answer
Q2. What is Method Overloading?
Ans. 
Method Overloading is the ability to have multiple methods with the same name but different parameters.
• Method Overloading is a feature of object-oriented programming.

• It allows a class to have multiple methods with the same name but different parameters.

• The compiler determines which method to call based on the number and types of arguments passed.

• Example: void print(int x), void print(String s), void print(int x, String
Answered by AI
View 1 more answer
Q3. What is Abstract class?
Ans. 
An abstract class is a class that cannot be instantiated and is used as a base class for other classes.
• An abstract class can have abstract and non-abstract methods.

• Abstract methods have no implementation and must be implemented by the derived class.

• An abstract class can have constructors and instance variables.

• An abstract class can be used to define a common interface for a group of related classes.

• Example: Animal is a...read more
Answered by AI
View 1 more answer