Given an array of integers, write a function to find the subarray with the largest sum. What is the time complexity of your solution?

Given two sorted arrays, write a function to merge them into a single sorted array. What is the time complexity of your solution?

Write a function to find the maximum sum of a subarray within a given array of integers. The subarray should be contiguous, meaning the elements are adjacent to each other in the array. For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of a subarray is 6, which corresponds to the subarray [4, -1, 2, 1]. Write a function named `maxSubarraySum` that takes an array of integers as input and returns the maximum sum of a subarray. Note: If all the elements in the array are negative, the function should return O. Example: Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Input: [-1, -2, -3, -4] Output: 0 Write the 'maxSubarraySum` function that solves this problem efficiently.

Given an array of integers, print a sum triangle from it such that the first level has all array elements. From then, at each level number of elements is one less than the previous level and elements at the level is be the Sum of consecutive two elements in the previous level. Input The single line of input contains an array of integers, each of it is separated by space Output Triangle form that has been created from the input array Sample Input1 12345 Sample Output1 48 20 28 8 12 16 3579 12345