[Python]Challenge_7(Unreviewed)

challenge_7/python/mjuiuc/README.md

@@ -0,0 +1,5 @@
+#Solution
+
+I think I got it figured out. All I had to do was take the sum of the length of the list and then the sum of all the numbers in the list, find the difference betweend those results, and then return the difference modded by the length of the list. The function meets runtime and space requirements.
+
+I included some test cases in my solution.

challenge_7/python/mjuiuc/solution.py

@@ -0,0 +1,9 @@
+def solution(nums):
+	n = len(nums) + 1
+	sums = 0
+	Summation = 0
+	for i in nums:
+		sums += i
+	for i in xrange(0,n+1):
+		Summation += i
+	return (Summation - sums) % n