Changes possibly ambiguous description of array jumping game contract

fixes #2281
This commit is contained in:
Russell Stringer 2022-01-10 13:27:23 -05:00
parent 2989306ac8
commit e123642c8f
2 changed files with 2 additions and 2 deletions

@ -113,7 +113,7 @@ The list contains the name of (i.e. the value returned by
| | | to any position from i to i+n. | | | | to any position from i to i+n. |
| | | | | | | |
| | | Assuming you are initially positioned at the start of the array, determine | | | | Assuming you are initially positioned at the start of the array, determine |
| | | whether you are able to reach the last index of the array EXACTLY. | | | | whether you are able to reach the last index of the array. |
+------------------------------------+------------------------------------------------------------------------------------------+ +------------------------------------+------------------------------------------------------------------------------------------+
| Merge Overlapping Intervals | | Given an array of intervals, merge all overlapping intervals. An interval | | Merge Overlapping Intervals | | Given an array of intervals, merge all overlapping intervals. An interval |
| | | is an array with two numbers, where the first number is always less than | | | | is an array with two numbers, where the first number is always less than |

@ -279,7 +279,7 @@ export const codingContractTypesMetadata: ICodingContractTypeMetadata[] = [
"i to i+n.", "i to i+n.",
"\n\nAssuming you are initially positioned", "\n\nAssuming you are initially positioned",
"at the start of the array, determine whether you are", "at the start of the array, determine whether you are",
"able to reach the last index exactly.\n\n", "able to reach the last index.\n\n",
"Your answer should be submitted as 1 or 0, representing true and false respectively", "Your answer should be submitted as 1 or 0, representing true and false respectively",
].join(" "); ].join(" ");
}, },