Programming

Sum of Array Elements

This technical problem deals with finding the sum of all elements in an array. An example input is given as [1, 2, 3, 4] and the expected output is 10.

155
Nov 27
Write a function to flatten an object with nested objects.

Given an object with nested objects, this function flattens the object by creating key paths for nested values.

103
Nov 27

The problem is to find the maximum sum that can be achieved by selecting a subarray of non-adjacent elements from an input array. For example, given the input array [3, 7, 4, 6, 5], the maximum sum that can be achieved is 13, by selecting the subarray [3, 7, 5].

110
Nov 27
Sum of odd integers in an array

The function should take an array of integers as input and return the sum of the odd integers in the array.

149
Nov 27
Find the largest difference between any two elements in an array of integers.

Given an array of integers, this function returns the largest difference between any two elements in the array.

159
Nov 27
Sum of Odd Numbers in an Array

This problem asks the programmer to write a function that takes in an array of integers and returns the sum of the odd numbers in the array. For example, given the input array [1, 2, 3, 4, 5], the function should return 9 (1 + 3 + 5).

195
Nov 26
Sum of array elements

The function should take in an array of integers and return the sum of the elements in the array.

159
Nov 26
Sum of array elements

This technical problem involves writing a function that takes an array of integers as input and returns the sum of the integers in the array. An example input and output are provided in the problem statement.

159
Nov 26