225. Implement Stack using Queues fix

Notice that your pop() is doing:
self.q_.pop()  # just pops but doesn't return anything

But the problem expects you to:
return the popped element (the element that was on the top of the stack)

Author: hiteshskp

Python/implement-stack-using-queues.py

@@ -68,7 +68,7 @@ def pop(self):
         for _ in xrange(self.q_.size() - 1):
             self.top_ = self.q_.pop()
             self.q_.push(self.top_)
-        self.q_.pop()
+        return self.q_.pop() 
 
     # @return an integer
     def top(self):