Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@manmeetkaur18102000 | 202 |

Complete Leaderboard |

Given an ascending sorted rotated array **Arr **of distinct integers of size **N**. The array is right rotated **K** times. Find the value of **K**.

**Example 1:**

**Input:
**N = 5
Arr[] = {5, 1, 2, 3, 4}
**Output:** 1
**Explanation:** The given array is 5 1 2 3 4.
The original sorted array is 1 2 3 4 5.
We can see that the array was rotated
1 times to the right.

**Example 2:**

**Input:
**N = 5
Arr[] = {1, 2, 3, 4, 5}
**Output:** 0
**Explanation:** The given array is not rotated.

**Your Task:**

Complete the function **findKRotation()** which takes array **arr** and size **n**, as input parameters and returns an integer representing the answer. You don't to print answer or take inputs.

**Expected Time Complexity:** O(log(N))

**Expected Auxiliary Space:** O(1)

**Constraints:**

1 <= N <=10^{5}

1 <= Arr_{i} <= 10^{7}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Rotation

...