substring

CodeChefOpen on judge ↗

You are given a string S, you need to find count of all contiguous substrings starting and ending with same character. Your code should have worst-case time complexity of O(n) where n is the length of the string. Input: string having all small characters Output: No of such substring Sample Example 1: Input : "abcab" Output : 7 There are 15 substrings of "abcab" a, ab, abc, abca

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