76777879808182838485

// Class Solution containing our Stack implementation
class Solution {
    // Inner class Stack
    static class Stack {
        // Maximum size of stack
        static final int MAX = 1000;

        // Array to store elements
        int arr[] = new int[MAX];

        // Index of top element
        int top;

        // Constructor initializes stack as empty
        Stack() {
            top = -1;
        }

        // Function to push element into stack
        boolean push(int value) {
            // Check if stack is full
            if (top >= (MAX - 1)) {
                System.out.println("Stack Overflow");
                return false;
            } else {
                // Add element and move top pointer
                arr[++top] = value;
                System.out.println(value + " pushed into stack");
                return true;
            }
        }

        // Function to remove and return top element
        int pop() {
            // Check if stack is empty
            if (top < 0) {
                System.out.println("Stack Underflow");
                return 0;
            } else {
                // Return element and decrease top
                return arr[top--];
            }
        }

        // Function to return top element without removing
        int peek() {
            // Check if stack is empty
            if (top < 0) {
                System.out.println("Stack is Empty");
                return 0;
            } else {
                return arr[top];
            }
        }

        // Function to check if stack is empty
        boolean isEmpty() {
            return (top < 0);
        }
    }
}

// Driver code
public class Main {
    public static void main(String[] args) {
        // Create stack object
        Solution.Stack s = new Solution.Stack();

        // Push elements
        s.push(10);
        s.push(20);
        s.push(30);

        // Pop element
        System.out.println(s.pop() + " Popped from stack");

        // Print remaining elements
        System.out.print("Elements present in stack: ");
        while (!s.isEmpty()) {
            System.out.print(s.peek() + " ");
            s.pop();
        }
    }
}

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970

# Class Solution containing our Stack implementation
class Solution:
    class Stack:
        # Maximum size of stack
        MAX = 1000

        # Constructor initializes stack
        def __init__(self):
            # List to store elements
            self.arr = [0] * self.MAX
            # Index of top element
            self.top = -1

        # Function to push element into stack
        def push(self, value):
            # Che

Scheduled Maintenance in Progress