pixeloution

  * 68% of "Computer Programmers" older than age 35,
  * 45% of "Computer Programmers" above age 45. 
  * 29% of "Web Developers" above age 45

    private static void rangeCheck(int arrayLen, int fromIndex, int toIndex {
         if (fromIndex > toIndex)
              throw new IllegalArgumentException("fromIndex(" + fromIndex +
                   ") > toIndex(" + toIndex+")");
         if (fromIndex < 0) 
              throw new ArrayIndexOutOfBoundsException(fromIndex);
         if (toIndex > arrayLen) 
              throw new ArrayIndexOutOfBoundsException(toIndex);
    }

    * how a B-Tree index is structured (and how that affects range queries, and wildcard queries)
    * how a query uses a single index per table, or can create a merge index
    * how a covering index increases performance
    * how composite indexes affect queries, why you don't need an index on both (col-a) and (col-a, col-b)

  Diceware, 6 words          2.2 x 10^23
  Diceware, 5 words          2.8 x 10^19
  Diceware, 4 words          3.6 x 10^15
  a-zA-Z0-9, symbols, 10     4.3 x 10^19
  a-zA-Z0-9, 10char          8.4 x 10^17
  a-zA-Z0-9, 8char           2.2 x 10^15

  * People contribute between 0 to X% to a 401k. 
    This couldn't be deduced from take-home.
  * Many companies have a Employee Stock Purchase Program, 
    which is deducted from payroll.
  * Some (Many?) programmers get a large chunk of 
    compensation in options or RSUs.