Programming Articles - Page 1191 of 3363

Suppose we have a set of boxes represented as a 2D array called boxTypes, where boxTypes[i] contains two elements [number of boxes of type i, number of units per box of type i]. Now we also have another value k, which is the maximum number of boxes that can be put on that truck. We can select any boxes to put on the truck as long as the number of boxes does not cross k. We have to find the maximum total number of units that can be put on the truck.So, if the input is like boxTypes = [[2, ... Read More

Suppose we have a string s whose length is even. We have to split this string into two different halves of same lengths. So consider 'a' is the first half and 'b' is the second half. We say two strings are alike when they have the same number of vowels (uppercase or lowercase). We have to check whether 'a' and 'b' are alike or not.So, if the input is like s = "talent", then the output will be True because two halves are "tal" and "ent", they are alike because they have only one vowel and two consonants.To solve this, ... Read More

Suppose we have a phone number as string. The phone number number consists of digits, spaces and/or dashes '-'. We want to reformat the phone number in a certain manner. There are few rules −Remove all spaces and dashes at beginningGroup the digits from left side to right side into blocks of length 3 until there are 4 or less digits are left.The final digits are then grouped like −For 2 digits: A single block of length 2.For 3 digits: A single block of length 3.For 4 digits: Two more blocks of length 2 each.These blocks are then clubbed by ... Read More

Suppose we have a number n. So there are n number of teams in a tournament that has some rules −If the number of teams is even currently, then each team gets merged with another team. And a total of (n/2) matches are played, from them (n/2) winner teams will move to the next round.If the number of teams is odd, then one team randomly moved in the tournament, and the rest gets merged. So a total of (n-1)/2 matches are played, and (n-1)/2+1 teams are moved to the next round as winner.We have to find total number of matches ... Read More

Suppose we have a string s consisting of distinct characters and also have an array of strings called words. A string is consistent when all characters in the string appear in the string s. We have to find the number of consistent strings present in the array words.So, if the input is like s= "px", words = ["ad", "xp", "pppx", "xpp", "apxpa"], then the output will be 3 because there are three strings with only 'p' and 'x', ["xp", "pppx", "xpp"].To solve this, we will follow these steps −count := 0for i in range 0 to size of words - ... Read More

Suppose we have a Goal Parser that can interpret a given string command. A command consists ofAn alphabet "G", Opening and closing parenthesis "()"and/or "(al)" in some order.Our Goal Parser will interpret "G" as the string "G", "()" as "o", and "(al)" as the string "al". Finally interpreted strings are then concatenated in the original order. So if we have string command, we have to find the Goal Parser's interpretation of command.So, if the input is like command = "G()()()(al)(al)", then the output will be Goooalal.To solve this, we will follow these steps −s:= blank stringfor i in range 0 ... Read More

Suppose, we have an array containing several integer numbers. We find out all the contiguous subarrays from the given array of numbers and put it into another list. Now, we replace each subarray with the maximum element in that subarray. There is also a number k given to us, and we have to find out how many subarrays are now greater than the given number.So, if the input is like input_array = [5, 6, 7, 8], k = 7, then the output will be 4The contiguous subarrays from the given input array are: {5}, {6}, {7}, {8}, {5, 6}, {6, ... Read More

Suppose, we have a tree with n vertices, where each vertex is labeled from 1 to n. The root of the tree has the label 1, and each vertex weights wi. Now a nxn matrix A is formed where A(x, y) = Wf(x, y) where f(x, y) is the least common predecessor of vertex x and y. We have to find out the determinant of matrix A. The edges of the matrix, weights, and the total number of vertices are given to us as input.So, if the input is like input_array = [[1, 2], [1, 3], [1, 4], [1, 5]], ... Read More

Suppose, in a game show there are 2n number of rooms that are arranged in a circle. In one of the rooms, there is a prize that the participants have to collect. The rooms are numbered from 1, 2, 3, ...., n, -n, -(n - 1), ...., -1. in a clockwise manner. Each room has a door and by that door, a different room can be visited. Every door has a marking x on it, which means another room is located at a distance of x from the current room. If the value of x is positive, then the door ... Read More

A hyperrectangle is a rectangle that has k dimensions. Each dimension has a length that can be denoted as n1, n2, n3,....., nm. The hyperrectangle's cells are addressed as (p,q,r,...) and contain a value that is equivalent to gcd of (p,q,r,...). Here 1