Guys i was solving this problem of largest contiguous sub array sum. And my friend asked this question, you have to select an integer X from the array A then square it and then return the sum of the subarray that has maximum sum over all subarrays of the resultant array. Sum of subarrays is the sum of all integers in subarray. How to tackle this problem
— ANYONE HERE WHO IS EXPERT IN C OR ANY LANGUAGE
— I need help
— It seems like your name notes that you are the “Pro” so what can be your problem?
— Im pro but i need expert actually 😋
— Yeah sure
— There a test by tcs And i need someone who can do one code
— Wow such pro. would be nice if you read the rules. it says no assignments lol