Request to add solutions for two binary search related questions

[nirmalya8]

Hey, I wanted to work on an issue related to binary search. I wanted to add solutions to two questions in JAVA. The questions are as follows.
Question 1.
Given an array, find out how many times it has to been rotated
from its initial sorted position.
Input-Output:
Eg. [11,12,15,18,2,5,6,8]
It has been rotated: 4 times
(One rotation means putting the first element to the end)

Question 2.
Given a SORTED array and an element, find the number of times it occurs in the array. Solve it in O(log N) time complexity
Input-Output:
Eg. [2,4,10,10,10,18,20]
Element: 10
Count: 3

Can I work on this issue?

[AlphaVS-76]

Hey! Can I work on this issue?

[nirmalya8]

I wanted to work on it @AlphaVS-76 . Let the maintainer respond.

[siriak]

Q2 is a binary search + some counting, we don't want to include that
As for Q1, what complexity algorithm do you propose? I'd be interested if it's faster than linear

[nirmalya8]

The complexity would be O(log N), which is why I said Binary Search. @siriak

[siriak]

Ok, you can create a PR for Q1

[nirmalya8]

Okay @siriak Thank You!

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.