C
c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/*
* Done so as to demonstrate the implementation
* and use of a dynamically sized data structure
* to accommodate a string of unknown length.
*
* Resizing strategy is doubling the size to
* achieve an amortised constant time complexity
* for the insertion of elements.
*
* Code Coach: Flowing Words [PRO]
*
* Description:
*
* If a sentence flows, the first letter of each word will
* be the same to the last letter of the previous word.
*
* Task:
* Write a program that takes in a string that contains a
* sentence, checks if the first letter of each word is
* the same as the last letter of the previous word. If
* the condition is met, output true, if not, output
* false. Casing does not matter.
*
* Example input:
* This string gets stuck
* Temporary yield doesnt turn
* Selfproclaimed Lord of the lemurs
*
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run