If yes, insert the element and move the top pointer forward.

If no, stack overflow for Stack 2.

To pop an element from Stack 1:

Check if Stack 1 is empty.
If not empty, return the top element and move the top pointer backward.

To pop an element from Stack 2:

Check if Stack 2 is empty.
If not empty, return the top element and move the top pointer backward.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
    int *arr;          // Pointer to the array storing both stacks
    int size;          // Total size of the array
    int top1;          // Top pointer for stack 1 (first half)
    int top2;          // Top pointer for stack 2 (second half start)

public:
    // Constructor initia