I almost did it (without looking at any hint) but still getting WA on 1 test and TLE on 2 for my JAVA implementation. Can anyone please read my code and tell me where am I wrong.

Check-if-it-is-possible-to-survive-on-Island/berries.java at master · dakshAg/Check-if-it-is-possible-to-survive-on-Island · GitHub

Results included as comments at the bottom of the file.

Any help is appreciated.

Please do not consider the repository in which it is kept. Only code matters.

Sir this is my code. I am getting the verdict TLE. Please help me.

#include<iostream>
using namespace std;
 
long int arr[200000],res = 0;
long int process(int x);
 
int main(){
    long int n,res,i;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>arr[i];
    }
    res = process(n-1);
    cout<<res;
    return 0;
}
 long int process(int i){
    if(i < 2){
        return 0;
    }
    res = min(arr[i] + process(i-1),min(arr[i-1] + process(i-2),arr[i-2] + process(i-3)));
    return res;

Hi, what's the worst case run time of my code?

#include <fstream>
#include <algorithm>
#include <math.h>
 
using namespace std;
 
int upToPow2(long long);
 
int main() {
    ifstream in;
    in.open("cowcode.in");
 
    ofstream out;
    out.open("cowcode.out");
 
    string str;
    long long n;
 
    in >> str;
    in >> n;
 
    long long globalLength = str.length();