← All problemsSign in

Movie Names

1. A certain production house is creating a databases of all the movies produced. They use the acronyms of the movies as their primary column, so a sample movie would look like $‘KKKG.’$. However due size restrictions, they want to store in an even efficient manner, the finalised the approach that the name would be stored as $3[K]G$. They updated this across their system, while designing the porta

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