title: Finding Maximum Value in an array
body: <p>One thousand(1000) elements are entered into an array (no memory constraints). As we know, while entering the elements we can update the max out of entered values by a check whenever we enter a value.</p>
  
  <p>But imagine if the position of max value is somewhere around 900 </p>
  
  <p>If I remove 200 elements from positions 800 to 1000,
  without doing any more comparisons, we should have the next max value.
  Will that mean while entering the data we should have a plan to organize the data in some way to get the max value out of the remaining data?</p>
  
  <p>Deleting and inserting will keep on happening, but we should have max value  updated in less time with less no of steps. (Using stacks might help is the clue that the interviewer gave me). Anyone please help me. </p>