Go(lang) Solution
go\nfunc maxSubsequence(nums []int, k int) []int {\n    dupe := make([]int, len(nums))\n    copy(dupe, nums)\n    sort.Ints(dupe)\n    \n    seen := make(map[in
```go\nfunc maxSubsequence(nums []int, k int) []int {\n    dupe := make([]int, len(nums))\n    copy(dupe, nums)\n    sort.Ints(dupe)\n    \n    seen := make(map[int]int, k)\n    \n    for _, val := range dupe[len(dupe) - k : ] {\n        seen[val]++\n    }\n    \n    ans := make([]int, 0, k)\n    \n    for _, val := range nums {\n        if v, ok := seen[val]; ok && v > 0 {\n            ans = append(ans, val)\n            seen[val]--\n        }\n    }    \n    \n         \n    return ans\n}\n```
['Go']