diff --git a/different-maximum-subset-sum.cpp b/different-maximum-subset-sum.cpp
new file mode 100644
index 0000000..f0fe63e
--- /dev/null
+++ b/different-maximum-subset-sum.cpp
@@ -0,0 +1,66 @@
+#include <bits/stdc++.h> 
+using namespace std; 
+int dp[1024]; 
+   
+// Function to create mask for every number 
+int get_binary(int u) 
+{ 
+    int ans = 0; 
+    while (u) { 
+        int rem = u % 10; 
+        ans |= (1 << rem); 
+        u /= 10; 
+    } 
+   
+    return ans; 
+} 
+   
+// Recursion for Filling DP array 
+int recur(int u, int array[], int n) 
+{ 
+    // Base Condition 
+    if (u == 0) 
+        return 0; 
+    if (dp[u] != -1) 
+        return dp[u]; 
+   
+    int temp = 0; 
+    for (int i = 0; i < n; i++) { 
+        int mask = get_binary(array[i]); 
+   
+        // Recurrence Relation 
+        if ((mask | u) == u) { 
+            dp[u] = max(max(0, 
+                    dp[u ^ mask]) + array[i], dp[u]); 
+        } 
+    } 
+   
+    return dp[u]; 
+} 
+   
+// Function to find Maximum Subset Sum 
+int solve(int array[], int n) 
+{ 
+    // Initialize DP array 
+    for (int i = 0; i < (1 << 10); i++) { 
+        dp[i] = -1; 
+    } 
+   
+    int ans = 0; 
+   
+    // Iterate over all possible masks of 10 bit number 
+    for (int i = 0; i < (1 << 10); i++) { 
+        ans = max(ans, recur(i, array, n)); 
+    } 
+   
+    return ans; 
+} 
+   
+// Driver Code 
+int main() 
+{ 
+    int array[] = { 22, 132, 4, 45, 12, 223 }; 
+    int n = sizeof(array) / sizeof(array[0]); 
+      
+    cout << solve(array, n); 
+}