title: Find if there is an element repeating itself n/k times
body: <p>You have an array size <code>n</code> and a <em>constant</em> <code>k</code> (whatever)</p>
  
  <p>You can assume the the array is of int type (although it could be of any type)</p>
  
  <p>Describe an algorithm that finds if there is an element(s) that repeats itself at least <code>n/k</code> times... if there is return one. Do so in linear time (<code>O(n)</code>)</p>
  
  <p>The catch: do this algorithm (or even pseudo-code) using constant memory and running over the array only twice</p>