int n=sc.nextInt(),i;
            int a[]=new int[n];
            for(i=0;i<n;i++) a[i]=sc.nextInt();
            int dp[]=new int[n];
        dp[0]=a[0];
        if(n>1)
            dp[1]=Math.max(a[0],a[1]);
        if(n>2)
            dp[2]=Math.max(a[0]+a[2],a[1]);
            for( i=3;i<n;i++)
                dp[i]=Math.max(a[i]+dp[i-2],dp[i-1]);
        System.out.println(dp[n-1]);

Special Sum ✅
Intuit

Tomorrow anyone give OA Morgan Stanley

Guys, kindly Add this folders -> https://t.me/addlist/wcoDjKedDTBhNzFl

DELLOITE 11 am ANSWERS 👇

We will be posting free DELLOITE answers today , Share my channel to your Frnds those who are writing exam today

Taiwan International Internship Program (1st May - 31st August)

https://tigp.sinica.edu.tw/pages/3127

If ✅

C✅

To ✅

A✅

B✅

C✅

For ✅

D✅

D✅

C✅

Section 2 Reasoning 👇

B✅

A✅