You have been given a large set of numbers S,(say, a 1 million number array). Write code to find (a)One interesting set from it (b)All interesting sets from it. An interesting set S' is any subset of S having following two properties: 1. S' has exactly 30 elements 2. No other 30 element subset of S has the sum of its elements same as the sum of elements of S'
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/U7NpnSgd7FcJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
