add a solution for 79

fishercoder1534 · fishercoder1534 · commit 3dd8ae455d0e · 2021-10-07T11:33:37.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_79.java b/src/main/java/com/fishercoder/solutions/_79.java
@@ -88,7 +88,7 @@ private boolean search(char[][] board, int i, int j, String word, int index) {
 
     public static class Solution3 {
         /**
-         * I came up with below solution completely independelty on 10/7/2021, although space complexity is O(m*n) instead of constant.
+         * I came up with below solution completely independently on 10/7/2021, although space complexity is O(m*n) instead of constant.
          */
         public boolean exist(char[][] board, String word) {
             int m = board.length;
