404 Not Found
Maybe your looking for one of these pages?
Arrange array element in right and left order starting from least element
How to find the suarray with maximum sum using divide and conquer
Array Challenge Have the function ArrayChallenge(arr) take the array of integers stored in arr, and determine if any two numbers (excluding the first element) in the array can sum up to the first element in the array. For example: if arr is [7, 3, 5, 2, -
19 Given an array of positive integers arr, return the sum of all possible odd-length subarrays of arr
kadane algorithm with negative numbers included as sum
number of increments and decrements to make array sorted
largest subarray with sum 0
c++ take n number from the user and store them in array and get the max, min number of them and also find the average/summation of these numbers
Ezzat has an array of n integers (maybe negative). He wants to split it into two non-empty subsequences a and b, such that every element from the array belongs to exactly one subsequence, and the value of f(a)+f(b) is the maximum possible value, where f(x
a=[] n=int(input("Enter number of elements:")) for i in range(1,n+1): b=int(input("Enter element:")) a.append(b) a.sort() print("Largest element is:",a[n-1])
Top K Frequent code in java Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in sorted order. Note: Your algorithm's time complexity must be better than O(n log n), where n is the array's size
/*1. Write a function that accepts an array of numbers, and then divide them into 10-
percentiles i.e., Taking 0 as 0% and the largest number in the array as 100% return an array
of 10 elements that indicate the number of elements that are at 0-10%, 10-20
Sort a random array of n integers (accept the value of n from user) in
ascending order by using insertion sort algorithm.