This is a written round on paper for everyone. Three coding-related jobs were assigned. To move on to the next round, two of the three must be correct and manage every single edge case. Only the best choice was to be considered. You've given an N-dimensional array (ARR) made entirely of numbers. You must find the subarray total that has the greatest sum among all subarrays. (including empty subarrays). A subarray is the continuous portion of an array. In other words, an array can be subdivided by removing 0 or more numbers from the start and 0 or more integers from the end. Connect n ropes for the least amount of money: You have been handed 'N' ropes of varying lengths; we need to connect these ropes into one rope. The expense of connecting two ropes is the sum of their lengths. We need to join the ropes as cheaply as possible. The test data is structured in such a way that the output will fit into a 32-bit integer. Given a binary tree, view it from the left. Print the tree's left side.