← All problemsSign in

Missing alphabets

Shreyas loves string having all english lowercase alphabets. Given a string A, find how many english alphabets are missing? Input - The first line of the input contains an integer T denoting number of test cases. The descriptions of T test cases follow. - The first line of each test case contains a single integer N, denoting the length of string. - The second line of each test case contains

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

Sign in to chat with the tutor and save your progress.

Sign in to start