From 0855532081f1b69ee0108ae20fd65a36aa99e8e0 Mon Sep 17 00:00:00 2001 From: Anatoly Kussul Date: Mon, 11 Apr 2022 00:11:46 +0300 Subject: [PATCH] small pharsing changes --- doc/source/basicgameplay/codingcontracts.rst | 2 +- src/data/codingcontracttypes.ts | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/source/basicgameplay/codingcontracts.rst b/doc/source/basicgameplay/codingcontracts.rst index 7f82e6466..0a34c61bc 100644 --- a/doc/source/basicgameplay/codingcontracts.rst +++ b/doc/source/basicgameplay/codingcontracts.rst @@ -99,7 +99,7 @@ The list contains the name of (i.e. the value returned by | Total Ways to Sum II | | You are given an array with two elements. The first element is an integer n. | | | | The second element is an array of numbers representing the set of available integers. | | | | How many different distinct ways can that number n be written as | -| | | a sum of integers containing in the given set? | +| | | a sum of integers contained in the given set? | | | | You may use each integer in the set zero or more times. | +------------------------------------+------------------------------------------------------------------------------------------+ | Spiralize Matrix | | Given an array of array of numbers representing a 2D matrix, return the | diff --git a/src/data/codingcontracttypes.ts b/src/data/codingcontracttypes.ts index 66f1d6d99..299807340 100644 --- a/src/data/codingcontracttypes.ts +++ b/src/data/codingcontracttypes.ts @@ -153,7 +153,7 @@ export const codingContractTypesMetadata: ICodingContractTypeMetadata[] = [ const s: number[] = data[1]; return [ `How many different distinct ways can the number ${n} be written`, - "as a sum of integers containing in the set\n\n", + "as a sum of integers contained in the set:\n\n", `[${s}]?\n\n`, "You may use each integer in the set zero or more times.", ].join(" ");