2D Array

CodeChefOpen on judge ↗

Given a 2D Array, : 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A ‘T’ is a subset of values with indices falling in this pattern in array’s graphical representation: A B C D E There are 16 Ts in array. A T sum is the sum of a T’s value. Calculate T sum for every T in array, then print the maximum T sum. The array will always be 6*6. Example: Array= -9

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