You are given a 0-indexed array of strings garbage where garbage[i] represents the assortment of garbage at the ith house. garbage[i] consists only of the characters 'M', 'P' and 'G' representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes 1 minute.You are also given a 0-indexed integer array travel where travel[i] is the number of minutes needed to go from house i to house i + 1.There are three garbage trucks in the city, each responsible for picking up one type of garbage. Each garbage truck starts at house 0 and must visit each house in order; however, they do not need to visit every house.Only one garbage truck may be used at any given moment. While one truck is driving or picking up garbage, the other two trucks cannot do anything.Return the minimum number of minutes needed to pick up all the garbage. Example 1:Input: garbage = ["G","P","GP","GG"], travel = [2,4,3]Output: 21Explanation:The paper garbage truck:1. Travels from house 0 to house 12. Collects the paper garbage at house 13. Travels from house 1 to house 24. Collects the paper garbage at house 2Altogether, it takes 8 minutes to pick up all the paper garbage.The glass garbage truck:1. Collects the glass garbage at house 02. Travels from house 0 to house 13. Travels from house 1 to house 24. Collects the glass garbage at house 25. Travels from house 2 to house 36. Collects the glass garbage at house 3Altogether, it takes 13 minutes to pick up all the glass garbage.Since there is no metal garbage, we do not need to consider the metal garbage truck.Therefore, it takes a total of 8 + 13 = 21 minutes to collect all the garbage.

2391. Minimum Amount of Time to Collect GarbageMedium78786CompaniesYou are given a 0-indexed array of strings garbage where garbage[i] represents the assortment of garbage at the ith house. garbage[i] consists only of the characters 'M', 'P' and 'G' representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes 1 minute.You are also given a 0-indexed integer array travel where travel[i] is the number of minutes needed to go from house i to house i + 1.There are three garbage trucks in the city, each responsible for picking up one type of garbage. Each garbage truck starts at house 0 and must visit each house in order; however, they do not need to visit every house.Only one garbage truck may be used at any given moment. While one truck is driving or picking up garbage, the other two trucks cannot do anything.Return the minimum number of minutes needed to pick up all the garbage.

You are given a string s. Simulate events at each second i:If s[i] == 'E', a person enters the waiting room and takes one of the chairs in it.If s[i] == 'L', a person leaves the waiting room, freeing up a chair.Return the minimum number of chairs needed so that a chair is available for every person who enters the waiting room given that it is initially empty

Given the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street.Return the minimum total distance between each house and its nearest mailbox.The test cases are generated so that the answer fits in a 32-bit integer.

public class Main { public static void main(String args[]) { int arr[] = {1, 2, 3}; int m = arr.length; int n = 10; System.out.println( countWays(arr, m, n)); } static long countWays(int S[], int m, int n) { long[] table = new long[n+1]; table[0] = 1; for (int i=0; i<m; i++) for (int j=S[i]; j<=n; j++) table[j] += table[j-S[i]]; return table[n]; } } i need 14 as output

In this challenge, the user enters a string and a substring. You have to print the number of times that the substring occurs in the given string. String traversal will take place from left to right, not from right to left.