We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 297da1f commit 455749aCopy full SHA for 455749a
dynamic_programming/brige_torch_problem.py
@@ -1,4 +1,4 @@
1
-person_pace = [1, 2, 5, 10,12,16]
+person_pace = [1, 2, 5, 10, 12, 16]
2
person_pace.sort() # Sort the array for optimal pairing
3
people = len(person_pace)
4
0 commit comments