The Old Monk

CodeChefOpen on judge ↗

Big Smoke is die hard lover of donuts, especially G.K.T’s donuts .Today he went over to have some of it. To his surprise, G.K.T turns out be to be a coding geek and refuses to serves him unless Big Smoke solves his two array merging problem, stated as : If two sorted arrays are given say A and B. You have to merge A and B in to a single array such that the resultant array is sorted. Input The

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