## New Grad

BAN USER- -3of 3 votes

Answersdsjfvbhfgvbfhv

- New Grad in United States| Report Duplicate | Flag | PURGE

Accenture Data Scientist Algorithm - 3of 3 votes

AnswersWe define a subarray of array to be a contiguous block of a's elements having a length that is less than or equal to the length of array a. For example, the subarray of array a = [1,2,3] are [1], [2], [1,2], [2,3], and [1,2,3]. Now, let's say we have an integer, k = 3. The subarrays of a having elements that sum to a number <=k are [1], [2], and [1,2]. The longest of these subarrays is [1,2], which had a length of 2.

- New Grad in United States

Complete the maxLength function in the editor. It has 2 parameters :

1. An array of integers, a.

2. An integer, k

The function must return the length of the longest subarray elements that sum to a number less than or equal to k.

Input Format

Locked stub code in the editor reads the following input from stdin and passes it to the function:

The first line contains a single ineteger n, denoting the number of elements in array a.

Each line i of the n subsequent lines (where 0 <=i < n) contains an integer describing elements i in array a.

Each line i of the n subsequent lines (where 0 <= i <= n) contains an integer describing elements i in array a.

The last line contains an integer, k.

Constraints

1 <= n <= 10^5

1 <= a[i] < 10^3

1 <= k <= 10^9| Report Duplicate | Flag | PURGE

Hackerrank Web Developer Algorithm - 0of 4 votes

AnswersYou are currently in practice mode. This is a demo only.

- New Grad in United States

A zero-indexed array A consisting of N integers is given. An equilibrium index of this array is any integer P such that 0 ≤ P < N and the sum of elements of lower indices is equal to the sum of elements of higher indices, i.e.

A[0] + A[1] + ... + A[P−1] = A[P+1] + ... + A[N−2] + A[N−1].

Sum of zero elements is assumed to be equal to 0. This can happen if P = 0 or if P = N−1.

For example, consider the following array A consisting of N = 8 elements:

A[0] = -1

A[1] = 3

A[2] = -4

A[3] = 5

A[4] = 1

A[5] = -6

A[6] = 2

A[7] = 1

P = 1 is an equilibrium index of this array, because:

A[0] = −1 = A[2] + A[3] + A[4] + A[5] + A[6] + A[7]

P = 3 is an equilibrium index of this array, because:

A[0] + A[1] + A[2] = −2 = A[4] + A[5] + A[6] + A[7]

P = 7 is also an equilibrium index, because:

A[0] + A[1] + A[2] + A[3] + A[4] + A[5] + A[6] = 0

and there are no elements with indices greater than 7.

P = 8 is not an equilibrium index, because it does not fulfill the condition 0 ≤ P < N.

Write a function:

int solution(int A[], int N);

that, given a zero-indexed array A consisting of N integers, returns any of its equilibrium indices. The function should return −1 if no equilibrium index exists.

For example, given array A shown above, the function may return 1, 3 or 7, as explained above.

Assume that:

N is an integer within the range [0..100,000];

each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

Complexity:

expected worst-case time complexity is O(N);

expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).

Elements of input arrays can be modified.| Report Duplicate | Flag | PURGE

Google Software Engineer Algorithm

**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window