uppose the elements of an array A containing positive integers, denote the weights in kilograms. And we have a beam balance. We want to put the weights on both pans of the balance in such a way that for some index 0 < i < A.length - 1, all values starting from A[0], A[1], upto A[ i - 1], should be on the left pan. And all values starting from A[ i ] upto A[ A.length - 1] should be on the right pan and the left and right pan should be balanced. If such an i exists, return true. Else, return false. Input: [1, 1, 1, 2, 1] Output : true Explanation: (summation of [1, 1, 1] = summation of [2,1]) Input: [2, 1, 1, 2, 1] Output: false Input: [10, 3, 1, 2, 10] Output: true Explanation: (summation of [10, 3] = summation of [1,2,10]))

uppose the elements of an array A containing positive integers, denote the weights in kilograms. And we have a beam balance. We want to put the weights on both pans of the balance in such a way that for some index 0 < i < A.length - 1, all values starting from A[0], A[1], upto A[ i - 1], should be on the left pan. And all values starting from A[ i ] upto A[ A.length - 1] should be on the right pan and the left and right pan should be balanced. If such an i exists, return true. Else, return false. Input: [1, 1, 1, 2, 1] Output : true Explanation: (summation of [1, 1, 1] = summation of [2,1]) Input: [2, 1, 1, 2, 1] Output: false Input: [10, 3, 1, 2, 10] Output: true Explanation: (summation of [10, 3] = summation of [1,2,10]))

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Given an unsorted array A of size N that contains only positive integers, find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Note:- You have to return an ArrayList consisting of two elements left and right. In case no such subarray exists return an array consisting of element -1.code.
Let A be an array of numbers. In the maximum sub-array problem, your goal is to determine the sub-array A[x . . . y] of consecutive terms for which the sum of the entries is as large as possible. For example, if A = [−2, −3, 4, −1, −2, 1, 5, −3], the maximum sub-array is [4, −1, 2, 1, 5], and the largest possible sum is S = 4 − 1 − 2 + 1 + 5 = 7. Suppose A = [1, 2, −4, 8, 16, −32, 64, 128, −256, 512, 1024, −2048]. Determine S, the largest possible sum of a sub-array of A.
Given an integer n and an array a of length n, your task is to apply the following mutation to a: Array a mutates into a new array b of length n. For each i from 0 to n - 1, b[i] = a[i - 1] + a[i] + a[i + 1]. If some element in the sum a[i - 1] + a[i] + a[i + 1] does not exist, it should be set to 0. For example, b[0] should be equal to 0 + a[0] + a[1].
A post on facebook is said to be more popular if the number of likes on the post is strictly greater than the number of likes on some other post. In case the number of likes is same, the post having more comments is more popular. Given arrays A and B, each having size N, such that the number of likes and comments on the ith post are Ai and Bi respectively, find out which post is most popular. It is guaranteed that the number of comments on all the posts is distinct. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains a single integer N, the number of posts. The second line of each test case contains N space-separated integers A1,A2,…,AN — where Ai is the number of likes on the ith post. The third line of each test case contains N space-separated integers B1,B2,…,BN — where Bi is the number of comments on the ith post. Output…
CodeGiven an unsorted array A of size N that contains only positive integers, find a continuous sub-array that adds to a given number S and return the left and right index(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. Note:- You have to return an ArrayList consisting of two elements left and right. In case no such subarray exists return an array consisting of element -1.
Given a large list of positive integers, count the number of k-subsequences. A k-subarray of an array is defined as follows: It is a subarray, i.e. made of contiguous elements in the array The sum of the subarray elements, s, is evenly divisible by _k, _i.e.: sum mod k = 0. Given an array of integers, determine the number of k-subarrays it contains. For example, k = 5 and the array nums = [5, 10, 11, 9, 5]. The 10 k-subarrays are: {5}, {5, 10}, {5, 10, 11, 9}, {5, 10, 11, 9, 5}, {10}, {10, 11, 9}, {10, 11, 9, 5}, {11, 9}, {11, 9, 5}, {5}. **Function Description ** Complete the function kSub in the editor below. The function must return a long integer that represents the number of k-subarrays in the array. kSub has the following parameter(s): k: the integer divisor of a k-subarray nums[nums[0],...nums[n-1]]: an array of integers Constraints 1 ≤ n ≤ 3 × 105 1 ≤ k ≤ 100 1 ≤ nums[i] ≤ 104 Input Format For Custom Testing Input from stdin will be processed as follows and…
Given an array, find the total number of inversions of it. If (i < j) and (A[i] > A[j]), then pair (i, j) is called an inversion of an array A. We need to count all such pairs in the array. For example, Input: A[] = [1, 9, 6, 4, 5] Output: The inversion count is 5 There are 5 inversions in the array: (9, 6), (9, 4), (9, 5), (6, 4), (6, 5)
Given an array of integers, write a function to find the maximum sum of any contiguous subarray (i.e., a subarray with consecutive elements) in the array. For example, in the array [1, -2, 3, 4, -1, 2, 1, -5, 4], the maximum sum of a contiguous subarray is 6 (from index 2 to index 5).
An array A[1 . . n] of integers is a mountain if it consists of an increasing sequence followed by a decreasing sequence, or more precisely,If there is an index m ∈ {1, 2, . . . , n} such that• A[i] < A[i + 1] for all 1 ≤ i < m, and• A[i] > A[i + 1] for all m ≤ i < n.In particular, A[m] is the maximum element, and it is the unique “locally maximum” element surrounded by smaller elements (A[m − 1] and A[m + 1]).Give an algorithm to compute the maximum element of a mountain input array A[1 . . n] in O(log(n)) time.
Multiplying Factors For a pair of integers (x,y) and an integer k, the multiplying factor is defined as minimum positive integer m such that LCM(x,y) * m is divisible by k. Here LCM(x,y) represents the smallest positive integer divisible by both x and y, their least common multiple. Given an array arr of n integers and an integer k, find the sum of multiplying factors over all pairs of integers (arr[i], arr[j]) and k0 <= i,j < n. Example Suppose n=3, arr =[4,5,6] and k=12. Pair Multiplying Factor Remarks (4, 3 LCM(4,4)**3=4**3 =12 4 ) LCM(5,5)**12=5** 12=60 (5, 12 LCM(6,6)**2=6**2 5) (6, 2 12 6 )
Let A be an array of size n >= 6 containing integers from 1 to n - 5, inclusive, with excactly five repeated. Describe a good algorithm for finding the five integers in A that are repeated.
: In an array of integers, a "peak" is an element which is greater than or equalto the adjacent integers and a "valley" is an element which is less than or equal to the adjacentintegers. For example, in the array {5, 8, 6, 2, 3, 4, 6}, {8, 6} are peaks and {5, 2} are valleys. Given anarray of integers, sort the array into an alternating sequence of peaks and valleys.EXAMPLEInput: {5, 3, 1, 2, 3}Output: {5, 1, 3, 2, 3}