-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlogic-problem-1.py
More file actions
30 lines (27 loc) · 815 Bytes
/
logic-problem-1.py
File metadata and controls
30 lines (27 loc) · 815 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
# Don't delete any of the given code.
def evenlySpaced(a, b, c):
# insert your logic here
order = []
order.append(a)
order.append(b)
order.append(c)
order.sort()
if order[0] - order[1] == order[1] - order[2]:
return True
else:
return False
# Test cases. Don't modify
print(1,evenlySpaced(2, 4, 6)) # this would be True
print(2,evenlySpaced(4, 6, 2)) # this would be True
print(3,evenlySpaced(4, 6, 3)) # this would be False
print(4,evenlySpaced(6, 2, 4))
print(5,evenlySpaced(6, 2, 8))
print(6,evenlySpaced(2, 2, 2))
print(7,evenlySpaced(2, 2, 3))
print(8,evenlySpaced(9, 10, 11))
print(9,evenlySpaced(10, 9, 11))
print(10,evenlySpaced(10, 9, 9))
print(11,evenlySpaced(2, 4, 4))
print(12,evenlySpaced(2, 2, 4))
print(13,evenlySpaced(3, 6, 12))
print(14,evenlySpaced(12, 3, 36))