3044. Most Frequent Prime

LeetCodeArrayHash TableMathMatrixCountingEnumerationOpen on judge ↗

You are given a m x n 0-indexed 2D matrix mat. From every cell, you can create numbers in the following way: - There could be at most 8 paths from the cells namely: east, south-east, south, south-west, west, north-west, north, and north-east. - Select a path from them and append digits in this path to the number being formed by traveling in this direction. - Note that numbers are generated at e

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