leetcode 1416

Author: Pankajcoder1

Codeforces/After Placement/1821A-Matching.cpp

@@ -0,0 +1,38 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    string s;
+    cin>>s;
+    int n=s.size();
+    int ans=1;
+    if(s[0]=='?'){
+        ans=9;
+    }
+    else if(s[0]=='0'){
+        cout<<0<<endl;
+        return 0;
+    }
+    for(int i=1;i<n;i++){
+        if(s[i]=='?'){
+            ans*=10;
+        }
+    }
+    cout<<ans<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1821B-Sort the Subarray.cpp

@@ -0,0 +1,46 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n;
+    cin >> n;
+    vector<int> a(n), b(n);
+    for (auto &i : a){
+        cin >> i;
+    }
+    for (auto &i : b){
+        cin >> i;
+    }
+    int l = 0, r = n - 1;
+
+    while (a[l] == b[l]){
+        l++;
+    }
+    while (a[r] == b[r]){
+        r--;
+    }
+    while (l > 0 && b[l] >= b[l - 1]){
+        l--;
+    }
+    while (r < n - 1 && b[r] <= b[r + 1]){
+        r++;
+    }
+
+    cout << l + 1 << " " << r + 1 << endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/1416.Restore The Array.cpp

@@ -0,0 +1,46 @@
+class Solution
+{
+public:
+    long long stringToLongLong(string s)
+    {
+        long long num;
+        istringstream iss(s); // create a stringstream object from string s
+        iss >> num;           // extract the integer from the stringstream
+        return num;
+    }
+
+    int numberOfArrays(string s, int k)
+    {
+        int mod = 1e9 + 7;
+        int n = s.size();
+
+        // dp[i] stores the number of ways to split the substring s[0:i-1] into valid arrays
+        vector<long long> dp(n + 1,0);
+
+        // base case: dp[0] = 1 (empty string)
+        dp[0] = 1;
+
+        for (int i = 1; i <= n; i++)
+        {
+            long long num = 0;
+            for(int size=1;size<=i && size<=10;size++){
+                string temp=s.substr(i-size,size);
+                // cout<<"temp is "<<temp<<endl;
+                num=stringToLongLong(temp);
+                // cout<<"covering "<<i-1<<" to "<<i-size<<endl;
+                // cout<<"num is "<<num<<endl;
+                if(s[i-size]=='0'){
+                    continue;
+                }
+                if(num<=k){
+                    dp[i]=(dp[i]+dp[i-size])%mod;
+                }
+                else{
+                    break;
+                }
+            }
+        }
+
+        return dp[n];
+    }
+};