Math, asked by mohanauligepal6045, 9 months ago

Given an array of n integers, find the lexicographically smallest subsequence of length k.

Answers

Answered by Anonymous
4

Answer:

A < B <... < Y < Z < a < b <.. < y < z

Similar questions