a string binary consist character 0 1string v substre string w nonzero length read start position string w for example stre 010 substring 0 1 0 01 10 010 two substring consider different position occurrence different so string occur multiple time consider number time occursyou give binary string s your task find number substring contain exactly k character 1