File tree Expand file tree Collapse file tree 1 file changed +5
-5
lines changed
c-sharp/Problems/arrays-and-hashing Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Original file line number Diff line number Diff line change 30
30
* Output: "chopper is not a tanuki"
31
31
*
32
32
* Constraints:
33
- * 1 <= s.length <= 500
34
- * k is in the range [1, the number of words in s].
35
- * s consist of only lowercase and uppercase English letters and spaces.
36
- * The words in s are separated by a single space.
37
- * There are no leading or trailing spaces.
33
+ * • 1 <= s.length <= 500
34
+ * • k is in the range [1, the number of words in s].
35
+ * • s consist of only lowercase and uppercase English letters and spaces.
36
+ * • The words in s are separated by a single space.
37
+ * • There are no leading or trailing spaces.
38
38
*
39
39
* Hint 1:
40
40
* It's easier to solve this problem on an array of strings so parse the string to an array of words
You can’t perform that action at this time.
0 commit comments