You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: Finding_local_groups_of_integers.ipynb
+1-1
Original file line number
Diff line number
Diff line change
@@ -10,7 +10,7 @@
10
10
"\n",
11
11
"June 12, 2024\n",
12
12
"\n",
13
-
"Supintegere we have an ordered list of integers, where some members of the list occur in proximity to each other. We wish to return a list of tuples, such that each tuple stores the first and last integer of each local group within the list of numbers. To define 'local' we can choose some offset, representing the maximum difference between two adjacent elements of a proximity group. \n",
13
+
"Suppose we have an ordered list of integers, where some members of the list occur in proximity to each other. We wish to return a list of tuples, such that each tuple stores the first and last integer of each local group within the list of numbers. To define 'local' we can choose some offset, representing the maximum difference between two adjacent elements of a proximity group. \n",
14
14
"\n",
15
15
"So for instance, from the list of integers [0,1,3,6,9,50,53,56,70,100,110,120], we would like to return [(0,9),(50,70),(100,120)] in the case where our offset is 25. We will implement this below.\n",
0 commit comments