# Minimum number of stops from given path

There are many points in two-dimensional space which need to be visited in a specific sequence. Path from one point to other is always chosen as shortest path and path segments are always aligned with grid lines. Now we are given the path which is chosen for visiting the points, we need to tell the minimum number of points that must be needed to generate given path.

Examples:

In above diagram, we can see that there must be at least 3 points to get above path, which are denoted by A, B and C

We can solve this problem by observing the pattern of movement when visiting the stops. If we want to take the shortest path from one point to another point then we will move in either one or max two directions i.e. it is always possible to reach the other point following maximum two directions and if more than two directions are used then that path won’t be shortest, for example, path LLURD can be replaced with LLL only, so to find minimum number of stops in the path, we will loop over the characters of the path and maintain a map of directions taken till now. If at any index we found both ‘L’ as well as ‘R’ or we found both ‘U’ as well as ‘D’ then there must be a stop at current index, so we will increase the stop count by one and we will clear the map for next segment.

Total time complexity of the solution will be O(N)

`// C++ program to find minimum number of points ` `// in a given path ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// method returns minimum number of points in given path ` `int` `numberOfPointInPath(string path) ` `{ ` ` ` `int` `N = path.length(); ` ` ` ` ` `// Map to store last occurrence of direction ` ` ` `map<` `char` `, ` `int` `> dirMap; ` ` ` ` ` `// variable to store count of points till now, ` ` ` `// initializing from 1 to count first point ` ` ` `int` `points = 1; ` ` ` ` ` `// looping over all characters of path string ` ` ` `for` `(` `int` `i = 0; i < N; i++) { ` ` ` ` ` `// storing current direction in curDir ` ` ` `// variable ` ` ` `char` `curDir = path[i]; ` ` ` ` ` `// marking current direction as visited ` ` ` `dirMap[curDir] = 1; ` ` ` ` ` `// if at current index, we found both 'L' ` ` ` `// and 'R' or 'U' and 'D' then current ` ` ` `// index must be a point ` ` ` `if` `((dirMap[` `'L'` `] && dirMap[` `'R'` `]) || ` ` ` `(dirMap[` `'U'` `] && dirMap[` `'D'` `])) { ` ` ` ` ` `// clearing the map for next segment ` ` ` `dirMap.clear(); ` ` ` ` ` `// increasing point count ` ` ` `points++; ` ` ` ` ` `// revisitng current direction for next segment ` ` ` `dirMap[curDir] = 1; ` ` ` `} ` ` ` `} ` ` ` ` ` `// +1 to count the last point also ` ` ` `return` `(points + 1); ` `} ` ` ` `// Driver code to test above methods ` `int` `main() ` `{ ` ` ` `string path = ` `"LLUUULLDD"` `; ` ` ` `cout << numberOfPointInPath(path) << endl; ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

3

This article is contributed by **Utkarsh Trivedi**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Form minimum number from given sequence
- Minimum number of deletions so that no two consecutive are same
- Minimum number of sub-strings of a string such that all are power of 5
- Transform One String to Another using Minimum Number of Given Operation
- Minimum number of times A has to be repeated such that B is a substring of it
- Minimum number of subsets with distinct elements
- Remove minimum number of characters so that two strings become anagram
- Minimum number of additons to make the string balanced
- Minimum number of distinct elements after removing m items
- Minimum number of Parentheses to be added to make it valid
- Reduce the number to minimum multiple of 4 after removing the digits
- Minimum number of deletions to make a string palindrome
- Minimum number of deletions to make a string palindrome | Set 2
- Find minimum number of steps to reach the end of String
- Minimum number of subsequences required to convert one string to another