We use cookies (including Google cookies) to personalize ads and analyze traffic. By continuing to use our site, you accept our Privacy Policy.

SimplyLeet
TagsDisclaimersPrivacyTermsContactAbout Us

Occurrences After Bigram

Difficulty: Easy

Problem Description

Given two strings first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, and third comes immediately after second. Return an array of all the words third for each occurrence of "first second third".

Key Insights

  • The problem involves parsing a given text to find patterns of words.
  • We need to track the position of first and second to identify the corresponding third.
  • The words in the text are separated by a single space, making it easier to split and analyze.

Space and Time Complexity

Time Complexity: O(n), where n is the number of words in the text, since we need to traverse the entire text once. Space Complexity: O(m), where m is the number of occurrences found, as we need to store the results in an array.

Solution

The solution involves splitting the input text into words and iterating through the list to find occurrences of first followed by second. For each valid occurrence, we collect the word that follows second (i.e., third). We utilize a simple list to store the results, which is efficient given the constraints.

Code Solutions

def findOcurrences(text: str, first: str, second: str) -> List[str]:
    words = text.split()  # Split the text into words
    result = []  # Initialize a list to store the results
    for i in range(len(words) - 2):  # Loop through the words
        if words[i] == first and words[i + 1] == second:  # Check for the pattern
            result.append(words[i + 2])  # Add the third word to the result
    return result  # Return the final result
← Back to All Questions