title: Triplet whose sum in range (1,2)
body: <blockquote>
    <p>Given <code>n</code> positive real numbers in an array, find whether there <em>exists</em> a triplet
    among this set such that, the sum of the triplet is in the range <code>(1,
    2)</code>. Do it in linear time and constant space.</p>
    
    <ul>
    <li>the array is not ordered.</li>
    <li>numbers are positive</li>
    <li>numbers are <strong>real numbers</strong> </li>
    </ul>
  </blockquote>
  
  <p>Any help would be greatly appreciated. Thanks.</p>