Can you write on Advanced Binary Search and it's applications in different problems like finding the rotation count(pivot) in rotated sorted array or find pairs whose sum is already present in given array. BTW nice article. Thnx :)
Thanks for your inputs !! Rotation count is the first part of this problem, finding that pivot. And I have written about find pairs whose sum exists in the array here : dev.to/akhilpokle/2-ways-to-two-su...
If you have any interesting questions on your mind, please let me know : )
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Can you write on Advanced Binary Search and it's applications in different problems like finding the rotation count(pivot) in rotated sorted array or find pairs whose sum is already present in given array. BTW nice article. Thnx :)
Thanks for your inputs !! Rotation count is the first part of this problem, finding that pivot.
And I have written about find pairs whose sum exists in the array here :
dev.to/akhilpokle/2-ways-to-two-su...
If you have any interesting questions on your mind, please let me know : )