Changes from Mac

Author: sanjaypradeep

Collections/UniqueMaximumNumber.py

@@ -6,13 +6,14 @@ def testing(args):
         if args.count(i) == 1:
             uniq.append(i)
     if len(uniq) != 0:
-        print max(uniq)
+        print(max(uniq))
     else:
-        print "It seems, all the numbers are repeated!"
+        print("It seems, all the numbers are repeated!")
+
 
 if __name__ == '__main__':
     a=int(input())
-    b = list(raw_input())
+    b = list(input())
     while True:
         try:
             b.remove(" ")
@@ -24,5 +25,5 @@ def testing(args):
             orgInput.append(int(i))
         else:
             pass
-    print orgInput
+    print(orgInput)
     testing(orgInput)

Excersise/Factorial.py

@@ -11,7 +11,19 @@ def fa(n):
             f = f*i
     print (f)
 
+
+def fac(n):
+    resp = 1
+    givenInput = list(range(1, n+1))
+    for i in givenInput:
+        resp = resp * i
+
+    return resp
+
+
+
 if __name__ == '__main__':
     print ("Enter a number to find the factorial!")
     getInput = int(input())
-    fa(getInput)
+    fa(getInput)
+    fac(5)

QDataStructure/Deque_Implementation.py

@@ -0,0 +1,58 @@
+__author__ = 'Sanjay'
+
+# A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue.
+# It has two ends, a front and a rear, and the items remain positioned in the collection.
+# What makes a deque different is the unrestrictive nature of adding and removing items.
+# New items can be added at either the front or the rear.
+# Likewise, existing items can be removed from either end.
+# it does not require the LIFO and FIFO orderings that are enforced by those data structures.
+# It is up to you to make consistent use of the addition and removal operations.
+
+# Deque() creates a new deque that is empty. It needs no parameters and returns an empty deque.
+
+# addFront(item) adds a new item to the front of the deque. It needs the item and returns nothing.
+
+# addRear(item) adds a new item to the rear of the deque. It needs the item and returns nothing.
+
+# removeFront() removes the front item from the deque. It needs no parameters and returns the item. The deque is modified.
+
+# removeRear() removes the rear item from the deque. It needs no parameters and returns the item. The deque is modified.
+
+# isEmpty() tests to see whether the deque is empty. It needs no parameters and returns a boolean value.
+
+# size() returns the number of items in the deque. It needs no parameters and returns an integer.
+
+class Deque:
+    def __init__(self):
+        self.items = []
+
+    def addFront(self,item):
+        self.items.append(item)
+
+    def addRear(self,item):
+        self.items.insert(0,item)
+
+    def removeFront(self):
+        self.items.pop()
+
+    def removeRear(self):
+        self.items.pop(0)
+
+    def isEmpty(self):
+        return self.items == []
+
+    def size(self):
+        return len(self.items)
+
+if __name__ == '__main__':
+    d=Deque()
+    print(d.isEmpty())
+    d.addRear(4)
+    d.addRear('dog')
+    d.addFront('cat')
+    d.addFront(True)
+    print(d.size())
+    print(d.isEmpty())
+    d.addRear(8.4)
+    print(d.removeRear())
+    print(d.removeFront())

QDataStructure/RenamingAFile.py

@@ -0,0 +1,57 @@
+__author__ = 'Sanjay'
+
+#
+# Stack() creates a new stack that is empty. It needs no parameters and returns an empty stack.
+
+# push(item) adds a new item to the top of the stack. It needs the item and returns nothing.
+
+# pop() removes the top item from the stack. It needs no parameters and returns the item. The stack is modified.
+
+# peek() returns the top item from the stack but does not remove it. It needs no parameters. The stack is not modified.
+
+# isEmpty() tests to see whether the stack is empty. It needs no parameters and returns a boolean value.
+
+# size() returns the number of items on the stack. It needs no parameters and returns an integer.
+
+
+#The above information gives you clear understanding on Stacks Predefined functions.
+class Stack:
+    def __init__(self):
+        self.items = []
+
+    def push(self, newItem):
+        self.items.append(newItem)
+
+    def pop(self):
+        self.items.pop()
+
+    def isEmpty(self):
+        return self.items == []
+
+    def size(self):
+        return len(self.items)
+
+    def show(self):
+        print self.items
+        return self.items
+
+    def peek(self):
+         return self.items[0]
+
+    def size(self):
+        return len(self.items)
+
+
+if __name__ ==  '__main__':
+    obj = Stack()
+    obj.push(13)
+    obj.show()
+    obj.push('sanjay')
+    obj.push('surya')
+    obj.push(45)
+    obj.show()
+    obj.pop()
+    obj.show()
+    obj.size()
+    obj.isEmpty()
+    obj.show()