Count subsequences

CodeChefOpen on judge ↗

Manju is fascinated by the string "ab". He always try to find string "ab" everywhere. Neel gave him a string S consisting of characters 'a' and 'b'. Neel asked Manju to find number of distinct subsequence "ab" in give string S. A subsequence is defined as string left after removing zero or more characters from original string. For eg: Subsequence of string aba are {a,b,a,ab,aa,aba}. Two subsequ

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.

voice by Sarvam AI