Java Best Solution 0ms 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int numberOfChild(int n, int k) {
       boolean backwards = false;
        int i = 0;
        int timer = 0;
        while(timer != k){
            if(i==n-1){
                backwards = true;
            }
            if(backwards && i == 0){
                backwards = false;
            }

            if(!backwards){
                i++;
            }else{
                i--;
            }

            timer++;
        }
        return i;
    }
}
```
['Java']