Best Solution Beats ✅100% --pkg
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nApproach is to traverse through the loop and if it reaches to the end of 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nApproach is to traverse through the loop and if it reaches to the end of the k then reverse it by using the codition (if pos==n-1 || pos==0)\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity : 0(k)\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int numberOfChild(int n, int k) {\n        int pos = 0;\n        int dir = 1;\n        for(int i=0;i<k;i++){\n            pos+=dir;\n            if(pos==n-1 || pos==0){\n                dir = -dir;\n            }\n        }\n        return pos;\n    }\n}\n```
['Java']