Input: nums = [-2,1,-3,4,-1,2,1,-5,4]write a code that satisfies the above constraints and explain it briefly about its time complexity.Output: 6Explanation: The subarray [4,-1,2,1] has the largest sum 6.
public class Main{public static void main(String[] args) {int a;System.out.println(a);}}
class variable_scope{public static void main(String args[]){int x; x = 15;{int y = 9;System.out.print(x + " " + y);}System.out.println(x + " " + y);}}