Skip to main content

1D Array (2)

Submission​

  • Latest: Dec 23, 2025.
  • Next: Dec 30, 2025.
  • Focus: Rotation.
  • Solve all of them without watching notes, tutorial, solution or anything but following timer.
    • Time 30-60 mins
    • Without watching anything
    • Take time, apply on paper first
    • Analysis the complexity
    • Brute Force -> Better -> Optimal
  • Just solve it by yourself.
  • If fail, try next day, don't take help.
  • If its still failed, read this document once vert carefully, then try again, don't watch tutorial, solution or anything else.
  • After completion of all, noted down the final learing in concepts.

Problem​

  1. Find X
  2. Lower Bound
  3. Upper Bound
  4. Search Insert Position
  5. Floor/Ceil
  6. First and Last Occurences
  7. Count Occurences
  8. Search in Rotated Sorted
  9. Search in Roated Sorted II
  10. Minimum in Rotated Sorted Array
  11. Count rotation
  12. Signle Element
  13. Find Peak Element