Programming Articles - Page 1020 of 3363

Suppose, there is an array 'nums' of size n containing positive integers. We have another array 'queries' that contain integer pairs (pi, qi). For every query in the array queries, the answer will be the sum of numbers in the array nums[j] where pi

Suppose, there are n number of candies and k bags in which the candies have to put into. We have to find out the number of possible ways the candies can be distributed so that each bag contains at least one candy. Every candy in this scenario is unique, so we have to count all the possible ways the candies can be distributed in the bags.So, if the input is like n = 3, k = 2, then the output will be 3.The candies can be put in this manner −(1, 2), (3) (1) , (2, 3) (2), (1, 3)To ... Read More

Suppose we have an array nums, we have to find the maximum min-product of each non-empty subarray of nums. Since the answer can be big enough, return it in modulo 10^9+7. The min-product of the array is equal to the minimum value in the array multiplied by the sum of the array. So if we have an array is like [4, 3, 6] (minimum value is 3) has a min-product of 3*(4+3+6) = 3*13 = 39.So, if the input is like nums = [2, 3, 4, 3], then the output will be 30 because we can get subarray [3, 4, ... Read More

Suppose we have two arrays (non-growing) nums1 and nums2. The index pair (i, j) with 0

Suppose we have a string s with only numbers. We have to check whether we can split s into two or more non-empty substrings such that the numerical values of those substrings are in non-increasing sequence and the difference between numerical values of every two adjacent substrings is 1. So for example, if the string is s = "0080079" we can split it into ["0080", "079"] with numerical values [80, 79]. And the values are in descending order and adjacent values differ by 1, so this way is valid. We have to check whether it is possible to split s ... Read More

Suppose we have an array called arr. We have to perform some operations on arr so that it satisfies these conditions −The first element in arr must be 1.The absolute difference between any 2 adjacent elements must be at most 1.And there are two operations. We can perform these two types of operations any number of times −Decrease any value of arr to a smaller positive number.Rearrange the elements of arr to be in any order.We have to find the maximum possible value in arr after performing the operations to satisfy the given conditions.So, if the input is like arr ... Read More

Suppose we have to design a system that manages the reservation state of n seats. The seats are numbered from 1 to n. So we have to implement the SeatReserveManager class, with these functions −Constructor that takes n as input and initializes the object that will manage n seats numbered from 1 to n. Initially all seats are available.reserve(), this will fetch the smallest-numbered unreserved seat, then reserves it, and returns its number.unreserve(seatNumber), this will unreserve one reserved seat with the given seatNumber.So, if the input is likeobj = SeatReserveManager(7)obj.reserve()obj.reserve()obj.reserve()obj.unreserve(2)obj.unreserve(5)obj.reserve()obj.reserve()then the output will be 1, 2, 3, 2, 5, initially ... Read More

Suppose we have two strings s and t. These two strings are K-similar if we can swap the positions of two letters in s exactly K times so that the resulting string is t. So, we have two anagrams s and t, we have to find the smallest K for which s and t are K-similar.So, if the input is like s = "abc" t = "bac", then the output will be 1.To solve this, we will follow these steps −Define a function neighbors() . This will take new_datafor each index i and value c in new_data, doif c is ... Read More

Suppose we have an array nums and another value goal. We want to select a subsequence of nums such that the sum of its elements is the nearest to goal. So in other words, if the sum of the subsequence's elements is s, then we want to minimize the absolute difference |s - goal|.So we have to find the minimum possible value of |s - goal|. So, if the input is like nums = [8, -8, 16, -1] goal = -3, then the output will be 2 because select the subsequence [8, -8, -1], with a sum of -1. The ... Read More

Suppose we have a string s with only English vowels, we have to find the length of the longest beautiful substring of s. If we cannot find such substring then, return 0. A string is said to be beautiful if it satisfies the following conditions −Each of the 5 vowels must appear at least once in it.Letters must be sorted in alphabetical sequenceSo, if the input is like s = "aaioaaaaeiiouuooaauu", then the output will be 10 because the substring is "aaaaeiiouu" which is beautiful.To solve this, we will follow these steps −vowels := a list of all vowels ['a', ... Read More