biweekly 102

Author: Pankajcoder1

Codeforces/After Placement/1820A-Yura's New Name.cpp

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

LeetCode/2639.Find the Width of Columns of a Grid.cpp

@@ -0,0 +1,34 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    vector<int> findColumnWidth(vector<vector<int>> &grid)
+    {
+        vector<int> ans;
+        int n=grid.size();
+        int m=grid[0].size();
+        for(int j=0;j<m;j++){
+            int maxo=0;
+            for(int i=0;i<n;i++){
+                int len = 0;
+                if(grid[i][j]<0){
+                    len++;
+                }
+                string temp=to_string(abs(grid[i][j]));
+                len+=temp.size();
+                maxo = max(maxo, len);
+            }
+            ans.push_back(maxo);
+        }
+        return ans;
+    }
+};

LeetCode/2640.Find the Score of All Prefixes of an Array.cpp

@@ -0,0 +1,30 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    vector<long long> findPrefixScore(vector<int> &nums)
+    {
+        vector<long long> ans;
+        long long maxo=0;
+        for(int i=0;i<nums.size();i++){
+            if(i==0){
+                maxo=nums[i];
+                ans.push_back(nums[i]*2);
+            }
+            else{
+                maxo=max(maxo,(long long)nums[i]);
+                ans.push_back(ans.back()+(nums[i]+maxo));
+            }
+        }
+        return ans;
+    }
+};

LeetCode/2641.Cousins in Binary Tree II.cpp

@@ -0,0 +1,76 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution
+{
+public:
+    
+    TreeNode *replaceValueInTree(TreeNode *root)
+    {
+        
+        queue<TreeNode*> q;
+        TreeNode *dummy = root;
+        root->val=0;
+        q.push(dummy);
+        while(q.size()){
+            queue<TreeNode*> temp;
+            map<TreeNode *, int> m;
+            while(q.size()){
+                if(q.front()->left!=nullptr){
+                    temp.push(q.front()->left);
+                    m[q.front()] += q.front()->left->val;
+                }
+                if(q.front()->right!=nullptr){
+                    temp.push(q.front()->right);
+                    m[q.front()] += q.front()->right->val;
+                }
+                q.pop();
+            }
+            int sum=0;
+            for(auto x:m){
+                sum+=x.second;
+            }
+            for(auto x:m){
+                int temp2=0;
+                if(x.first->left!=nullptr){
+                    temp2+=x.first->left->val;
+                }
+                if (x.first->right != nullptr)
+                {
+                    temp2 += x.first->right->val;
+                }
+                temp2=sum-temp2;
+                if (x.first->left != nullptr)
+                {
+                    x.first->left->val=temp2;
+                }
+                if (x.first->right != nullptr)
+                {
+                    x.first->right->val = temp2;
+                }
+            }
+                
+            q=temp;
+        }
+        
+        return root;
+    }
+};