-
Notifications
You must be signed in to change notification settings - Fork 617
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Count of rotation in a sorted array #1033
Comments
I'm a GSSOC'21 participant and I would like to work on this issue. |
@rudrakshi99 Kindly assign me this issue. |
Hey, Can you assign me this issue as no one is working on it. |
Hey @alkatrivedi kindly follow the guidelines #1153 |
Hi, |
@Rohan27s please review my pr |
Counting rotations in a sorted array---> fixes[#1033]
I would like to contribute to the above code in java. Kindly assign this to me. Thanks. |
In this, we are given a sorted array of n elements which has been rotated clockwise k number of times. Here we will output the number of times the given array has been rotated i.e., k.
Example -
Input:
n = 6
a[] = {6, 5, 4, 1, 2, 3}
Output: 3
Explanation: Since the sorted array is rotated 3 times.
I am a participant in GSSoC 2021. Can I work on this issue under GSSoC 2021? I would like to add the solution to this problem in c++.
The text was updated successfully, but these errors were encountered: