1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is achieved by the subarray [42, 14, -5, 86]. Input: array = [-5, -1, -8, -9] Output: -1 Explanation: The maximum sum is -1, achieved by the subarray [-1]. Constraints: 1 ≤ N ≤ 106, where N is the number of elements in the array. -104 ≤ array[i] ≤ 104 Note: The solution should have a time complexity of O(N). Input: The first line contains a single integer, N, the size of the array. The second line contains N space-separated integers representing the elements of the array. Output: A single integer, the maximum subarray sum.
2. Mean, Median, and Mode Problem Statement Given an integer array ARR of size N, you need to compute the following three statistical measures: Mean: Implement the function mean() to calculate the mean of the array. Median: Implement the function median() to calculate the median of the array. Mode: Implement the function mode() to determine the mode of the array. Return these measures in the specified format. Example: Input: ARR = {1, 1, 2, 2, 3, 3, 4} Output: Mean: P QMedian: P QMode: 1 Explanation: For the given array, the mode will be 1, as it is the smallest of all the possible modes (1, 2, and 3). Constraints: 1 <= T <= 5 1 <= N <= 105 1 <= ARR[i] <= 106 Where ARR[i] denotes the ith element of the array. Time limit: 1 sec Note: Mean and Median should be returned in the form P/Q, where P and Q are coprime integers, and Q ≠ 0. If multiple elements have the same highest frequency, return the smallest one as the mode.
3. How do you increase the productivity of your callers?
4. What is the product journey of Uber for visually impaired customers?
5. What are the different types of initializers and their behaviors?