| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2099|[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2099.java)||Easy||

|2095|[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java)||Medium||

|2094|[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java)||Easy||

|2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java)||Medium||

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_2099 {

publicstaticclassSolution1 {

publicint[]maxSubsequence(int[]nums,intk) {

int[][]map =newint[nums.length][2];

for (inti =0;i <nums.length;i++) {

map[i][0] =nums[i];

map[i][1] =i;

}

Arrays.sort(map, (a,b) ->b[0] -a[0]);

int[][]arr =newint[k][2];

for (inti =0;i <k;i++) {

arr[i][0] =map[i][0];

arr[i][1] =map[i][1];

}

Arrays.sort(arr, (a,b) ->a[1] -b[1]);

int[]ans =newint[k];

for (inti =0;i <k;i++) {

ans[i] =arr[i][0];

}

returnans;

}

}

}