title: is it possible to find all the triplets in the given array for the O (n) time?
body: <p>Given an array of numbers find all such triplets that satisfy the given condition.</p>
  
  <p>Condition: <code>a[i] &lt; a[j] &lt; a[k]</code> where <code>I &lt; j &lt; k</code>.</p>
  
  <p>it is possible to solve this problem in O (n) time?</p>
  
  <p>This is not home work !!!</p>