Coding Wars
There are 'N' coders standing in a line, where i denotes the ith position of a coder with a rating of Ri. All ratings are distinct.
You have to form a team of 3 from amongst them with the condition:
Any three coders with positions (i, j, k) and ratings ("Ri< Rj< Rk" or "Ri > Rj > Rk") and(1 <= i < j < k <= N)
You have to find out how many such teams exist (1 coder can be part of m ultiple teams).
Input:
N = 5
Ratings = [5, 2, 3, 1, 4]
Output:
3
(5, 2, 1), (5, 3, 1), (2, 3, 4) Show More

String Encoding
Encode a given string by collapsing consecutive instances of a single character into two pieces of information: the number of instances and the character. Note that even single characters should be run-length encoded. If the string is empty, return an empty string. Your implementation should work on all alphanumeric characters.
Function Description
Complete the function collapse lnput which takes a string input as a parameter and returns the compressed string.
Sample Input:
GGGGGrrrrrrrrrrrrttt
Sample Output:
5G14r3t
Explanation:
There are 5 'G' characters, then there are 14 'r's, then there is 1 't'. Show More

Break a Palindrome
A palindrome reads the same forwards and backwards, like "mom". Modify a palindrome by changing exactly one character to another character within the ASCII range [a-z].
The goal is to ensure the new string fulfills the following criteria:
1.It is not a palindrome.
2.It is alphabetically lower than the original palindrome.
3.It is the smallest possible string alphabetically that can be obtained by changing just one character.
Return the new string, or "IMPOSSIBLE" if it is not feasible to create such a string.
Example:
palindromeStr = 'aaabbaaa'
* Possible strings lower alphabetically than 'aaabbaaa' after one change are ['aaaabaaa', 'aaabaaaa'].
* 'aaaabaaa' is not a palindrome and is the lowest string that can be created from palindromeStr.
Function Description
Complete the function breakPalindrome in the editor with the following parameter:
string palindromeStr: the original string
Returns:
string: the resulting string, or "IMPOSSIBLE" if one cannot be formed. Show More

Vaccination Drive
In order to curb the spread of the novel COVID-19 virus, the citizens of Hackerland need to be vaccinated on priority. There are center_nodes vaccination centers in Hackerland, where each center has a status denoted by status[i]:
• Centers with a shortage of vaccines have status 1.
• Those with sufficient vaccines have status 2.
• Those with a surplus have status 3.

Vac cines can be transferred from centers with a surplus to centers with a deficit. There is a network of bidirectional roads between centers where the ith road is between cities center_from[i] and center_to[i]. Each road takes 1 unit of time to traverse. Find the minimum time in which all deficient centers can receive a supply of vaccines from some surplus center.

Note: • Surplus centers have an inexhaustible supply of vaccines.
• Multiple surplus centers can ship their surplus simultaneously.
• Multiple deliveries from a single surplus center can leave simultaneously.
• Vaccines are only shipped from centers with status 3 to centers with status 1. Status 2 centers do nothing. Show More

Optimal Points Selection

Given a set of n distinct points on the x-axis, choose k of them such that the minimum distance between any two chosen points is as large as possible. Find this maximum possible minimum distance.
Example
Consider n = 5, k = 3, and x = [1, 4, 2, 9, 8].
In the optimal solution, one of the possible selections of points is [1, 4, 8]. Here,
The distance between 1 and 4 = abs(1 - 4) = 3
The distance between 1 and 8 = abs(1 - 8) = 7
The distance between 4 and 8 = abs(4 - 8) = 4
The minimum amongst them is 3, which is the maximum possible.
Function Description
Complete the function maximizeMinimumDistance in the editor below.
maximizeMinimumDistance has the following parameters:
int x[n]: the x-coordinates of points
int k: the number of points to choose
Returns
int: the maximum possible minimum distance between any 2 of the chosen points. Show More

Optimal Points Selection

Given a set of n distinct points on the x-axis, choose k of them such that the minimum distance between any two chosen points is as large as possible. Find this maximum possible minimum distance.
Example
Consider n = 5, k = 3, and x = [1, 4, 2, 9, 8].
In the optimal solution, one of the possible selections of points is [1, 4, 8]. Here,
The distance between 1 and 4 = abs(1 - 4) = 3
The distance between 1 and 8 = abs(1 - 8) = 7
The distance between 4 and 8 = abs(4 - 8) = 4
The minimum amongst them is 3, which is the maximum possible.
Function Description
Complete the function maximizeMinimumDistance in the editor below.
maximizeMinimumDistance has the following parameters:
int x[n]: the x-coordinates of points
int k: the number of points to choose
Returns
int: the maximum possible minimum distance between any 2 of the chosen points. Show More