Array Patterns

1
import java.util.ArrayList;
2
import java.util.List;
3

4

5
public int[] fn(int[] arr) {
6
    int n = arr.length;
7
    int[] prefix = new int[n];
8
    prefix[0] = arr[0];
9

10
    for (int i = 1; i < n; i++) {
11
        prefix[i] = prefix[i - 1] + arr[i];
12
    }
13

14
    return prefix;
15
}

1
public int fn(int[] arr) {
2
    int n = arr.length;
3
    int window = 0;
4
    int left = 0;
5
    int ans = 0;
6

7
    for (int right = 0; right < arr.length; right++) {
8
        // TODO: add arr[right] to window
9

10
        while (WINDOW_CONDITION_BROKEN) {
11
            // TODO: remove arr[left] from window
12
            left++;
13
        }
14

15
        // TODO: update ans
16
    }
17

18
    return ans;
19
}

1
public String fn(char[] strs) {
2
    StringBuilder sb = new StringBuilder();
3

4
    for (char c: strs) {
5
        sb.append(c);
6
    }
7

8
    return sb.toString();
9
}

1
public int fn(int[] arr) {
2
    int ans = 0;
3
    int left = 0;
4
    int right = arr.length - 1;
5

6
    while (left < right) {
7
        // TODO: logic with left and right
8
        if (CONDITION) {
9
            left++;
10
        } else {
11
            right--;
12
        }
13
    }
14

15
    return ans;
16
}

1
public int fn(int[] arr1, int[] arr2) {
2
    int i = 0;
3
    int j = 0;
4
    int ans = 0;
5

6
    while (i < arr1.length && j < arr2.length) {
7
        // TODO: logic
8
        if (CONDITION) {
9
            i++;
10
        } else {
11
            j++;
12
        }
13
    }
14

15
    while (i < arr1.length) {
16
        // TODO: logic
17
        i++;
18
    }
19

20
    while (j < arr2.length) {
21
        // TODO: logic
22
        j++;
23
    }
24

25
    return ans;
26
}