*Hey Geeks, Sharing an Interesting Question here "Given an array of integers (+ive,-ive & 0 as well) , you have to tell number of ways you can select longest increasing sub-sequences of size k where k<=n(size of array) from that array , also print those sub-sequences. *
example 1 4 6 2 5 & k=3 Answer 1 4 6, 1 4 5, 1 2 5 so total way are 3 * * *Thanks Shashank Mani Computer Science Birla Institute of Technology Mesra* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/BX5X-I_WtBsJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
