Lovely Diamond

CodeChefOpen on judge ↗

Mickey loves diamonds and he loves printing them too.But he got tired of printing so he ask coder like you to print $n$ order diamonds for him. you need to print $2*i$ stars on each from$i =1$ line till $ i = n$ and then print in decreasing order form $i= n-1 $ to $i = 1$ For example a $2$ order diamond looks like this: **

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