Design Neighbor Sum Service

Description

You are given n x n 2D array grid with distinct values in [0, n2 - 1]. Implement the NeighborSum class:

- NeighborSum(int [][]grid): initializes the object.

- int adjacentSum(int value): returns the sum of cells directly above, below, left, and right of the cell containing value.

- int diagonalSum(int value): returns the sum of diagonal neighbors of the cell containing value.

Code

class NeighborSum:

    def __init__(self, grid: List[List[int]]):
        

    def adjacentSum(self, value: int) -> int:
        

    def diagonalSum(self, value: int) -> int:
        


# Your NeighborSum object will be instantiated and called as such:
# obj = NeighborSum(grid)
# param_1 = obj.adjacentSum(value)
# param_2 = obj.diagonalSum(value)