Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 582 |

@rdakka | 534 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given an array **Arr[0 … N-1]** containing **N** positive integers, a subarray **Arr[i … j]** is bitonic if there is a **k** with **i <= k <= j** such that **A[i] <= Arr[i+1] <= ... <= Arr[k] >= Arr[k+1] >= ... A[j – 1] >= A[j]**. Write a function that takes an array and array length as arguments and returns the length of the maximum length bitonic subarray.

For Example: In array {20, 4, 1, 2, 3, 4, 2, 10} the maximum length bitonic subarray is {1, 2, 3, 4, 2} which is of length 5.

**Example 1:**

**Input:
**N = 6
Arr[] = {12, 4, 78, 90, 45, 23}
**Output:** 5
**Explanation:** In the given array,
bitonic subarray is 4 <= 78 <= 90
>= 45 >= 23.

**Example 2:**

**Input:
**N = 4
Arr[] = {10, 20, 30, 40}
**Output:** 4
**Explanation:** In the given array,
bitonic subarray is 10 <= 20 <=
30 <= 40.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **bitonic()** which takes the array of integers **arr **and **n**** **as parameters and returns an integer denoting the answer.

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

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

**Constraints:**

1 ≤ N ≤ 10^{5}

1 ≤ Arr[i] ≤ 10^{6}

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
Maximum length Bitonic Subarray

...