Exercise_1.py

class myStack:
  #Please read sample.java file before starting.
  #Kindly include Time and Space complexity at top of each file
  def __init__(self):
    self.stack = []
      
  def isEmpty(self):
    if len(self.stack) > 0:
      return False
    return True
      
  def push(self, item):
    self.stack.append(item)
      
  def pop(self):
    if len(self.stack)  == 0:
      return 'Sorry we dont have any value in stack'
    popped_val = self.stack[-1]
    self.stack = self.stack[:-1]
    return popped_val
    
  def peek(self):
    if len(self.stack)  == 0:
      return 'Sorry we dont have any value in stack'
    return self.stack[-1]

  def size(self):
    return len(self.stack)
      
  def show(self):
    return self.stack
         

s = myStack()
s.push('1')
s.push('2')
print(s.pop())
print(s.show())