title: O(n) of solution to solve boggle
body: <p>What is the best time complexity O(n) of a function that solves boggle, where the boggle board is n by n? </p>
  
  <p>I feel that it's <code>n^2</code> since for each character we must look at <code>2(n-1)</code> other characters. The interviewer argued that it's not <code>n^2</code> for an <code>O(1)</code> dictionary look-up.</p>