what is the fastest way to find all the sub sequences of a given list in python?
for example
a=[1,2,2,3]
sub sequences of a are :-
[1],[2],[2],[3],[1,2],[1,2],[1,3],[2,3],[2,3],[2,2]
Asked
Active
Viewed 42 times
0
-
1Does this answer your question? [Find all possible sublists of a list](https://stackoverflow.com/questions/17061686/find-all-possible-sublists-of-a-list) – mkrieger1 Aug 15 '20 at 19:44
-
Thanks for sharing but I want to find all possible subsequences not sublists. – Vasavi Gandham Aug 16 '20 at 06:21
-
Did you try to write some code? What was the problem? – mkrieger1 Aug 16 '20 at 08:21
-
What about this: https://stackoverflow.com/questions/374626/how-can-i-find-all-the-subsets-of-a-set-with-exactly-n-elements – mkrieger1 Aug 16 '20 at 08:23