Search in rotated array, max sum non-adjacent, matrix adjacent check
Filed under WheelsEye
The question
Solve three coding questions: search an element in a sorted and pivoted array, find maximum sum such that no two elements are adjacent, and return true if a matrix has no two adjacent 1s in any direction.
No write-up yet. Related questions below have one.
Related WheelsEye questions
Collected from public candidate posts and coding forums. Updated Nov 2026.