title: 2D Array Fibonacci Square - Java
body: <p>Write a method that finds a closed square path (a loop) within a matrix. The closed path should be clockwise, it can start at any point of the matrix (any element), and contain elements which form a Fibonacci series.</p>
  <pre><code>int[][] arr = {
      {4, 5, 2, 1, 1, 2, 7},
      {2, 4, 5, 21, 0, 3, 6},
      {4, 5, 2, 13, 8, 5, 7},
      {4, 5, 2, 1, 1, 2, 7},
  }
  </code></pre>
  <p>This for example should return true, because</p>
  <pre>
  1  1 2
  21 0 3
  13 8 5
  </pre>
  <p>forms a square I am looking for.</p>
  <p>I just can't quite get my head around an algorithm for this problem.</p>