ME

Stop and Go

You are given a string s representing a sequence of stop and go instructions. The instructions are denoted by the characters 'stop' and 'go'. Your task is to determine the number of times the car stops and goes. The instructions are separated by a newline character. The input string will not contain any leading or trailing whitespace. The instructions will always be in the format 'stop' or 'go'.

Example 1:

Input:"stop stop go go"

Output:2

Example 2:

Input:"go go go go"

Output:4

Example 3:

Input:"stop go go go go"

Output:2

Constraints:

The input string will not be empty.
The input string will only contain the characters 'stop', 'go', and newline characters.
The instructions will always be in the format 'stop' or 'go'.

solution.cpp

Loading...

Run code to see test results

00:00 / 69:42

Stop and Go

MediumMed•158 views

You are given a string s representing a sequence of stop and go instructions. The instructions are denoted by the characters 'stop' and 'go'. Your task is to determine the number of times the car stops and goes. The instructions are separated by a newline character. The input string will not contain any leading or trailing whitespace. The instructions will always be in the format 'stop' or 'go'.

Example 1:

Input:"stop stop go go"

Output:2

Example 2:

Input:"go go go go"

Output:4

Example 3:

Input:"stop go go go go"

Output:2

Constraints:

The input string will not be empty.
The input string will only contain the characters 'stop', 'go', and newline characters.
The instructions will always be in the format 'stop' or 'go'.

MediumMed•158 views

Time Complexity

Space Complexity

A

Asked at

Amazon ML Summer School

AD