88. Implement Stack Using Array with Push and Pop Operations

#include <stdio.h>
#include <stdint.h>
#include <string.h>

#define STACK_SIZE 10

int stack[STACK_SIZE];
int top = -1;

/* Push operation */
void push(int x) {
    if (top == STACK_SIZE - 1) {
        printf("Stack Overflow\n");
        return;
    }
    stack[++top] = x;
}

/* Pop operation */
void pop(void) {
    if (top == -1) {
        printf("Stack Underflow\n");
        return;
    }
    printf("%d\n", stack[top--]);
}

void process_stack(int n) {
    // Your logic here
    for (int i = 0; i < n; i++)
    {
        char operation[4];
        scanf("%s",operation);
        if(strcmp(operation,"push") == 0)
        {
            int x;
            scanf("%d",&x);
            push(x);
        }
        else
        {
            pop();
        }
    }
}

int main() {
    int n;
    scanf("%d", &n);
    getchar(); // Consume newline after number

    process_stack(n);
    return 0;
}