SE 2

Given two integers, ‘A’ and ‘B', you can perform the following operation any number of times (possibly zero).

Change the value of ‘A’ with the absolute difference between ‘A’ and ‘B'.

Your task is to find the minimum value of ‘A’ achieved using the above operation zero or more times.

Example :

‘A’ = 16, ‘B’ = 6
Here the minimum possible value of ‘A’ is 2. 
We can perform the operation in the following order:
‘A’ = |16 - 6| = 10
‘A’ = |10 - 6| = 4
‘A’ = |4 - 6| = 2.
So, the answer is 2.
Here |x - y| denotes the absolute difference between x and y.

You are given an undirected, connected and weighted graph G(V, E), consisting of V number of vertices (numbered from 0 to V-1) and E number of edges.

Find and print the total weight of the Minimum Spanning Tree (MST) using Kruskal's algorithm.

By definition, a minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.

What is the number of combinations for four key presses on an analog number pad?

You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:

Value 0 - representing an empty cell.

Value 1 - representing a fresh orange.

Value 2 - representing a rotten orange.

Every second, any fresh orange that is adjacent(4-directionally) to a rotten orange becomes rotten.

Your task is to find out the minimum time after which no cell has a fresh orange. If it's impossible to rot all the fresh oranges then print -1.

Note:

1. The grid has 0-based indexing.
2. A rotten orange can affect the adjacent oranges 4 directionally i.e. Up, Down, Left, Right.

Design DNS cache optimization. I had to discuss the complete environment regarding the cache (requirements, conditions, etc.) before designing it.

Design a HackerRank dashboard, where a student can submit only one project, multiple judges can create and edit their scores for the projects any number of times, and a leaderboard displays the project with the highest average score.