Latest Questions | Page 6

There are N trolleys used to transport products and each trolley is given a unique ID from 0 to N-1. A trolley operates for a certain time period and is able to carry products. For each trolley, the automated system stores three parameters i.e., the start and end time of operation (both inclusive) and units of products carried. A trolley can be operated within a specified period. No two trolleys c an be operated during the same period, but if a trolley's operating period ends at point T, then another trolley can be immediately started at T. The system must store the maximum number of products transported.

Write an algorithm to find the maximum number of products transported.

Input
The first line of the input consists of two space-separated integers - trolleyList_row and trolleyList_col, representing the number of trolleys (N) and the number of parameters associated with each trolley (trolleyList_col(M) is always equal to three).
The next N lines consist of M space-separated integers representing the starting of the period, ending of the period and, the number of products carried by the trolley, respectively.

Output
Print an integer representing the maximum number of products transported.

Constraints
0 ≤ trolleyList_row ≤ 10^4
0 ≤ starting of the period, ending of the period ≤ 1000
0 < number of products carried by the trolley ≤ 104
trolleyList_col = 3

Example
Input:
4 3
0 2 4
0 4 9
2 4 6
5 10 20

Output:
30 Show More

Given three points a(x1, y1), b(x2, y2), and c(x3, y3), determine if they form a non-degenerate triangle. Then, check if two points, p(xp, yp) and q(xq, yq), are inside or on the triangle.

Return the corresponding scenario number:
0. The lines do not form a valid non-degenerate triangle.
1. Point p is inside the triangle, but point q is not.
2. Point q is inside the triangle, but point p is not.
3. Both points p and q are inside the triangle.
4. Neither point p nor point q is inside the triangle.

Note: A triangle is considered non-degenerate if it meets the following conditions, where |ab| denotes the length of the line segment between points a and b:
· |ab| + |bc| > |ac|
· |bc| + |ac| > |ab|
· |ab| + |ac| > |bc|

Example
1 = a(x1, y1) : (2, 2)
2 = b(x2, y2) : (7, 2)
3 = c(x3, y3) : (5, 4) Show More

Vowel SubString

Given a string composed of lowercase letters within the ASCII range 'a'-'z', determine the number of substrings that consist solely of vowels, where each vowel appears at least once. The vowels are ['a', 'e', 'i', 'o', 'u']. A substring is defined as a contiguous sequence of characters within the string.
Example
s = 'aeioaexaaeuiou'

There is a substring to the left that is made of vowels, 'aeioae', which is followed by an 'x'. Since 'x' is not a vowel, it cannot be included in the substring, and this substring does not contain all of the vowels. It is not a qualifying substring. Moving to the right, there are four substrings that do qualify: 'aaeuiou', 'aaeuid', 'aeuiou', and 'aeuio'.

Function Description
Complete the function vowelSubstring in the editor with the following parameter(s):
string s: a string
Returns
int: the number of substrings that consist of vowels only ('a', 'e', 'i', 'o', 'u') where every vowel appears at least once.

Constraints
1 ≤ size_of(s) ≤ 10^5
s[i] is in the range ascii['a'-'z'] (where 0 ≤ i < size_of(s)) Show More

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

Drone Delivery Optimization – Amazon's Challenge

In Amazon's vast distribution network, drones are essential for delivering packages. These drones have varying capacities, ranging from 1 to 10⁹. Each j-th drone has a carrying capacity of j.
Problem Statement
Amazon needs to dispatch n packages, where the weight of the i-th package is given by the array pack[i].During peak delivery times, only two drones are available for transport. These drones must alternate in their duties. This means:
- If Drone 1 delivers the i-th package,
- Then Drone 2 must deliver the (i+1)-th package, and so on.

However, not all drones can carry all packages — some packages might be too heavy for a particular drone.
To address this issue, Amazon can replace certain packages with others of a different (lighter) weight to ensure successful delivery.

Task
Your task is to determine the minimum number of package replacements needed, such that all packages can be successfully delivered by some pair of drones, alternating turns.
You are allowed to choose any two drones with any capacity.

Example
n = 4
pack = [3, 1, 3, 2] Show More