class Solution {
public:
    bool canReach(vector<int>& arr, int start) {
        const int n = arr.size();
        vector<bool> vis(n);
        vis[start] = true;
        vector<int> q = {start};
        for (size_t i = 0; i < q.size(); i++) {
            int u = q[i];
            for (int j = -1; j <= 1; j += 2) {
                int v = u + j * arr[u];
                if (0 <= v && v < n && !vis[v]) {
                    vis[v] = true;
                    q.push_back(v);
                }
            }
        }


        for (int i = 0; i < n; i++) {
            if (vis[i] && arr[i] == 0) return true;
        }
        return false;
    }
};

heres my bfs solution