Suppose we have a binary string called boxes, where boxes[i] is '0' indicates the ith box is empty, and '1' indicates it contains one ball. Now, in one operation, we can move one ball from a box to an adjacent box. After doing so, there may be more than one ball in some boxes. We have to find an array answer of size n, where answer[i] is the minimum number of operations needed to move all the balls to the ith box.So, if the input is like boxes = "1101", then the output will be [4, 3, 4, 5]To put ... Read More

Suppose we have a string s with only lowercase letters, we have to find find the maximum number of non-empty substrings of s that meet the following rulesSubstrings are non-overlappingA substring that contains a specific character ch must also contain all occurrences of ch.We have to find the maximum number of substrings that meet these two conditions. If there are more than one such solutions with the same number of substrings, then return that with minimum total length.So, if the input is like s = "pqstpqqprrr", then the output will be ["s", "t", "rrr"] because all of the possible substrings ... Read More

Suppose we have a list of positions, which is containing a list of coordinate points where some houses are located. If you want to make a service center at (xc, yc) such that the sum of Euclidean distance from any given point to (xc, yc) is minimum. So we have to find the sum of minimum distance.So, if the input is like positions = [(10, 11), (11, 10), (11, 12), (12, 11)], then the output will be 4.0To solve this, we will follow these steps −numIter := 50Define a function total() . This will take cx, cy, positionstotal := 0.0for ... Read More

Suppose there are two players Amal and Bimal, they are playing a game, and with Amal starts first. Initially, there are n different stones in a pile. On each player's turn, he makes a move consisting of removing any square number (non-zero) of stones from the pile. Also, if one player is unable to make a move, he loses the game. So if we have n, we have to check whether Amal can win the game or not.So, if the input is like n = 21, then the output will be True because at first Amal can take 16, then ... Read More

Suppose we have one 2D array called groups, and another array nums. We have to check whether we can select n disjoint subarrays from the array nums such that the ith subarray is equal to groups[i] (0-indexed), and if i > 0, the (i-1)th subarray will appear before the ith subarray in nums.So, if the input is like groups = [[2, -2, -2], [4, -3, 0]] nums = [1, -1, 0, 2, -2, -2, 4, -3, 0], then the output will be true because array group[0] is present from index 3 to 5 of nums and group[1] is from index ... Read More

Suppose we have a string called num representing a very large integer number and also have another value k. We can swap any two adjacent digits of the values at most k times. We have to find the minimum value we can get.So, if the input is like num = "5432" k = 4, then the output will be 2453 because at first number is 5432. Then after first phase it will be 4532, then 4523, then 4253 and at final phase 2453.To solve this, we will follow these stepsmin_num := sort the digits of numi := 0, to_find := ... Read More

Suppose we have an array nums where the ith element indicates a bag containing nums[i] number of balls. We also have another value called mx. We can perform the following operation at most mx times −Select any bag of balls and divide it into two new bags with at least one ball.Here penalty is the maximum number of balls in a bag.We have to minimize the penalty after the operations. So finally, we have to find the minimum possible penalty after performing the operations.So, if the input is like nums = [4, 8, 16, 4], mx = 4, then the ... Read More

Suppose we have a string s, we have to find the number of homogenous substrings of s. The answer may be very large, so return answer modulo 10^9+7. A string is said to be homogenous when all the characters of the string are the same.So, if the input is like s = "xyyzzzxx", then the output will be 13 because the homogenous substrings are listed like1."x" appears thrice."xx" appears once.3. "y" appears twice."yy" appears once.5. "z" appears thrice."zz" appears twice."zzz" appears once.so , (3 + 1 + 2 + 1 + 3 + 2 + 1) = 13.To solve this, ... Read More

Suppose we have an array called points containing the coordinate points on a 2D plane, they are sorted by the x-values, where points[i] = (x_i, y_i) so x_i < x_j for all 1

Suppose we have three values a, b and c. We are playing a solitaire game with three piles of stones whose sizes are a, b, and c respectively. Each turn the player selects two different non-empty piles, take one stone from each, and add 1 point to his score. The game ends when there are fewer than two non-empty piles. So we have to find the maximum score you can get.So, if the input is like a = 4, b = 4, c = 6, then the output will be 7 because the initial state is (4, 4, 6), then ... Read More