Recently took an Amazon OA for SDE II

One of them is https://leetcode.com/problems/strong-password-checker/
Other one is as follows:

Given an array of nums where each nums[i] is a packet
and a number k that represents number channels

return the maximum sum of the median if you were to fit these packats into k channels. For example

nums = [2, 2, 1, 5, 3]
k = 2

One solution would be to send packet {5} into one channel
and send {2, 2, 1, 3} into the other channel

which results in a max median of 5 + (2 + 2)/2 = 7

if answer is floating, round to next largest int.

Is there a similar problem for this one ?