Merge pull request neetcode-gh#2901 from mdmzfzl/main

 Create: 2140-solving-questions-with-brainpower.c & 2466-count-ways-to-build-good-strings.c

Author: mdmzfzl

c/2140-solving-questions-with-brainpower.c

@@ -0,0 +1,18 @@
+long long mostPoints(int** questions, int questionsSize, int* questionsColSize) {
+    int n = questionsSize;
+    long long* dp = (long long*)malloc((n + 1) * sizeof(long long));
+    
+    for (int i = 0; i <= n; i++) {
+        dp[i] = 0;
+    }
+    
+    for (int i = n - 1; i >= 0; i--) {
+        int points = questions[i][0];
+        int jump = questions[i][1];
+        dp[i] = (points + dp[(jump + i + 1) < n ? (jump + i + 1) : n]) > dp[i + 1] ? (points + dp[(jump + i + 1) < n ? (jump + i + 1) : n]) : dp[i + 1];
+    }
+    
+    long long result = dp[0];
+    free(dp);
+    return result;
+}

c/2466-count-ways-to-build-good-strings.c

@@ -0,0 +1,26 @@
+int countGoodStrings(int low, int high, int zero, int one) {
+    int mod = 1000000007;
+    int* dp = (int*)malloc((high + 1) * sizeof(int));
+    
+    dp[0] = 1;
+    int res = 0;
+    
+    for (int i = 1; i <= high; ++i) {
+        dp[i] = 0;
+        
+        if (i >= zero) {
+            dp[i] = (dp[i] + dp[i - zero]) % mod;
+        }
+        
+        if (i >= one) {
+            dp[i] = (dp[i] + dp[i - one]) % mod;
+        }
+        
+        if (i >= low) {
+            res = (res + dp[i]) % mod;
+        }
+    }
+    
+    free(dp);
+    return res;
+}