give me any hint how can i solve this problem using divide and conquer
Pair of roses problem
Hey @harshit,
For every rose you can find the other corresponding rose such that Deepak completely spends all his money.
You can also think of something better than Divide and conquer(think in terms of hastables 
)