FastPrep
Problem · Matrix

Replacing Val 🍓

Learn this problem
● EasyTwo SigmaINTERNOA

Problem statement

Sup 👋!

This time the agency will give you:

  • An int 2D arr
  • A position within the input 2D arr
  • A so called replacing val

    • What they want you to do:

    Replace the val at the starting position with the provided replacing val. Repeat this process for all positions connected to the starting position via sides with the same val as the starting position.

    Function

    replacingNum(replacingVal: int, arr: int[][], pos: int[]) → int[][]

    Examples

    Example 1

    replacingVal = 2arr = [[0, 1, 0, 0, 0], [1, 1, 1, 0, 0], [1, 1, 0, 0, 0], [0, 1, 0, 1, 0]]pos = [1, 2]return = [[0, 2, 0, 0, 0], [2, 2, 2, 0, 0], [2, 2, 0, 0, 0], [0, 2, 0, 1, 0]]
    No explanation is provided for now. For original prompt, pls refer source image.

    Constraints

  • Unknown for now 🤲

    • More Two Sigma problems

    drafts saved locally
    public int[][] replacingNum(int replacingVal, int[][] arr, int[] pos) {
    // write your code here (lc733 might help)
}
    replacingVal2
    arr[[0, 1, 0, 0, 0], [1, 1, 1, 0, 0], [1, 1, 0, 0, 0], [0, 1, 0, 1, 0]]
    pos[1, 2]
    expected[[0, 2, 0, 0, 0], [2, 2, 2, 0, 0], [2, 2, 0, 0, 0], [0, 2, 0, 1, 0]]
    checking account