DAREDEVIL and Hells Kitchen

CodeChefOpen on judge ↗

Problem Description : DAREDEVIL wants to solve a problem. There is a series of N bulidings of different heights in front of the him. He can only climb those buildings if and only if all those buildings make a pyramid. Definition of a pyramid is :- - the heights of those buildings should be increasing at-first and then it should be decreasing afterwards. - the array must start with 1 as well as

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