AbhinavBisht's blog

By AbhinavBisht, history, 2 years ago, In English

Given an array We need to find the count of all the elements in all the subarrays which are neither min nor max in that particular subarray

eg

4
30 47 19 23
ans = 4
i.e in 30 47 19 count is 1 --> 30 is netiher max nor min
    in 30 47 19 23 count is 2 --> 30 and 23 
    int 47 19 23 count is 1 --> 23 
3
11 20 17
ans = 1
We can have duplicate elements as input 

n = 10^5 // size of array

Full text and comments »

  • Vote: I like it
  • +8
  • Vote: I do not like it