← All problemsSign in

Harshdeep And Navdeep

Harshdeep and Navdeep are best friends . Navdeep is good at String manipulation concept. Harshdeep challenged Navdeep to solve one problem related to strings . Harshdeep gives a string s of length n. Each character is either one of the first k lowercase latin letters or a question mark. Navdeep’s task is to replace every question mark with one of the first k lowercase latin letters in such a way

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