← Back

🔀 Adjacent Swap Maze

Search in Nearly Sorted Array

Target

-

Checking

-

Range

-

Steps

0
🔑 Key Insight
Each element may be at index i, i-1, or i+1. Check THREE positions: mid-1, mid, mid+1!
🔀 Nearly Sorted Array 🔀
L: -
M: -
R: -
Generate a nearly sorted array!

📖 Nearly Sorted Array Search

Property: Each element can be at its correct position OR swapped with adjacent element.

Solution: At each step, check mid-1, mid, and mid+1

Time: O(log n) — Still logarithmic!