Dirs files naming convention fix

data_structures/Queue/QueueOnList.py → data_structures/queue/queue_on_list.py

@@ -1,45 +1,45 @@
-"""Queue represented by a python list"""
-class Queue():
-    def __init__(self):
-        self.entries = []
-        self.length = 0
-        self.front=0
-
-    def __str__(self):
-        printed = '<' + str(self.entries)[1:-1] + '>'
-        return printed
-
-    """Enqueues {@code item}
-    @param item
-        item to enqueue"""
-    def put(self, item):
-        self.entries.append(item)
-        self.length = self.length + 1
-
-
-    """Dequeues {@code item}
-    @requirement: |self.length| > 0
-    @return dequeued
-        item that was dequeued"""
-    def get(self):
-        self.length = self.length - 1
-        dequeued = self.entries[self.front]
-        self.front-=1
-        self.entries = self.entries[self.front:]
-        return dequeued
-
-    """Rotates the queue {@code rotation} times
-    @param rotation
-        number of times to rotate queue"""
-    def rotate(self, rotation):
-        for i in range(rotation):
-            self.put(self.get())
-
-    """Enqueues {@code item}
-    @return item at front of self.entries"""
-    def front(self):
-        return self.entries[0]
-
-    """Returns the length of this.entries"""
-    def size(self):
-        return self.length
+"""Queue represented by a python list"""
+class Queue():
+    def __init__(self):
+        self.entries = []
+        self.length = 0
+        self.front=0
+
+    def __str__(self):
+        printed = '<' + str(self.entries)[1:-1] + '>'
+        return printed
+
+    """Enqueues {@code item}
+    @param item
+        item to enqueue"""
+    def put(self, item):
+        self.entries.append(item)
+        self.length = self.length + 1
+
+
+    """Dequeues {@code item}
+    @requirement: |self.length| > 0
+    @return dequeued
+        item that was dequeued"""
+    def get(self):
+        self.length = self.length - 1
+        dequeued = self.entries[self.front]
+        self.front-=1
+        self.entries = self.entries[self.front:]
+        return dequeued
+
+    """Rotates the queue {@code rotation} times
+    @param rotation
+        number of times to rotate queue"""
+    def rotate(self, rotation):
+        for i in range(rotation):
+            self.put(self.get())
+
+    """Enqueues {@code item}
+    @return item at front of self.entries"""
+    def front(self):
+        return self.entries[0]
+
+    """Returns the length of this.entries"""
+    def size(self):
+        return self.length

data_structures/Queue/QueueOnPseudoStack.py → data_structures/queue/queue_on_pseudo_stack.py

@@ -1,50 +1,50 @@
-"""Queue represented by a pseudo stack (represented by a list with pop and append)"""
-class Queue():
-    def __init__(self):
-        self.stack = []
-        self.length = 0
-
-    def __str__(self):
-        printed = '<' + str(self.stack)[1:-1] + '>'
-        return printed
-
-    """Enqueues {@code item}
-    @param item
-        item to enqueue"""
-    def put(self, item):
-        self.stack.append(item)
-        self.length = self.length + 1
-
-    """Dequeues {@code item}
-    @requirement: |self.length| > 0
-    @return dequeued
-        item that was dequeued"""
-    def get(self):
-        self.rotate(1)
-        dequeued = self.stack[self.length-1]
-        self.stack = self.stack[:-1]
-        self.rotate(self.length-1)
-        self.length = self.length -1
-        return dequeued
-
-    """Rotates the queue {@code rotation} times
-    @param rotation
-        number of times to rotate queue"""
-    def rotate(self, rotation):
-        for i in range(rotation):
-            temp = self.stack[0]
-            self.stack = self.stack[1:]
-            self.put(temp)
-            self.length = self.length - 1
-
-    """Reports item at the front of self
-    @return item at front of self.stack"""
-    def front(self):
-        front = self.get()
-        self.put(front)
-        self.rotate(self.length-1)
-        return front
-
-    """Returns the length of this.stack"""
-    def size(self):
-        return self.length
+"""Queue represented by a pseudo stack (represented by a list with pop and append)"""
+class Queue():
+    def __init__(self):
+        self.stack = []
+        self.length = 0
+
+    def __str__(self):
+        printed = '<' + str(self.stack)[1:-1] + '>'
+        return printed
+
+    """Enqueues {@code item}
+    @param item
+        item to enqueue"""
+    def put(self, item):
+        self.stack.append(item)
+        self.length = self.length + 1
+
+    """Dequeues {@code item}
+    @requirement: |self.length| > 0
+    @return dequeued
+        item that was dequeued"""
+    def get(self):
+        self.rotate(1)
+        dequeued = self.stack[self.length-1]
+        self.stack = self.stack[:-1]
+        self.rotate(self.length-1)
+        self.length = self.length -1
+        return dequeued
+
+    """Rotates the queue {@code rotation} times
+    @param rotation
+        number of times to rotate queue"""
+    def rotate(self, rotation):
+        for i in range(rotation):
+            temp = self.stack[0]
+            self.stack = self.stack[1:]
+            self.put(temp)
+            self.length = self.length - 1
+
+    """Reports item at the front of self
+    @return item at front of self.stack"""
+    def front(self):
+        front = self.get()
+        self.put(front)
+        self.rotate(self.length-1)
+        return front
+
+    """Returns the length of this.stack"""
+    def size(self):
+        return self.length

