Cracker shops

CodeChefOpen on judge ↗

Laxman is doing Diwali shopping. There are N shops numbered from 1 to N. Laxman wants to buy M different types of crackers. Crackers are numbered from 1 to M. Each shop sells many types of crackers. Laxman is currently at the i'th shop. Laxman want to find j and k, such that j and k >= i and he can buy all M types of crackers only by visiting shops in the range of j to k. If there are multiple val

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