# Leetcode: Occurrences After Bigram

Occurrences After Bigram Similar Problems:

Given words 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.

Example 1:

```Input: text = "alice is a good girl she is a good student", first = "a", second = "good"
Output: ["girl","student"]
```

Example 2:

```Input: text = "we will we will rock you", first = "we", second = "will"
Output: ["we","rock"]
```

Note:

1. 1 <= text.length <= 1000
2. text consists of space separated words, where each word consists of lowercase English letters.
3. 1 <= first.length, second.length <= 10
4. first and second consist of lowercase English letters.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.

• Solution:
```// Blog link: https://code.dennyzhang.com/occurrences-after-bigram
// Basic Idea: compare
// Complexity: Time O(n), Space O(1)
import "strings"
func findOcurrences(text string, first string, second string) []string {
res := []string{}
l := strings.Split(text, " ")
for i:=0; i<len(l)-2; i++ {
if l[i] == first && l[i+1] == second {
res = append(res, l[i+2])
}
}
return res
}
```

Share It, If You Like It.