JobsJob TrackerJob alerts

WheelsEye ยท 8 questions

All 8Coding 8
  • Minimum Magician Tricks for Ordering Wise and Strong PeopleCoding
  • Sum of Values with Different Parity from IndexCoding
  • Lexicographically Smallest String Based on Substring ConditionsCoding
  • Search a 2D MatrixCoding
  • Search in rotated array, max sum non-adjacent, matrix adjacent checkCoding
  • Candies distribution, tree split edge, queue using stacksCoding
  • Implement Map, sort stack, and largest sum subarrayCoding
  • Sliding window maximum, egg dropping puzzle, and jail puzzleCoding
โ† WheelsEye questions
  1. Interview questions
  2. WheelsEye
  3. Search in rotated array, max sum non-adjacent, matrix adjacent check
Coding

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

  • Minimum Magician Tricks for Ordering Wise and Strong People
  • Sum of Values with Different Parity from Index
  • Lexicographically Smallest String Based on Substring Conditions
  • Candies distribution, tree split edge, queue using stacks
  • Implement Map, sort stack, and largest sum subarray
โ† Search a 2D MatrixCandies distribution, tree split edge, queue using stacks โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.