Not able to understand the logic for the question

#1

not able to understand the logic for the question.

#2

hellp @dipeshpandey2001

We create two arrays - ‘inc’ and ‘dec’

  1. inc[i] stores the length of increasing subarray till i.
  2. dec[i] stores the length of decreasing subarray starting from index i.
  3. Doing so gives us the length of increasing and decreasing subarray at each index in O(n) time.
  4. We calculate the length of the longest bitonic subarray by finding the maximum inc[i] + dec[i] - 1
  5. We subtract one since the current element at ith index is included in both the increasing and decreasing subarray lengths.

Algorithm

  1. Initialize inc[0] to 1 and dec[n-1] to 1
  2. Creating inc[] array
    a. Till end of the array ie, i=1 to n, if arr[i] > arr[i-1] then inc[i] = inc[i-1] + 1. else, inc[i] = 1
  3. Creating dec[] array
    a. From the end of the array ie, i = n-2 till i =0, if arr[i] > arr[i+1] then dec[i] = dec[i+1] +1 else, dec[i] = 1.
#3

not able to understand the question,can you pls explain it with the help of example

#4

okay understood;; and what changes will we make if we want in clockwise instead of anticlockwise?

#5

ignore the last meesage

#6

is it clear now?
…
…
…

#7

no not able to understand the question properly,as in what we have to do

#8

u need to find the maximum length of subarray [i…j] such that it is satisfies this

A[i] <= A[i + 1] … = A[k + 1] >= … A[j – 1] > = A[j].

bacially it is saying that the subarray should be like -
ss

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.