Which leet code or hackerrank?

Fairly straight forward question.

So have a problem that requires me to work with a fixed sized grid, and return a grid values equal to the sum of all adjescent cells.

I was wondering if this is represented in any hackerrank or leetcode problem. My original thinking is some sort of breadth first or depth first but it doesn’t really require any path therefore probably rules these two out? Although it’s a fairly simple problem comparatively just wondering if it existed as a leetcode or hackerrank for reference.

Cheers