Best Friends Challenge

CodeChefOpen on judge ↗

Problem description Supraja And Rupsikha are best friends. One day they decided to play a game. Rupsikha gives Supraja n*m grid consisting of lower case characters of the English Alphabet. She challenges Supraja to determine the maximum number of occurences of a character contiguosly either vertically or horizontally. "Well, that's easy",says Supraja. But Supraja is very busy with checking out he

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