GeeksforGeeks App
Open App
Browser
Continue

# Counts of distinct consecutive sub-string of length two using C++ STL

Given a string the task is to print all distinct sub-strings of length two in the given string. All substrings should be printed in lexicographical order.
Examples:

```Input: str = "abcab"
Output: ab-2
bc-1
ca-1

Input: str = "xyz"
Output: xy-1
yz-1```

We declare a map d_pairs that uses a character pair key and count as value. We iterate over the given string from the starting index to store every consecutive pair if not present already and increment its count in the map. After completion of the loop, we get all distinct consecutive pairs and their corresponding occurrence count in the map container.
Please note that map is used as we need output in sorted order. We could use a unordered_map() if output was not needed in sorted order. Time complexity of underdered_map() operations is O(1) while that of map is O(Log n)

## CPP

 `// C++ STL based program to print all distinct``// substrings of size 2 and their counts.``#include``using` `namespace` `std;` `void` `printDistinctSubStrs(string str)``{``    ``// Create a map to store unique substrings of``    ``// size 2``    ``map, ``int``> dPairs;` `    ``// Count occurrences of all pairs``    ``for` `(``int` `i=0; ifirst.first << it->first.second``             ``<< ``"-"` `<< it->second << ``" "``;``}` `// Driver code``int` `main()``{``    ``string str = ``"abcacdcacabacaassddssklac"``;``    ``printDistinctSubStrs(str);``    ``return` `0;``}`

Output:

```Distinct sub-strings with counts:
aa-1 ab-2 ac-4 as-1 ba-1 bc-1 ca-4 cd-1 dc-1 dd-1 ds-1 kl-1 la-1 sd-1 sk-1 ss-2 ```

This article is contributed by Himanshu Gupta (Bagri). If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.