Code Test Python equilibriumTest and boojTest

EquilibriumIndex.py

@@ -1,2 +1,18 @@
 def eqindex(data):
-    #do code here
+    #Intialize all variables
+    sum = 0
+    leftsum = 0
+    indexes = []
+    #Algorithm is O(n) complexity
+    #Calculate Total Sum
+    for i in range(0, len(data)):
+        sum += data[i]
+
+    for n in range(0, len(data)):
+        #Total Sum now rightsum
+        sum -= data[n]
+        #Check if equilbrium index
+        if (leftsum == sum):
+            indexes.append(n)
+        leftsum += data[n]
+    return indexes

EquilibriumIndexTest.py

@@ -7,4 +7,4 @@
 
 for data in d:
     print("Test: %r" % data)
-    print("Result: %r" % list(eqindex(data)))
+    print("Result: %r" % eqindex(data))

TrueBooj.py

@@ -1,2 +1,10 @@
 def truebooj(number):
-    # do code here
+    for i in range(1,number+1):
+        if i % 10 == 0:
+            print ('TrueBooj')
+        elif i % 5 == 0:
+            print ('Booj')
+        elif i % 3 == 0:
+            print ('True')
+        else:
+            print (i)

TrueBoojTest.py

@@ -1,3 +1,3 @@
 from TrueBooj import truebooj
 
-print "\n".join(truebooj(x) for x in xrange(1, 75))
+truebooj(75)