Suppose we have a list of classes where classes[i] represents [pass_i, total_i] represents the number of students passed the examination of ith class and total number of students of the ith class respectively. We also have another value extra. This indicates extra number of brilliant students that are guaranteed to pass the exam of any class they are assigned to. We have to assign each of the extra students to a class in a way that maximizes the average number of passed student across all the classes. The pass ratio of a class determined by the number of students of ... Read More

Suppose we have an array customers, where customers[i] = holds a pair [arrival_i, time_i], here arrival_i is the arrival time of the ith customer. And the arrival times are sorted from less to high. And time_i is the time needed to prepare the order of the ith customer. Now, when a customer arrives, he/she gives the order, and the only that order starts preparing when the cook is idle. The cook does not prepare food for more than one customer at a time. And he prepares in order they were placed their orders. We have to find the average waiting ... Read More

Suppose we have one undirected star graph with n nodes labeled from 1 to n. As we know a star graph is a graph where there is one center node and exactly n - 1 edges that connect the center node with every other node. We have to find the center of the given star graph.So, if the input is likethen the output will be 3 as 3 is at center.To solve this, we will follow these steps −seen := a new setfor each edge (u, v) in graph, doif u is in seen, thenreturn uif v is in seen, ... Read More

Suppose, we are given a substring denoted by 's'. We have to find out the unique substrings and return the number of these substrings as output.So, if the input is like s = 'prrstvt', then the output will be 26.The distinct substrings will be −'pr', 'rrs', 'st', 'rr', 'tv', 'rstv', 'stvt', 'prrstv', 'prrstvt', 'rrstvt', 's', 'prrst', 'stv', 'rrstv', 'rst', 'v', 'tvt', 'rstvt', 'r', 'rs', 'vt', 't', 'prr', 'p', 'rrst', and 'prrs'.To solve this, we will follow these steps −visited := a new mapfor each index ind, and value let in s, dotemp := a new setif ind-1 is present in ... Read More

Suppose we have one undirected weighted connected graph. The graph has n nodes and they are labelled from 1 to n. A path from start to end is a sequence of nodes like [z0, z1, z2, ..., zk] here z0 is start node and zk is end node and there is an edge between zi and zi+1 where 0

Suppose we have an array called nums and another value k. We are at index 0. In one move, we can jump at most k steps right without going outside the boundaries of the array. We want to reach the final index of the array. For jumping we get score, that is the sum of all nums[j] for each index j we visited in the array. We have to find the maximum score we can get.So, if the input is like nums = [1, -2, -5, 7, -6, 4] k = 2, then the output will be 10 because, we ... Read More

Suppose we have an array called nums and two values limit and goal. The array is special because |nums[i]|

Suppose we have an array called nums (with positive values only) and we want to erase a subarray containing unique elements. We will get score that is sum of subarray elements. We have to find the maximum score we can get by erasing exactly one subarray.So, if the input is like nums = [6, 3, 2, 3, 6, 3, 2, 3, 6], then the output will be 11, because here optimal subarray is either [6, 3, 2] or [2, 3, 6], so sum is 11.To solve this, we will follow these steps −seen := a new mapans := sum := ... Read More

Suppose we have a string s. We have to find the sum of beauty of all of its substrings. The beauty of a string is actually the difference in frequencies between the most frequent and least frequent characters. So if the string is "abaacc", then its frequency is 3 - 1 = 2.So, if the input is like s = "xxyzy", then the output will be 5 because the substrings with non-zero beauty are ["xxy", "xxyz", "xxyzy", "xyzy", "yzy"], each has beauty value 1.To solve this, we will follow these steps −res:= 0for i in range 0 to size of ... Read More

Suppose we have an array called stones where stones[i] represents the value of the ith stone from the left. Two friends Amal and Bimal re playing a turn based game with these stones and Amal starts first always. There are n stones arranged in a row. Each player can remove either the leftmost stone or the rightmost stone from the row and get points equal to the sum of the remaining stones' values in the row. Who will get the higher score will win. Now, Bimal found that he will always lose this game, so he decided to minimize the ... Read More