Add files via upload

Author: abrahamalbert18

Collections Deque using eval.py

@@ -0,0 +1,13 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+n= input()
+d= deque()
+code= [raw_input().split() for i in range(n)]
+for i in code:
+    if len(i)> 1:
+        val= i[-1]
+        op= i[0] + "(" + val + ")"
+        eval('d.'+ op)
+    else:
+        eval('d.'+ i[0] +"()")
+print " ".join(map(str, d))   

Collections Moderate Problem using deques.py

@@ -0,0 +1,31 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+N = int(raw_input())
+assert N>=1 and N<=5
+cubes=[]
+for i in range(N):
+    n = int(raw_input())
+    assert n>=1 and n<=10**5
+    cubes.append((map(int, raw_input().split())))
+    
+for i in cubes:
+    d= deque(i)
+    ans= "Yes"
+    vp=[1000000000000]
+    while (ans=="Yes" and len(d)>1):
+        if d[0] <= d[-1]:
+            k=d.pop()
+            if k > vp[-1]:
+                ans= "No"
+        else:
+            k=d.popleft()
+            if k > vp[-1]:
+                ans= "No"
+        
+        vp.append(k)    
+    if len(d)==1:
+        if d[0]> vp[-1]:
+            ans= "No"
+    print ans        
+    
+        

Collections Moderate Problem.py

@@ -0,0 +1,11 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+N= input()
+d= OrderedDict()
+words= [raw_input() for i in range(N)]
+counter= Counter(words)
+print len(counter)
+for i in words:
+     d[i]= counter[i]
+print " ".join(map(str,d.values()))
+    

Collections Most Common Moderate Problem.py

@@ -0,0 +1,14 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+s= raw_input()
+string= [i for i in s]
+counter= Counter(string)
+string= sorted(set(string))
+for i in range(3):
+    for j in string:
+        if counter[j]== max(counter.values()):
+            print j+" "+ str(max(counter.values()))
+            counter.pop(j) 
+            break
+            print counter
+        

Collections Named Tuple.py

@@ -0,0 +1,29 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+N,students= input(), namedtuple('students',raw_input().split())
+stud=  [students(*raw_input().split()) for i in range(N)]                 #passed string of input as a single key
+print sum([float (i.MARKS) for i in stud]) /N
+
+   
+'''    
+Code 01
+
+>>> from collections import namedtuple
+>>> Point = namedtuple('Point','x,y')
+>>> pt1 = Point(1,2)
+>>> pt2 = Point(3,4)
+>>> dot_product = ( pt1.x * pt2.x ) +( pt1.y * pt2.y )
+>>> print dot_product
+11
+Code 02
+
+>>> from collections import namedtuple
+>>> Car = namedtuple('Car','Price Mileage Colour Class')
+>>> xyz = Car(Price = 100000, Mileage = 30, Colour = 'Cyan', Class = 'Y')
+>>> print xyz
+Car(Price=100000, Mileage=30, Colour='Cyan', Class='Y')
+>>> print xyz.Class
+Y
+
+
+'''

Collections OrderedDict.py

@@ -0,0 +1,14 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+N= input()
+d= OrderedDict()
+for i in range(N):
+    item = raw_input().split()
+    itemPrice= int(item[-1])
+    itemName= " ".join(item[:-1])
+    if d.get(itemName):                      # .get is used to check if itemName already exists
+       d[itemName] += itemPrice
+    else:
+       d[itemName] = itemPrice
+for i in d.keys():
+    print i, d[i]

Collections Pileup Moderate Problem using deques(faster).py

@@ -0,0 +1,18 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import deque
+
+def stackable(cubes):
+    curr = cubes.popleft() if cubes[0] > cubes[-1] else cubes.pop()
+    while cubes:
+        left, right = cubes[0], cubes[-1]
+        if left >= right and left <= curr:
+            curr = cubes.popleft()
+        elif right > left and right <= curr:
+            curr = cubes.pop()
+        else:
+            return False
+    return True
+
+for i in range(int(raw_input())):
+    n, cubes = input(), deque(map(int, raw_input().split()))
+    print('Yes' if stackable(cubes) else 'No') 

Collections Pileup Moderate Problem using deques.py

@@ -0,0 +1,31 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+N = int(raw_input())
+assert N>=1 and N<=5
+cubes=[]
+for i in range(N):
+    n = int(raw_input())
+    assert n>=1 and n<=10**5
+    cubes.append((map(int, raw_input().split())))
+    
+for i in cubes:
+    d= deque(i)
+    ans= "Yes"
+    vp=[1000000000000]
+    while (ans=="Yes" and len(d)>1):
+        if d[0] <= d[-1]:
+            k=d.pop()
+            if k > vp[-1]:
+                ans= "No"
+        else:
+            k=d.popleft()
+            if k > vp[-1]:
+                ans= "No"
+        
+        vp.append(k)    
+    if len(d)==1:
+        if d[0]> vp[-1]:
+            ans= "No"
+    print ans        
+    
+        

Collections Shoe Size Money problem.py

@@ -0,0 +1,14 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+X=input()
+shoeSizes=map(int, raw_input().split())
+shoeSizes=Counter(shoeSizes)
+N= input()
+customer= [ map(int, raw_input().split())  for i in range(N)]
+money=0
+for i in customer:
+    if (i[0] in shoeSizes) and ( shoeSizes[i[0]] > 0) :
+        money+=i[1]
+        shoeSizes[i[0]]-=1 
+        
+print money

Collections defaultdict.py

@@ -0,0 +1,17 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import *
+n, m = map(int, raw_input().split())
+A= [raw_input() for i in range(n)]
+B= [raw_input() for i in range(m)]
+d= defaultdict(list)
+index=0
+for i in A:
+    d[i].append( A.index(i, index) + 1)
+    index+=1
+for i in B:
+    if i not in A:
+        print -1
+    else:
+        print " ".join(map(str, d[i]))   # print a list of elements with uniform space/gap
+        
+