Battle of Legends

CodeChefOpen on judge ↗

Two tourists named Shiv and Abhi like to travel a lot. While travelling they like to solve some puzzles too. Once while travelling in Advaitam 3.0 camps, they came to a camp where a tough puzzle is present. In the puzzle, there is a rectangular maze of size N * M. Each cell of the maze consists of value Ai, j. Shiv is obsessed with the maximum values and Abhi is obsessed with the minimum values. N

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