# Blogs Hub

### by Sumit Chourasia | Sep 30, 2020 | Category :coding | Tags : algorithmडेटा-संरचनाआसानhash-tableleetcode

#### Occurrences After Bigram - Hash Table - Easy - LeetCode - मिनी टीवी

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 <= text.length <= 1000
text consists of space separated words, where each word consists of lowercase English letters.
1 <= first.length, second.length <= 10
first and second consist of lowercase English letters.

``````public class Solution {
public string[] FindOcurrences(string text, string first, string second) {
var result = new List<string>();
if(text == null){
return result.ToArray();
}
var arr = text.Split(' ');
if(arr.Length<3){
return result.ToArray();
}

for(int i=2;i<arr.Length;i++){
if(arr[i-2]==first && arr[i-1]==second){
}
}

return result.ToArray();
}
}``````

Time Complexity: O(n)

Space Complexity: O(1)

Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia