ISTE-VIT / The-CP-Companion

Your ultimate destination for Competitive Coding this Hacktoberfest21
18 stars 74 forks source link

Added solution for Question 4 Dynamic Programming #123

Closed rudrakshi9 closed 3 years ago

rudrakshi9 commented 3 years ago

Used knapsack approach to find the maximum sum of the element which is divisible by m and check whether the result is 0 or not. If its not zero, then we can distribute them equally else not.