leetcode 2697

Author: Pankajcoder1

Codeforces/After Placement/150A-Win or Freeze.cpp

@@ -0,0 +1,42 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    long long n;
+    cin>>n;
+    for (long long i = 2; i * i <= n; i++)
+    {
+        if (n % i == 0)
+        {
+            long long temp = n / i;
+            for (long long j = 2; j * j <= temp; j++)
+            {
+                if (temp % j == 0)
+                {
+                    cout << 1 << endl
+                         << i * j << endl;
+                    return 0;
+                }
+            }
+            cout << 2;
+            return 0;
+        }
+    }
+    cout << 1 << endl
+         << 0;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1828A-Divisible Array.cpp

@@ -0,0 +1,29 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n;
+    cin >> n;
+
+    for (int i = 1; i <= n; i++)
+    {
+        cout << i * 2 << ' ';
+    }
+    cout << endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1828B-Permutation Swap.cpp.cpp

@@ -0,0 +1,51 @@
+/*
+    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> v(n);
+
+    for (int i = 0; i < n; i++)
+    {
+        cin >> v[i];
+        v[i]--;
+    }
+
+    vector<int> ds;
+
+    for (int i = 0; i < n; i++)
+    {
+        int d = abs(v[i] - i);
+        if (d == 0)
+            continue;
+        ds.push_back(d);
+    }
+
+    int ans = 1;
+    ans = ds[0];
+
+    for (auto x : ds)
+    {
+        ans = __gcd(ans, x);
+    }
+
+    cout << ans << endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1832A-New Palindrome.cpp

@@ -0,0 +1,31 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    string s;
+    cin>>s;
+    if (s.size() % 2) {
+        s.erase(s.begin() + s.size() / 2);
+    }
+    if (s != std::string(s.size(), s[0])) {
+        cout << "YES\n";
+    } else {
+        cout << "NO\n";
+    }
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/1832C-Contrast Value.cpp

@@ -0,0 +1,38 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n;
+    cin>>n;
+    int ans=0;
+    vector<int> a(n);
+    for(auto &x:a){
+        cin>>x;
+    }
+    a.resize(unique(a.begin(), a.end()) - a.begin());
+    n = (int)a.size();
+    for (int i = 0; i < n; i++)
+    {
+        if (i == 0 || i == n - 1 || (a[i]>a[i-1] && a[i]>a[i+1]) || (a[i]<a[i-1] && a[i]<a[i+1]))
+        {
+            ans += 1;
+        }
+    }
+    cout << ans << '\n';
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

…estore_the_Array_From_Adjacent_Pairs.cpp …estore_the_Array_From_Adjacent_Pairs.cppLeetCode/5665.Restore_the_Array_From_Adjacent_Pairs.cpp renamed to LeetCode/1743.Restore_the_Array_From_Adjacent_Pairs.cpp LeetCode/5665.Restore_the_Array_From_Adjacent_Pairs.cpp renamed to LeetCode/1743.Restore_the_Array_From_Adjacent_Pairs.cpp

@@ -0,0 +1,24 @@
+/*
+    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:
+    string makeSmallestPalindrome(string s)
+    {
+        int n=s.size();
+        for(int i=0;i<n/2;i++){
+            char ch=min(s[i],s[n-1-i]);
+            s[i]=ch;
+            s[n-1-i]=ch;
+        }
+        return s;
+    }
+};

LeetCode/2697.Lexicographically Smallest Palindrome.cpp

@@ -20,6 +20,7 @@ class Solution
         vector<vector<int>> ans{{r, c}};
         int size = rows * cols, len = 1;
         int x = r, y = c;
+        
         while (ans.size() < size)
         {
             for (int j = 1; j <= len; j++)