Help me in solving STACK11 problem

help
,
1

My issue

I am not getting the problem

My code

    static final int MAX_SIZE = 101;
    static int[] a = new int[MAX_SIZE];
    static int top = -1;

    static void push(int ele) {
        if (top <= MAX_SIZE - 1) {
            top++;
            a[top] = _0_;
            System.out.println("Pushed: " + _101____);
        } else {
            System.out.println("Stack is full. Cannot push: " + _101____);
        }
    }
    
    static int pop() {
        if (top >= 0) {
            int ele = a[_0_];
            top--;
            System.out.println("Popped: " + ele);
            return ele;
        } else {
            System.out.println("Stack is empty. Cannot pop.");
            return -1;
        }
    }

Learning course: Stacks and Queues
Problem Link: Push and Pop Practice Problem in Stacks and Queues - CodeChef

2

@dikshitadutta
plzz refer the following solution

#define MAX_SIZE 101
int a[MAX_SIZE];
int top = -1;

 void push(int ele){
    if(top <= MAX_SIZE - 1){
        a[++top] =  ele;
        cout<<"Pushed: "<<ele<<"\n";
    }
    else{
        cout<<"Stack is full. Cannot push: "<<ele<<"\n";
    }
}
int pop(){
    if(top >= 0){
        int ele = a[top];
        top--;
        cout<<"Popped: "<<ele<<"\n";
        return ele;
    }
    else{
        cout<<"Stack is empty. Cannot pop.\n";
        return '-1';
    }
}