Algorithm problem with array subsequences

Asked Aug 22 '21 at 21:29

Active Aug 22 '21 at 21:42

Viewed 24 times

I have an algorithm that I have been thinking for a solution, but I couldn't find a way to solve it.

Find all the subsequences of the array consisting of exactly N elements. For example, given array arr = [1,2,3,4], the subsequences consisting of N=3 elements are: [[1,2,3], [1,2,4], [1,3,4], [2,3,4]].

asked Aug 22 '21 at 21:29

myTest532 myTest532

1,815
1
19
48

1

Those aren't subsequences, they're subsets. – Barmar Aug 22 '21 at 21:33
@JonasWilms This is subsets, not permutations – Barmar Aug 22 '21 at 21:35
Sorry, that's how I got the problem description. Why was it closed? – myTest532 myTest532 Aug 22 '21 at 21:39
The solutions showed in other algorithms, doe snot have a condition for the size of the ```subsets``` – myTest532 myTest532 Aug 22 '21 at 21:40
1

@barmar true, I always mix up permutations and combinations :) – Jonas Wilms Aug 22 '21 at 21:40
@JonasWilms It's not combinations, either. It's subsets. – Barmar Aug 22 '21 at 21:42
1

@barmar all combinations of a set are also subsets of the set. "More formally, a k-combination of a set S is a subset of k distinct elements of S." – Jonas Wilms Aug 22 '21 at 21:43
@myTest532myTest532 The answer I linked to has that, I don't know why it was removed. – Barmar Aug 22 '21 at 21:43
@barmar sorry, I edited in parallel and overwrote your change. – Jonas Wilms Aug 22 '21 at 21:45
I got it. Thank you! – myTest532 myTest532 Aug 22 '21 at 22:11

Algorithm problem with array subsequences

0 Answers0