Easy Dart solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: 239ms\n\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: 142.40MB\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n\n    List<int> maxSubsequence(List<int> nums, int k) {\n    while (nums.length > k) {\n      nums.remove(nums.reduce((a, b) => a < b ? a : b));\n    }\n    return nums;\n  }\n}\n\n```
['Dart']