1 1 6 bhi toh aara hai , jo sample case question mei given hai
Can somebody explain me the pseudo code of doing this?
agr array mei 2 baar 1 hai , toh use kar sakte hai shyd .
sir fir kaise hoga ye , aap bta hi do abh
@Muskan-Gupta-598128740703036
muskan ur code looks correct . there is some backend issue due to which i m not able to access test cases. once it will resolve i will tell where exacltly ur code is failing.
also u were right agar array me element 1 se jayda bar atta hai to use consider kar sakte hai
editorial solution
@Muskan-Gupta-598128740703036
muskan ur code is correct , it is giving correct ouput for all the test cases u are getting wrong vertict because of ordering.
it seems using string is not correct option. figure out how we can write comparator for tree set
these are the test cases
test case 0
15
78 7 62 28 73 68 94 88 65 61 59 21 92 4 97
90
output 0
4 21 65
7 21 62
28 62
test case 1
7
10 1 2 7 6 1 5
8
output 1
1 1 6
1 2 5
1 7
2 6
test case 2
15
57 79 16 3 83 70 78 14 5 8 36 51 47 93 72
86
output 2
3 5 8 70
3 5 78
3 36 47
3 83
5 8 16 57
5 14 16 51
8 78
14 72
16 70
test case 3
15
104 562 922 590 397 205 560 594 881 837 536 572 812 808 180
957
output 3
180 205 572
397 560
sir meine try kra net par seach karke , but nhi hora ki ese comparator kaise implement kru … 
@Muskan-Gupta-598128740703036
mein c++ ka TA hu, java meri primary language nahi hai isliye mujhe jayda deep me nahi pata java .
c++ ka code dekh lo approach same hi hai -> https://ide.codingblocks.com/s/192906
genarate all valid subset and print them in sorted order without repetetion
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.