Substring
CodeChefOpen on judge ↗
Statement Given a string s in lowercase and character X Given an integer Y Find the total number of substrings having exactly Y times character X. ##Input: The first argument given is the String S. The second argument given is character X. The third argument given is Integer Y ##Output: print total number of substrings having exactly Y times character X. ##Constrain
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start