Solving Occurrences After Bigram in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

For each such occurrence, add "third" to the answer, and return the answer.

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"]


  1. 1 <= text.length <= 1000
  2. 1 <= first.length, second.length <= 10

See the full details of the problem Occurrences After Bigram at LeetCode

Originally posted at: