Search in Rotated Sorted Array - LeetCode 33 - Python

Поделиться
HTML-код
  • Опубликовано: 21 янв 2025

Комментарии • 5

  • @racecarjonny8460
    @racecarjonny8460 3 месяца назад +1

    Thank you. I finally understood the solution. You have explained it very well.

  • @harshav4704
    @harshav4704 Год назад +3

    Very well explained deepti. Understood really well.Keep up the good work deepti mam.👍🏻😀

  • @deepakjyoti8355
    @deepakjyoti8355 11 месяцев назад +1

    You are amazing Mam !

  • @rahulchowdhury9739
    @rahulchowdhury9739 6 месяцев назад

    why do we need to check if it is sorted?

  • @namandubey8348
    @namandubey8348 11 месяцев назад

    what if we intialize low= 0, high= nums.size()-1,
    and then jsut check wether nums[low]== target ot nums[high]== target if yes return the index and if not increment the low by 1 and decrease the high by 1