Hello, and welcome to our analysis lesson. Today, we will be tackling a common problem in the field of string manipulations with C++. We will learn how to find all occurrences of a substring within a larger string. The techniques you will master today can be utilized in numerous situations, such as text processing and data analysis. Are you ready to get started? Let's jump right in!

Here is the task for today: We have two vectors of strings, both of identical lengths — the first containing the "original" strings and the second containing the substrings. Our goal is to detect all occurrences of each substring within its corresponding original string and, finally, return a vector that contains the starting indices of these occurrences. Remember, the index counting should start from 0.

Example

Let's consider the following vectors: Original Vector: { "HelloWorld", "LearningC++", "GoForBroke", "BackToBasics" } Substring Vector: { "loW", "ear", "o", "Ba" }.

The following are the expected outputs: In "HelloWorld", "loW" starts at index 3. In "LearningC++", "ear" starts at index 1. In "GoForBroke", "o" appears at indices 1, 3, and 7. In "BackToBasics", "Ba" starts at indices 0 and 6.

Thus, when findSubString({"HelloWorld", "LearningC++", "GoForBroke", "BackToBasics"}, {"loW", "ear", "o", "Ba"}) is invoked, the function should return

Although this task may seem fairly straightforward, it can prove challenging. However, don't worry! We will break it down step by step.

Initially, we need to create a space to store our results. Can you think of a C++ data type that would be ideal for this task? That's right! A vector would be perfect!

To pair original strings with their substrings, we use a simple for loop. In C++, we don't have the zip() function like in Python; however, we can achieve the same result by relying on the indices, as both vectors share the same length. To find the first occurrence of each substring in the corresponding original string, we utilize the std::string::find method:

In string::find(substr), we provide the substring that we intend to locate. The function starts its search from the beginning because we have not specified a starting position.

The next step is to find the subsequent instances of the substring in the original.

To do this, we will use a while loop. But when should we stop looking for more occurrences? When our find() function starts returning std::string::npos, it indicates there are no more matches to be found.

Each time we locate a match, we record its starting index in the match_indices vector, adjust the start_pos, and begin the search anew:

Finally, we employ std::ostringstream to format the result for improved readability and add it to the result vector:

That's it! We have completed the design of our function.

Here is the complete function, incorporating all the steps we have discussed so far:

Well done! You've mastered a central operation in string manipulations in C++ — finding all occurrences of a substring in another string. Keep in mind that this algorithm has numerous applications in real-world scenarios. Now that we have intricately dissected the problem and provided a detailed solution, I encourage you to practice more. Future exercises will help you hone your skills further. Keep on coding and exploring!