Get Minimum Element From Stack in O(1) | Min Stack

SOLVED: Let S be a stack of size n 1. Starting with the stack bearing the first n natural numbers (highest number on top of the stack), three elements are popped if the top of the stack is even, and one element (the number next to the one on top of the stack) is pushed if the top of the stack is odd. These operations continue until the stack is empty or there are insufficient numbers of elements so that three pops cannot be done.i. How many elements will be finally left in the stack when three

Java Array Length vs. Size