In this chapter, we have discussed how to construct a string in C++ using std::string. We then used it to solve several problems in the string data type. We can rearrange a string to create another string, which is called an anagram. We also can detect if a string is a palindrome if it has the exact same spelling both forward and backward. We have discussed binary string, and can now convert a decimal number to binary string and vice versa.
Another string problem we have solved is checking whether a string is a subsequence of another string. Also, we have successfully generated all possible subsequences from a string. Finally, we have learned how a word processor (such as Notepad or Sublime Text) can find a word in a document using pattern searching.
In the next chapter, we are going to discuss another non-linear data structure, which is a tree structure, and the algorithm implementation of this data structure.
