Fixed the "Word Search" java solution by removing the edge case check.

[lakshyajit165]

PR details

The current java solution for the Word Search problem includes an edge case check which is not correct(screenshots attached for reference).

RCA

---

Test case:

board = [["a"]]
word = "ab"

The check runs:

if (m == 1 && n == 1) {
    return board[0][0] == word.charAt(0);
}

and returns:

return 'a' == 'a'   → true

But the full word is "ab" — which obviously cannot be found in a 1×1 grid.
So we prematurely return true even though the full word doesn’t match.

Fix

---

The backtracking logic already handles single-cell boards correctly.