leetcode 336 C

Author: Pankajcoder1

Codeforces/After Placement/1804A-Lame King.cpp

@@ -0,0 +1,33 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    int a, b;
+    cin >> a >> b;
+    a = abs(a);
+    b = abs(b);
+    int ans = 2 * min(a, b);
+    if (a != b)
+    {
+        ans += 2 * (abs(b - a)) - 1;
+    }
+    cout << ans << endl;
+
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    cin >> testCase;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}

LeetCode/2588.Count the Number of Beautiful Subarrays.cpp

@@ -0,0 +1,28 @@
+/*
+    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:
+    long long beautifulSubarrays(vector<int> &nums)
+    {
+        map<int, int> seen;
+        seen[0]++;
+        long long ans = 0;
+        int sum = 0;
+        for (int v : nums)
+        {
+            sum ^= v;
+            ans += seen[sum];
+            seen[sum]++;
+        }
+        return ans;
+    }
+};