Array Challenge Have the function ArrayChallenge (arr) take the array of integers stored in arr, and determine if any three distinct numbers (excluding the first element) in the array can sum up to the first element in the array. For example: if arr is [8, 2, 1, 4, 10, 5, -1, -1] then there are actually three sets of triplets that sum to the number 8: [2, 1, 5], [4, 5, -1] and [10, -1, -1]. Your program should return the string true if 3 distinct elements sum to the first element, otherwise your program should return the string false. The input array will always contain at least 4 elements. Examples Input: [10, 2, 3, 1, 5, 3, 1, 4, -4, -3, -2] Output: true Input: [12, 3, 1, -5, -4, 7] Output: false

Array Challenge Have the function ArrayChallenge (arr) take the array of integers stored in arr, and determine if any three distinct numbers (excluding the first element) in the array can sum up to the first element in the array. For example: if arr is [8, 2, 1, 4, 10, 5, -1, -1] then there are actually three sets of triplets that sum to the number 8: [2, 1, 5], [4, 5, -1] and [10, -1, -1]. Your program should return the string true if 3 distinct elements sum to the first element, otherwise your program should return the string false. The input array will always contain at least 4 elements. Examples Input: [10, 2, 3, 1, 5, 3, 1, 4, -4, -3, -2] Output: true Input: [12, 3, 1, -5, -4, 7] Output: false

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Q2. By applying the concept of array in C language, solve the equation as shown in Figure Q2 below where the values of n is the last digit of student matrix number (e.g. CD12345), and u is the second digit of student matrix number (e.g. CD12345). User need to insert the value in array x[i] series, for example, EE x; = x [0] + x[1] + x[2], where xiis a series of value in data set. n+2 n+3 10+ i V2i f (x) = >. 2x[i]? i=1 i=0 Figure Q2: (x) equation.
Q2. By applying the concept of array in C language, solve the equation as shown in Figure Q2 below where the values of n is the last digit of student matrix number (e.g. CD12345), and u is the second digit of student matrix number (e.g. CD12345). User need to insert the value in array x[i] series, for example, EE x; = x [0] + x[1]+ x[2],where xri is a series of value in data set. n+2 n+3 10+i V2i f (x) = 2x[i]? i=1 i=0 Figure Q2: (x) equation.
Answer in java script Create a function that returns true if the first array can be nested inside the second. arr1 can be nested inside arr2 if: 1. arr1's min is greater than arr2 's min. 2. arr1's max is less than arr2 's max. Examples canNest([1, 2, 3, 4], [0, 6]) true canNest ([3, 1], [4, 0]) → true canNest ([9, 9, 8], [8, 9]) → false canNest([1, 2, 3, 4], [2, 3]) - false
Code for this in C: You have created three arrays:array A of size 100array B of size 50array C of size 200You are to store the first 100 numbers (1,2,3,...,100) into array A, the first 50 positive odd numbers (1,3,5,...,) into array B, and the reciprocal of each position [C(5) = 1/5] into array C. Then, output the contents of each array.
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 3 int lastof(const int a[), int alen, const int b[], int blen) 4 { int res = 0; for (int i = 0; i =0 ; j--) if (b[j] == a[i]) { if(res[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b1->[7, 5, 9] last0f(al, 14, b1, 3): -1 Expected: 12 al->[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b2->[7, 7] lastof (al, 14, b2, 2): -1 Expected: 12 a2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b2->[7, 7] lastof (a2, 11, b2, 2): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b1->[7, 5, 9] last0f (a2, 11, b1, 3): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 10, 11, 13, 14] b3->[11, 2, 1, 15] lastof (a2, 11, b3, 4): -1 Expected: 8 Score 2/5
JavaScript Q3. Create a function find(arr,value) which finds a value in the given array and returns its index, or-1 if not found. The given array is: arra[10,3,20,4)
An array my_Array[] consisting ‘a’ s, ‘b’ s and ‘c’s. The task is to write a function that arranges the arraysuch that all ‘a’s are placed first, then all ‘b’s and then all ‘c’s in last.
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
İN C PROGRAMMİNG Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10. Assume that each element represents a different city and the integers stored in the array represent the number of golds in those cities. The program traverses over the array and collects the golds at each city, starting from a random position. When the program visits a certain city, all of the golds are collected, and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues with the rule given below. If the position at the nth step is denoted by pn, and the number of golds at the city pn is denoted by gn, ??+1 ={|(?? +??) ???1000|, ?????2=0. |(?? − ??) ??? 1000|, ????? 2 = 1 The program continues visiting cities until the last three visited city has no gold. The program, at each visit, should print out the following information: • The current city index (pn). • The previous city index (pn-1). • The number of golds at the…
JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true
İN C PROGRAMMİNG.Write a function that takes 20x20 array of real numbers as a parameter. The function should returnthe number of elements that are greater than the average of their neighbors (NOT-Including the diagonal neighbors)Example: In a 3x3 array : { {1, 3, 5},{7, 2, 4},{0, -2, 9} } element 5 is greater than the average of its neighbors (3,4) element 2 is not greater than the average of its neighbors (7,-2,3,4} element 4 is not greater than the average of its neighbors (5,2,9) Hint: You may consider Divide&Conquer and implement some other function to be called in the solution
Assignment Write a program that reads a 2D array of chars, checks, and corrects each char within this array, and print out the corrected 2D array. First the program will read the row count (rowCount) and column count (columnCount) of the 2D array, both as int values. Then, the chars constituting the 2D array will be read on a row-by-row basis. After reading the 2D array, the program will check and correct each char within the 2D array according to the rules below. This process MUST be done by using a void function by sending the appropriate cell of the 2D array with a call-by-reference fashion. • If the row index is an even number, a char can only be a lowercase English value. • If the row index is an odd number, a char can only be ?, 7', or X'. • Any incorrect value MUST be changed into Finally, the checked and corrected 2D array will be printed out to the screen. NOTE: Checking the correctness of a char and correcting it (if necessary) MUST be done in the function with a…