leetcode: added 977,1750

Author: Pankajcoder1

Diff for: LeetCode/1750.Minimum_Length_of_String_After_Deletion_Similar_Ends.cpp

@@ -0,0 +1,32 @@
+/*
+    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:
+    int minimumLength(string s)
+    {
+        int left = 0, right = s.size() - 1;
+
+        while ((left < right) and s[left] == s[right])
+        {
+            char ch = s[left];
+            while ((left <= right) and s[left] == ch)
+            {
+                left += 1;
+            }
+            while ((right >= left) and s[right] == ch)
+            {
+                right -= 1;
+            }
+        }
+        return right - left + 1;
+    }
+};

Diff for: LeetCode/977.Squares_of_a_Sorted_Array.cpp

@@ -0,0 +1,31 @@
+/*
+    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> sortedSquares(vector<int> &nums)
+    {
+        int n=nums.size();
+        vector<int> ans(n);
+        int first=0,second = n-1;
+        for(int i=n-1;i>=0;i--){
+            if(abs(nums[first])>=abs(nums[second])){
+                ans[i]=nums[first]*nums[first];
+                first++;
+            }
+            else{
+                ans[i]=nums[second]*nums[second];
+                second--;
+            }
+        }
+        return ans;
+    }
+};