Python beats 99.33% short and straightforward solution
\n    def constructArray(self, n: int, k: int) -> List[int]:\n        l1 = list(range(1, n-k+1))\n        l2 = deque(range(n-k+1, n+1))\n        \n        sub =
```\n    def constructArray(self, n: int, k: int) -> List[int]:\n        l1 = list(range(1, n-k+1))\n        l2 = deque(range(n-k+1, n+1))\n        \n        sub = []\n\t\t# keep inserting the largest and smallest elements to fetch the required number\n\t\t# of unique differences\n        while l2:\n            if l2:\n                sub.append(l2.pop())\n            if l2:\n                sub.append(l2.popleft())\n            \n        return l1 + sub\n```
[]