sherlock
CodeChefOpen on judge ↗
Sherlock Inc is hiring. Your friends think that you might be a potential candidate who could get selected. You have aced all the problems given Dr. Watson, which is a great feat as no one else was able to perform the same. The last problem was given Sherlock himself and if you are able to solve it you might actually get to work with him. You are given a positive integer $k$ such that $1≤n≤k$, Sher
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.
Sign in to chat with the tutor and save your progress.
Sign in to start