Given an array of n integers, find the lexicographically smallest subsequence of length k.
Answers
Answered by
4
Answer:
A < B <... < Y < Z < a < b <.. < y < z
Similar questions