.

Author: DhruvPasricha

Practice/.cph/.knapsack.cpp_fb96806726640782953e1b9c51dc4897.prob

@@ -0,0 +1 @@
+{"name":"Local: knapsack","url":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\knapsack.cpp","tests":[{"id":1617723537351,"input":"","output":""}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\knapsack.cpp","group":"local","local":true}

Practice/Digit DP/.cph/.Maximum Product.cpp_81a5c8a03f084d1b28ab18adf8868e42.prob

@@ -1 +1 @@
-{"name":"Local: Maximum Product","url":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Digit DP\\Maximum Product.cpp","tests":[{"id":1617679766823,"input":"1 10\n","output":"9\n"},{"id":1617679777541,"input":"51 62\n","output":"59"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Digit DP\\Maximum Product.cpp","group":"local","local":true}
+{"name":"Local: Maximum Product","url":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Digit DP\\Maximum Product.cpp","tests":[{"id":1617679766823,"input":"1 10\n","output":"9\n"},{"id":1617679777541,"input":"51 62","output":"59"}],"interactive":false,"memoryLimit":1024,"timeLimit":3000,"srcPath":"c:\\Users\\Dhruv\\myGithub\\Competitive-Programming\\Practice\\Digit DP\\Maximum Product.cpp","group":"local","local":true}

Practice/Digit DP/D_Magic_Numbers.cpp

@@ -0,0 +1,105 @@
+
+//------------------------------------------------------------------------------
+#include <iostream>
+#include <vector>
+// #include <bits/stdc++.h>
+// #include <cmath>
+// #include <algorithm>
+// #include <unordered_map>
+// #include <map>
+// #include <set>
+// #include <unordered_set>
+//------------------------------------------------------------------------------
+using namespace std;
+//------------------------------------------------------------------------------
+#define FastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
+#define v(Type) vector<Type>
+#define w(T)  \
+    int T;    \
+    cin >> T; \
+    while (T--)
+#define int long long int
+#define mod 1000000007ll
+#define endl "\n"
+//------------------------------------------------------------------------------
+// Any fucntion can be called using Math.function_name();
+//------------------------------------------------------------------------------
+class Math
+{
+public:
+    //Returns gcd of two numbers
+    int gcd(int a, int b)
+    {
+        return (a % b == 0) ? b : gcd(b, a % b);
+    }
+
+    //Returns lcm of two numbers
+    int lcm(int a, int b)
+    {
+        return a * (b / gcd(a, b));
+    }
+
+    // Returns flag array isPrime
+    // isPrime[i] = true (if i is Prime)
+    // isPrime[i] = false (if i is not Prime)
+    vector<bool> *seiveOfEratosthenes(const int N)
+    {
+        vector<bool> *isPrime = new vector<bool>(N + 1, true);
+        (*isPrime)[0] = (*isPrime)[1] = false;
+        for (int i = 2; i * i <= N; ++i)
+            if ((*isPrime)[i])
+                for (int j = i * i; j <= N; j += i)
+                    (*isPrime)[j] = false;
+
+        return isPrime;
+    }
+
+    //Returns (x ^ n)
+    int pow(const int &x, int n)
+    {
+        if (n == 0)
+            return 1;
+        int h = pow(x, n / 2);
+        return (n & 1) ? h * h * x : h * h;
+    }
+
+    //Returns (x ^ n) % M
+    int pow(const int &x, int n, const int &M)
+    {
+        if (n == 0)
+            return 1;
+        int h = pow(x, n / 2) % M;
+        return (n & 1) ? (h * h * x) % M : (h * h) % M;
+    }
+
+    //Returns all Primes <= N
+    vector<int> *primesUptoN(const int N)
+    {
+        vector<bool> *isPrime = seiveOfEratosthenes(N);
+        vector<int> *Primes = new vector<int>;
+        if (2 <= N)
+            (*Primes).push_back(2);
+        for (int i = 3; i <= N; i += 2)
+            if ((*isPrime)[i])
+                (*Primes).push_back(i);
+        return Primes;
+    }
+
+} Math;
+//------------------------------------------------------------------------------
+void solve()
+{
+    
+}
+//------------------------------------------------------------------------------
+int32_t main()
+{
+    FastIO;
+
+    // w(T)
+        solve();
+
+    return 0;
+}
+//------------------------------------------------------------------------------
+

Practice/knapsack.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+pair<int, string> dp[1000][1000];
+
+pair<int, string> solve(int A[], int W[], int n, int capacity)
+{
+    if (capacity == 0 or n == 0)
+        return {0, ""};
+    pair<int, string> temp = {-1, ""};
+    auto ans2 = solve(A, W, n - 1, capacity);
+    auto ans1 = (W[n - 1] <= capacity) ? solve(A, W, n - 1, capacity - W[n - 1]) : temp;
+    if (ans1 != temp)
+    {
+        ans1.first += A[n - 1];
+        ans1.second += "1";
+    }
+    ans2.second += "0";
+    auto ans = (ans1.first > ans2.first) ? ans1 : ans2;
+    if (ans1.first > ans2.first)
+    {
+        return ans1;
+    }
+    return ans2;
+}
+
+int main()
+{
+    int A[] = {100, 90, 70, 50, 40};
+    int W[] = {20, 21, 50, 54, 100};
+
+    int n = 5;
+    int capacity = 100;
+    auto ans = solve(A, W, n, capacity);
+
+    cout << ans.first << endl;
+    cout << ans.second << endl;
+}

README.md

@@ -7,6 +7,6 @@
 | ✅   | <strong>CodeChef   | ⭐⭐⭐⭐           | 134             | [<strong>Click Here](https://www.codechef.com/users/pasricha_dhruv)    |
 | ✅   | <strong>CodeForces | ⭐⭐             | 163             | [<strong>Click Here](https://codeforces.com/profile/pasricha_dhruv)    |
 | ✅   | <strong>HackerRank | ⭐⭐⭐⭐⭐⭐         | 139             | [<strong>Click Here](https://www.hackerrank.com/dhruv_pasricha?hr_r=1) |
-| ✅   | <strong>LeetCode   | ⭐⭐             | 120             | [<strong>Click Here](https://leetcode.com/pasricha_dhruv/)             |
+| ✅   | <strong>LeetCode   | ⭐⭐             | 126             | [<strong>Click Here](https://leetcode.com/pasricha_dhruv/)             |
 
 <hr>