dynamic_programming/FloydWarshall.py → dynamic_programming/floyd_warshall.py

@@ -1,37 +1,37 @@
-import math
-
-class Graph:
-    
-    def __init__(self, N = 0): # a graph with Node 0,1,...,N-1
-        self.N = N
-        self.W = [[math.inf for j in range(0,N)] for i in range(0,N)] # adjacency matrix for weight
-        self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j
-
-    def addEdge(self, u, v, w):
-        self.dp[u][v] = w
-
-    def floyd_warshall(self):
-        for k in range(0,self.N):
-            for i in range(0,self.N):
-                for j in range(0,self.N):
-                    self.dp[i][j] = min(self.dp[i][j], self.dp[i][k] + self.dp[k][j])
-
-    def showMin(self, u, v):
-        return self.dp[u][v]
-    
-if __name__ == '__main__':
-    graph = Graph(5)
-    graph.addEdge(0,2,9)
-    graph.addEdge(0,4,10)
-    graph.addEdge(1,3,5)
-    graph.addEdge(2,3,7)
-    graph.addEdge(3,0,10)
-    graph.addEdge(3,1,2)
-    graph.addEdge(3,2,1)
-    graph.addEdge(3,4,6)
-    graph.addEdge(4,1,3)
-    graph.addEdge(4,2,4)
-    graph.addEdge(4,3,9)
-    graph.floyd_warshall()
-    graph.showMin(1,4)
-    graph.showMin(0,3)
+import math
+
+class Graph:
+
+    def __init__(self, N = 0): # a graph with Node 0,1,...,N-1
+        self.N = N
+        self.W = [[math.inf for j in range(0,N)] for i in range(0,N)] # adjacency matrix for weight
+        self.dp = [[math.inf for j in range(0,N)] for i in range(0,N)] # dp[i][j] stores minimum distance from i to j
+
+    def addEdge(self, u, v, w):
+        self.dp[u][v] = w
+
+    def floyd_warshall(self):
+        for k in range(0,self.N):
+            for i in range(0,self.N):
+                for j in range(0,self.N):
+                    self.dp[i][j] = min(self.dp[i][j], self.dp[i][k] + self.dp[k][j])
+
+    def showMin(self, u, v):
+        return self.dp[u][v]
+
+if __name__ == '__main__':
+    graph = Graph(5)
+    graph.addEdge(0,2,9)
+    graph.addEdge(0,4,10)
+    graph.addEdge(1,3,5)
+    graph.addEdge(2,3,7)
+    graph.addEdge(3,0,10)
+    graph.addEdge(3,1,2)
+    graph.addEdge(3,2,1)
+    graph.addEdge(3,4,6)
+    graph.addEdge(4,1,3)
+    graph.addEdge(4,2,4)
+    graph.addEdge(4,3,9)
+    graph.floyd_warshall()
+    graph.showMin(1,4)
+    graph.showMin(0,3)

Project Euler/Problem 01/sol4.py → project_euler/problem_01/sol4.py

@@ -1,30 +1,30 @@
-def mulitples(limit):
-    xmulti = []
-    zmulti = []
-    z = 3
-    x = 5
-    temp = 1
-    while True:
-        result = z * temp
-        if (result < limit):
-            zmulti.append(result)
-            temp += 1
-        else:
-            temp = 1
-            break
-    while True:
-        result = x * temp
-        if (result < limit):
-            xmulti.append(result)
-            temp += 1
-        else:
-            break
-    collection = list(set(xmulti+zmulti))
-    return (sum(collection))
-    
-    
-        
-        
-        
-    
-print (mulitples(1000))
+def mulitples(limit):
+    xmulti = []
+    zmulti = []
+    z = 3
+    x = 5
+    temp = 1
+    while True:
+        result = z * temp
+        if (result < limit):
+            zmulti.append(result)
+            temp += 1
+        else:
+            temp = 1
+            break
+    while True:
+        result = x * temp
+        if (result < limit):
+            xmulti.append(result)
+            temp += 1
+        else:
+            break
+    collection = list(set(xmulti+zmulti))
+    return (sum(collection))
+
+
+
+
+
+
+print (mulitples(1000))

Project Euler/Problem 02/sol2.py → project_euler/problem_02/sol2.py

@@ -1,12 +1,12 @@
-def fib(n):
-    a, b, s = 0, 1, 0
-    while b < n:
-        if b % 2 == 0 and b < n: s += b
-        a, b = b, a+b
-    ls.append(s)
-
-T = int(input().strip())
-ls = []
-for _ in range(T):
-    fib(int(input().strip()))
-print(*ls, sep = '\n')
+def fib(n):
+    a, b, s = 0, 1, 0
+    while b < n:
+        if b % 2 == 0 and b < n: s += b
+        a, b = b, a+b
+    ls.append(s)
+
+T = int(input().strip())
+ls = []
+for _ in range(T):
+    fib(int(input().strip()))
+print(*ls, sep = '\n')