Count The String

CodeChefOpen on judge ↗

Given a string consisting of lowercase latin alphabets. Print the alphabet’s which appears more than a given number of times(k) in the descending order of the number of times they appear. Print “NONE” if no alphabet appears more than k times. if more than one alphabets appear same number of times , print it in the increasing order of ascii value. Input First line consists of T (number of test

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