Solved problem 977 : Squares Of A Sorted Array

racoelhosilva · racoelhosilva · commit b09b8dfafa53 · 2023-12-19T09:16:05.000Z
diff --git a/README.md b/README.md
@@ -16,7 +16,7 @@
 
 ### Problems Solved
 
-| Total | 40 |
+| Total | 41 |
 |:---:|:---:|
 
 #### Search By Topic
@@ -40,13 +40,13 @@
 | Sliding Window | 1 |
 | Stack | 2 |
 | Tries | 0 |
-| Two Pointers | 3 |
+| Two Pointers | 4 |
 
 #### Search By Difficulty
 
 | Difficulty | Number |
 |:---|---:|
-| Easy | 39 |
+| Easy | 40 |
 | Medium | 1 |
 | Hard | 0 |
 
diff --git a/Two Pointers/Easy/977_SquaresOfASortedArray.cpp b/Two Pointers/Easy/977_SquaresOfASortedArray.cpp
@@ -0,0 +1,41 @@
+/* 
+ * Problem: 977 
+ * Name: Squares Of A Sorted Array
+ * Difficulty: Easy
+ * Topic: Two Pointers
+ * Link: https://leetcode.com/problems/squares-of-a-sorted-array/
+ */
+ 
+#include <bits/stdc++.h>
+using namespace std;
+
+//      Naive Approach
+// Time Complexity: O(n log n)
+// Space Complexity: O(1)
+vector<int> sortedSquaresSort(vector<int>& nums) {
+    for (int idx = 0; idx < nums.size(); idx++){
+        nums[idx] = nums[idx] * nums[idx];    
+    }
+    sort(nums.begin(), nums.end());
+    return nums;
+}
+
+//      Two Pointer Approach
+// Time Complexity: O(n)
+// Space Complexity: O(n)
+vector<int> sortedSquaresTwoPointers(vector<int>& nums) {
+    vector<int> result(nums.size());
+    int left = 0;
+    int right = nums.size()-1;
+    while (left <= right){
+        if (abs(nums[left]) > abs(nums[right])){
+            result[right - left] = nums[left] * nums[left];
+            left++;
+        }
+        else {
+            result[right - left] = nums[right] * nums[right];
+            right--;
+        }
+    }
+    return result;
+}
