AdSparx Interview Questions and Answers

Q1. Tell about your self then recently which movie you saw translate that movie in English there is only 1 Round but it's around 1hour's
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

Test Description/Instruction as Mentioned on the portal and mail :

1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.

Q1. Flood Fill Algorithm
Ninja has found his new passion for photography. He has clicked some really good photos but in one of his images, he doesn’t like the color of a particular region. So, he decides to ch...read more
Ans. 
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
• The image is represented as a 2D array of positive integers

• The starting pixel and new color are given

• Adjacent pixels are connected in up, down, left, or right directions

• Diagonal pixels are not considered adjacent

• Implement the Flood Fill Algorithm to replace the color of the given pixel and it...read more
Answered by AI
View 3 more amswers
Q2. Kruskal’s Minimum Spanning Tree Algorithm
You have been given a connected undirected weighted graph. Your task is to find the weight of the minimum spanning tree of the given graph.
A minimum spanning tr...read more
Ans. 
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
• Implement Kruskal's algorithm to find the minimum spanning tree

• Use a disjoint set data structure to keep track of connected components

• Sort the edges in non-decreasing order of their weights

• Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle

• Return the sum of weigh
Answered by AI
View 2 more amswers
Q3. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. 
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
• Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.

• Then it merges the two sorted halves to produce a single sorted array.

• The time complexity of merge sort is O(n log n), where n is the size of the input array.

• The algorithm is efficient ...read more
Answered by AI
View 2 more amswers