Given a 2D array of characters grid of size m x n, you need to find if there exists any cycle consisting of the same value in grid.
A cycle is a path of length 4 or more in the grid that starts and ends at the same cell. From a given cell, you can move to one of the cells adjacent to it - in one of the four directions (up, down, left, or right), if it has the same value of the current cell.
Also, you cannot move to the cell that you visited in your last move. For example, the cycle (1, 1) -> (1, 2) -> (1, 1) is invalid because from (1, 2) we visited (1, 1) which was the last visited cell.
Return true if any cycle of the same value exists in grid, otherwise, return false.
 
Example 1:

Input: grid = [["a","a","a","a"],["a","b","b","a"],["a","b","b","a"],["a","a","a","a"]]
Output: true
Explanation: There are two valid cycles shown in different colors in the image below:


Example 2:

Input: grid = [["c","c","c","a"],["c","d","c","c"],["c","c","e","c"],["f","c","c","c"]]
Output: true
Explanation: There is only one valid cycle highlighted in the image below:


Example 3:

Input: grid = [["a","b","b"],["b","z","b"],["b","b","a"]]
Output: false

 
Constraints:

m == grid.length
n == grid[i].length
1 <= m <= 500
1 <= n <= 500
grid consists only of lowercase English letters.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    def containsCycle(self, grid: List[List[str]]) -> bool:\n        \n        return self.unionfind(grid)\n        \n        '''\n        self.grid = grid\n        self.m = len(grid)\n        self.n = len(grid[0])\n        self.visited = set()\n        \n        for i in range(self.m):\n            for j in range(self.n):\n                \n                if (i,j) not in self.visited:\n                    if self.bfs((i,j), (-1,-1)):\n                        return True\n        return False\n\n        '''\n                \n    def find(self, node):\n        if self.parent[node[0]][node[1]] == node:\n            return node\n        else:\n            p = self.find(self.parent[node[0]][node[1]])\n            self.parent[node[0]][node[1]] = p\n            return(p)\n    \n    def union(self, node1, node2):\n        \n        p1 = self.find(node1)\n        p2 = self.find(node2)\n        \n        if self.rank[p1[0]][p1[1]] > self.rank[p2[0]][p2[1]]:\n            self.parent[p2[0]][p2[1]] = p1\n        elif self.rank[p2[0]][p2[1]] > self.rank[p1[0]][p1[1]]:\n            self.parent[p1[0]][p1[1]] = p2\n        else:\n            self.parent[p1[0]][p1[1]] = p2\n            self.rank[p2[0]][p2[1]] += 1\n    \n    def unionfind(self,g):\n        \n        nrow, ncol = len(g), len(g[0])\n        \n        self.parent = []\n        self.rank = [[1]*ncol for _ in range(nrow)]\n        \n        for i in range(nrow):\n                self.parent.append([(i,j) for j in range(ncol)])\n        \n        for i in range(nrow):\n            for j in range(ncol):\n                \n                if i+1 < nrow and g[i][j] == g[i+1][j]:\n                    \n                    if self.find((i,j)) == self.find((i+1, j)):\n                        return True\n                    self.union((i,j), (i+1, j))\n                \n                if j+1 < ncol and g[i][j] == g[i][j+1]:\n                    if self.find((i,j)) == self.find((i, j+1)):\n                        return True\n                    self.union((i,j), (i, j+1))\n        return False\n        \n    \n    def cycle(self, current, parent):\n        \n        if current in self.visited:\n            return True\n        \n        self.visited.add(current)\n        i,j = current\n        neb = [(i+1,j), (i-1,j), (i, j+1), (i, j-1)]\n        \n        for ne in neb:\n            ni, nj = ne\n            if ne != parent and ni >= 0 and ni < self.m  and nj >=0 and nj < self.n and self.grid[ni][nj] == self.grid[i][j]:\n                #print(ne)\n                if self.cycle((ni, nj), current):\n                    return True\n        return False\n                \n    \n    def bfs(self, current, parent):\n        \n        if current in self.visited:\n            return True\n        \n        q = []\n        q.append((current, parent))\n        self.visited.add(current)\n        \n        while q:\n            \n            node, par = q.pop()\n            #print(node)\n            #print(par)\n            i,j = node\n            neb = [(i+1,j),(i-1,j), (i, j+1), (i,j-1)]\n            \n            for ni,nj in neb:\n                if ni >= 0 and ni < self.m and nj >=0 and nj < self.n and self.grid[ni][nj] == self.grid[i][j] and (ni, nj) != par:\n                    \n                    if (ni, nj) in self.visited:\n                        return True\n                    q.append(((ni,nj), (i,j)))\n                    self.visited.add((ni,nj))\n        return False\n                        \n            \n            \n            \n        \n                \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'containsCycle'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 10208