SPECIAL SUBSEQUENCE

CodeChefOpen on judge ↗

PROBLEM DESCRIPTION You are given a string(S) by the Professor(P).Your task is to find all distinct subsequences of the string(S). Two subsequence is said to be distinct if they are different after performing the sort operation on both the subsequence.Professor(P) knows that number of such different subsequences can be very large so he ask you to print (number%1000000007). subsequence {"aba","aab

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