title: How do i solve stacks and queues data structure?
body: <pre><code>import sys
  
  def __init__(self):
      self.__stack = []
      self.__queue = []
  
  def pushCharacter(self, ch):
      self.__stack.append(ch)
  
  def enqueueCharacter(self, ch):
      self.__queue.insert(0, ch)
  
  
  def popCharacter(self):
      return self.__stack.pop()
  
  def dequeueCharacter(self):
      return self.__queue.pop()
  
  s=input()
  
  
  obj=Solution()   
  
  l=len(s)
  
  
  for i in range(l):
  
  obj.pushCharacter(s[i])
  obj.enqueueCharacter(s[i])
  
  isPalindrome=True
  
  for i in range(l // 2):
  
  if obj.popCharacter()!=obj.dequeueCharacter():
  
      isPalindrome=False
  
      break
     if isPalindrome:
  
  print("The word, "+s+", is a palindrome.")
  
  else:
  
  print("The word, "+s+", is not a palindrome.") 
  </code></pre>
  
  <p>This is an hackerrank problem </p>
  
  <p>Sample Input  : racecar</p>
  
  <p>output : The word, racecar, is a palindrome.</p>
  
  <p>But i'm getting compilation error as </p>
  
  <p><strong>Sorry: TabError: inconsistent use of tabs and spaces in indentation (solution.py, line</strong> 4)</p>
  
  <p>How do get rid of the error?</p>