2582. Pass the Pillow 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
    public int passThePillow(int n, int time) {
        // 1 -> 2 -> 3 -> 4 -> 3 -> 2 -> 1
        // when n = 4, time = time % (2n - 2)

        time %= (2 * n - 2);

        int i = 1;
        boolean sign = true;
        while (time > 0) {
            i = sign ? i + 1 : i - 1;
            if (i == n) {
                sign = false;
            }
            time--;
        }

        return i;
    }
}

References

2582. Pass the Pillow