title: How to find peak elements in an array when there are multiple peaks?
body: <p>For an array with single peak element, it could be done in o(logn) using binary search, however in case of multiple peak elements in an array what approach should we use ?</p>
  
  <p>---Putting some more information ----
  A peak element is something which is greater then it's neighbors for instance, look at the below array, </p>
  
  <p>[1,3,20,4,1,0,7,5,2]</p>
  
  <p>there are 2 peaks in it, 20 and 7. </p>
  
  <p>We need to design an algorithm to find the peak elements in this array. </p>