Find all possible subarrays of an array and return it as a string

Asked Dec 06 '17 at 04:22

Active Dec 06 '17 at 04:23

Viewed 553 times

This was an interview problem and I'm curious about it.

For example, if you were given: {1,2}, You would expect:

[[1], [2]], [[1, 2]]

If you are given: {7,3,5}, you would expect:

[[7], [3], [5]],[[7, 3], [5]], [[7], [3, 5]], [[7, 3, 5]].

Order does not matter, as long as you include everything. How would you guys solve this?

I already tried making an arraylist of arraylists, and appending each list to a final string. Interviewer pushed me to solve part of this recursively, but I guess making the sublists doesn't have to be recursive, so I figure just adding everything together would be recursive.

edited Dec 06 '17 at 04:23

Jim Garrison

85,615
20
155
190

asked Dec 06 '17 at 04:22

Alim2

Well if he told you to use recursion it was probably easier that way, I'll think a bit about it and post back if I figure it out. – whatamidoingwithmylife Dec 06 '17 at 04:24
Check this out: https://stackoverflow.com/questions/4640034/calculating-all-of-the-subsets-of-a-set-of-numbers – whatamidoingwithmylife Dec 06 '17 at 04:31
1

Also this: http://www.ideserve.co.in/learn/generate-all-subsets-of-a-set-recursion – whatamidoingwithmylife Dec 06 '17 at 04:32
Instead of generating all possible subsets it should only generate adjacent subsets – Alim2 Dec 06 '17 at 05:03

Find all possible subarrays of an array and return it as a string

0 Answers0