diff --git a/16 Nov## Sum of Beauty of All Substrings b/16 Nov## Sum of Beauty of All Substrings
new file mode 100644
index 0000000..5e2d817
--- /dev/null
+++ b/16 Nov## Sum of Beauty of All Substrings	
@@ -0,0 +1,22 @@
+class Solution {
+  public:
+    int beautySum(string s) {
+        // Your code goes here
+        int res = 0, n = s.length();
+        for (int i = 0; i < n; i++) {
+            vector<int> dp(26);
+            for (int j = i; j < n; j++) {
+                dp[s[j] - 'a']++;
+                int a = 0, b = n;
+                for (int k = 0; k < 26; k++) {
+                    if (dp[k] > 0) {
+                        a = max(a, dp[k]);
+                        b = min(b, dp[k]);
+                    }
+                }
+                res += a - b;
+            }
+        }
+        return res;
+    }
+};