Available question text
Given an m x n digit matrix, form numbers by walking from every cell in any of the 8 straight directions (appending digits along the path and considering every prefix) and count those >10 that are prime; return the most frequent prime (tie broken by larger value) or -1 if none.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3044. Most Frequent Prime
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source