Programming Articles - Page 1180 of 3363

Suppose we have an array of arr and another value target. We have to find two non-overlapping sub-arrays of arr where each has sum equal to target. If there are multiple answers, then we have to find an answer where the sum of the lengths of the two sub-arrays is smallest. We have to find the minimum sum of the lengths of the two required sub-arrays, if there is no such subarray then return -1.So, if the input is like arr = [5, 2, 6, 3, 2, 5] target = 5, then the output will be 2 there are three ... Read More

Suppose we have a table with two columns (birth, death) where each row is representing the birth and death years of the ith person. The population of some year y is the number of people alive during y. The ith person is counted in year y's population when y is in the inclusive range [birth_i, death_i - 1]. (The person is not counted in the year that they die). So, we have to find the earliest year with the maximum population.So, if the input is likeBirthDeath197020101960202019401970then the output will be 2 because there is only one value that matches with ... Read More

Suppose we have an array nums and two different values target (target must present in nums) and start, we have to find an index i such that nums[i] = target and |i - start| is minimum. We have to return the |i - start|.So, if the input is like nums = [3, 4, 5, 6, 7] target = 7 start = 2, then the output will be 2 because there is only one value that matches with target, that is nums[4], so i = 4. Now |4-2| = 2.To solve this, we will follow these steps:minimum := infinityfor i in ... Read More

Suppose we have an alphanumeric string s that contains lowercase English letters in its even positions and digits in its odd positions. Consider an operation shift(c, x), where c is any character and x is a number (digit), this will find the xth character after c. So, for example, shift('p', 5) = 'u' and shift('a', 0) = 'a'. Now for every odd index i, we want to replace the digit s[i] with shift(s[i-1], s[i]). We have to find s after replacing all digits.So, if the input is like s = "a2b1d4f3h2", then the output will be "acbcdhfihj" becauseshift('a', 2) = ... Read More

Suppose we have a number n in decimal number system (base 10) have another value k, we have to find the sum of the digits of n after converting given number n from base 10 to base k. When we calculate digit sum, we will consider each digit as decimal (base 10) number.So, if the input is like n = 985 k = 8, then the output will be 12 because the number 985 in octal is 1731, so the digit sum is 1+7+3+1 = 12.To solve this, we will follow these steps −ans := 0while n >= k, doans ... Read More

Suppose we have an array nums. In one operation, we can select one element of the array and increase it by 1. For example, if we have [4, 5, 6], we can select element at index 1 to make the array [4, 5, 5]. Then we have to find the minimum number of operations required to make nums strictly increasing.So, if the input is like nums = [8, 5, 7], then the output will be 7, because we need to increase like [8, 6, 7], [8, 7, 7], [8, 8, 7], [8, 9, 7], [8, 9, 8], [8, 9, 9], ... Read More

Suppose we have an array called nums. We have to find sign of the multiplication result of all elements present in the array.So, if the input is like nums = [-2, 3, 6, -9, 2, -4], then the output will be Negative, as the multiplication result is -2592To solve this, we will follow these steps −zeroes := 0, negatives := 0for each i in nums, doif i is same as 0, thenzeroes := zeroes + 1if i < 0, thennegatives := negatives + 1if zeroes > 0 , thenreturn "Zero"otherwise when negatives mod 2 is same as 0, thenreturn "Positive"otherwise, ... Read More

Suppose we have sentence s where some English words are present, that are separated by a single space with no leading or trailing spaces. We also have another value k. We have to find only the first k words after truncating.So, if the input is like s = "Coding challenges are really helpful for students" k = 5, then the output will be True (See the image)To solve this, we will follow these steps −words := split s by spacesjoin first k letters from words array by separating spaces and returnLet us see the following implementation to get better understanding ... Read More

Suppose we have a chessboard coordinate, that is a string that represents the coordinates of row and column of the chessboard. Below is a chessboard for your reference.We have to check whether given cell is white or not, if white return true, otherwise return false.So, if the input is like coordinate = "f5", then the output will be True (See the image)To solve this, we will follow these steps −if ASCII of coordinate[0] mod 2 is same coordinate[1]) mod 2, thenreturn Falseotherwise, return TrueLet us see the following implementation to get better understanding −Example Live Demodef solve(coordinate):    if (ord(coordinate[0]))%2 == ... Read More

Suppose we have a lowercase alphanumeric string s. We shave to replace every non-digit character with a space, but now we are left with some integers that are separated by at least one space. We have to find the number of different integers after performing the replacement operations on s. Here two numbers are considered as different if their decimal representations without any leading zeros are different.So, if the input is like s = "ab12fg012th5er67", then the output will be 3 because, there are few numbers ["12", "012", "5", "67"] now "12" and "012" are different in string but same ... Read More