leetcode biweekly 93

Author: Pankajcoder1

Atcoder/ABC/abc281A-Count Down.cpp

@@ -0,0 +1,43 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+
+int solve(){
+    int n;
+    cin>>n;
+    for(int i=n;i>=0;i--){
+        cout<<i<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    long long testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

Atcoder/ABC/abc281B-Sandwich Number.cpp

@@ -0,0 +1,51 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+int solve()
+{
+    string s;
+    cin>>s;
+    if(s.size()==8){
+        if(s[0]>='A' && s[0]<='Z' && s[7]>='A' && s[7]<='Z' && s[1]>='1' && s[1]<='9' && s[2]>='0' && s[2]<='9' && s[3]>='0' && s[3]<='9' && s[4]>='0' && s[4]<='9' && s[5]>='0' && s[5]<='9' && s[6]>='0' && s[6]<='9'){
+            cout<<"Yes"<<endl;
+        }
+        else{
+            cout<<"No"<<endl;
+        }
+    }
+    else{
+        cout<<"No"<<endl;
+    }
+    return 0;
+}
+int main()
+{
+    long long testCase = 1;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */

Atcoder/ABC/abc281C-Circular Playlist.cpp

@@ -0,0 +1,61 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+int solve()
+{
+    long long n, t;
+    cin>>n>>t;
+    vector<long long> v(n);
+    long long sum=0;
+    for (long long i = 0; i < n; i++)
+    {
+        cin >> v[i];
+        sum+=v[i];
+    }
+    t%=sum;
+    if(t==0){
+        cout<<n<<" "<<v[n-1]<<endl;
+    }
+    for(long long i=0;i<n;i++){
+        if(t<=v[i]){
+            cout<<i+1<<" "<<t<<endl;
+            break;
+        }
+        else{
+            t-=v[i];
+        }
+    }
+
+    return 0;
+}
+int main()
+{
+    long long testCase = 1;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */

LeetCode/2496. Maximum Value of a String in an Array.cpp

@@ -0,0 +1,61 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+// Experience :
+// Cp is nothing but only observation and mathematics.
+
+
+//Add main code here
+
+class Solution
+{
+public:
+    int maximumValue(vector<string> &strs)
+    {
+        int maxo=0;
+        for(auto x:strs){
+            bool flag=false;
+            for(auto y:x){
+                if(y>='a' && y<='z'){
+                    flag=true;
+                    break;
+                }
+            }
+            if(flag){
+                maxo=max(maxo,(int)x.size());
+            }
+            else{
+                maxo=max(maxo,(int)stoi(x));
+            }
+        }
+        return maxo;
+
+    }
+};
+
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/

LeetCode/2497. Maximum Star Sum of a Graph.cpp

@@ -0,0 +1,61 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll;
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF = 1e18;
+const ll mod1 = 1e9 + 7;
+const ll mod2 = 998244353;
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+// Experience :
+// Cp is nothing but only observation and mathematics.
+
+// Add main code here
+
+class Solution
+{
+public:
+    int maxStarSum(vector<int> &vals, vector<vector<int>> &edges, int k)
+    {
+        int n = vals.size();
+
+        vector<vector<int>> graph(n + 1);
+        int maxo = INT_MIN;
+
+        for (auto x : edges)
+        {
+            graph[x[0]].push_back(vals[x[1]]);
+            graph[x[1]].push_back(vals[x[0]]);
+        }
+        for(int i=0;i<n;i++){
+            sort(graph[i].begin(),graph[i].end(),greater<int>());
+            int sum=0;
+            sum=vals[i];
+            for(int j=0;j<k&&j<graph[i].size();j++){
+                sum+=max(0,graph[i][j]);
+            }
+            maxo=max(maxo,sum);
+        }
+        return maxo;
+    }
+};
+
+/* -----------------END OF PROGRAM --------------------*/
+/*
+ * stuff you should look before submission
+ * constraint and time limit
+ * int overflow
+ * special test case (n=0||n=1||n=2)
+ * don't get stuck on one approach if you get wrong answer
+ */