Easiest py sol ever, Beats 100% :)
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
```python3 []
class Solution:
    def constructArray(self, n: int, k: int) -> List[int]:
        arr = [i for i in range(1, n+1)]

        jvrc = []
        f, r = 0, k

        while f <= r:
            if f == r:
                jvrc.append(arr[f])
                break
            jvrc.append(arr[f])
            jvrc.append(arr[r])
            f += 1
            r -= 1

        jvrc.extend(arr[k+1:])
        
        return jvrc
```
['Python3']