Count Occurrences Of Anagrams of a word in a string using Sliding Window Algorithm c#

Problem: Count occurrences of Anagrams of a word in a string

Explanantion:

string is “forxxorfxdofr” and word is “for”

Anagrams of word are: 3! =6 “for”, “fro”, “orf”, “ofr”, “rof”, “rfo”

So anagrams present in the strings are “for”, “orf”, “ofr” and count will be 3

Code: