p118

Author: ashwanikumar04

AllQuestions.md

@@ -1870,7 +1870,7 @@ That is, generate() should return a tree whose size is unbounded but finite.
 
 Given a binary tree, return the level of the tree with minimum sum.
 
-## Problem-118:waxing_crescent_moon:
+## [Problem-118](src/main/java/in/ashwanik/dcp/problems/p91_120/p118):sunny:
 
 
 > This problem was asked by Google.

README.md

@@ -3,12 +3,12 @@ Solutions to the coding problems from [Daily coding problem](https://dailycoding
 
 ## For all questions, see [here](AllQuestions.md)
 
-## **Google (37)**
+## **Google (38)**
 | | | | | | | | | | | | | | | |
 |--|--|--|--|--|--|--|--|--|--|--|--|--|--|--|
 |[P1](src/main/java/in/ashwanik/dcp/problems/p1_30/p1)|[P3](src/main/java/in/ashwanik/dcp/problems/p1_30/p3)|[P8](src/main/java/in/ashwanik/dcp/problems/p1_30/p8)|[P14](src/main/java/in/ashwanik/dcp/problems/p1_30/p14)|[P17](src/main/java/in/ashwanik/dcp/problems/p1_30/p17)|[P18](src/main/java/in/ashwanik/dcp/problems/p1_30/p18)|[P20](src/main/java/in/ashwanik/dcp/problems/p1_30/p20)|[P23](src/main/java/in/ashwanik/dcp/problems/p1_30/p23)|[P24](src/main/java/in/ashwanik/dcp/problems/p1_30/p24)|[P26](src/main/java/in/ashwanik/dcp/problems/p1_30/p26)|[P31](src/main/java/in/ashwanik/dcp/problems/p31_60/p31)|[P35](src/main/java/in/ashwanik/dcp/problems/p31_60/p35)|[P37](src/main/java/in/ashwanik/dcp/problems/p31_60/p37)|[P42](src/main/java/in/ashwanik/dcp/problems/p31_60/p42)|[P44](src/main/java/in/ashwanik/dcp/problems/p31_60/p44)|
 |[P48](src/main/java/in/ashwanik/dcp/problems/p31_60/p48)|[P52](src/main/java/in/ashwanik/dcp/problems/p31_60/p52)|[P56](src/main/java/in/ashwanik/dcp/problems/p31_60/p56)|[P61](src/main/java/in/ashwanik/dcp/problems/p61_90/p61)|[P64](src/main/java/in/ashwanik/dcp/problems/p61_90/p64)|[P67](src/main/java/in/ashwanik/dcp/problems/p61_90/p67)|[P68](src/main/java/in/ashwanik/dcp/problems/p61_90/p68)|[P72](src/main/java/in/ashwanik/dcp/problems/p61_90/p72)|[P73](src/main/java/in/ashwanik/dcp/problems/p61_90/p73)|[P76](src/main/java/in/ashwanik/dcp/problems/p61_90/p76)|[P78](src/main/java/in/ashwanik/dcp/problems/p61_90/p78)|[P80](src/main/java/in/ashwanik/dcp/problems/p61_90/p80)|[P83](src/main/java/in/ashwanik/dcp/problems/p61_90/p83)|[P86](src/main/java/in/ashwanik/dcp/problems/p61_90/p86)|[P90](src/main/java/in/ashwanik/dcp/problems/p61_90/p90)|
-|[P94](src/main/java/in/ashwanik/dcp/problems/p91_120/p94)|[P100](src/main/java/in/ashwanik/dcp/problems/p91_120/p100)|[P104](src/main/java/in/ashwanik/dcp/problems/p91_120/p104)|[P108](src/main/java/in/ashwanik/dcp/problems/p91_120/p108)|[P111](src/main/java/in/ashwanik/dcp/problems/p91_120/p111)|[P113](src/main/java/in/ashwanik/dcp/problems/p91_120/p113)|[P115](src/main/java/in/ashwanik/dcp/problems/p91_120/p115)|
+|[P94](src/main/java/in/ashwanik/dcp/problems/p91_120/p94)|[P100](src/main/java/in/ashwanik/dcp/problems/p91_120/p100)|[P104](src/main/java/in/ashwanik/dcp/problems/p91_120/p104)|[P108](src/main/java/in/ashwanik/dcp/problems/p91_120/p108)|[P111](src/main/java/in/ashwanik/dcp/problems/p91_120/p111)|[P113](src/main/java/in/ashwanik/dcp/problems/p91_120/p113)|[P115](src/main/java/in/ashwanik/dcp/problems/p91_120/p115)|[P118](src/main/java/in/ashwanik/dcp/problems/p91_120/p118)|
 
 
 ## **Facebook (17)**

src/main/java/in/ashwanik/dcp/problems/p91_120/p118/Readme.md

@@ -0,0 +1,4 @@
+Given a sorted list of integers, square the elements and give the output in
+sorted order.
+
+For example, given [-9, -2, 0, 2, 3], return [0, 4, 4, 9, 81].

src/main/java/in/ashwanik/dcp/problems/p91_120/p118/Solution.java

@@ -0,0 +1,53 @@
+package in.ashwanik.dcp.problems.p91_120.p118;
+
+class Solution {
+
+    int[] sortArray(int[] array) {
+        if (array == null || array.length == 0) {
+            return array;
+        }
+
+        int negative = -1;
+
+        for (int index = 0; index < array.length; index++) {
+            if (array[index] < 0) {
+                negative = index;
+            }
+        }
+
+        int left = negative;
+
+        int right = negative + 1;
+
+
+        int[] result = new int[array.length];
+        int k = 0;
+        while (left >= 0 && right < array.length) {
+            int leftNumber = Math.abs(array[left]);
+            int rightNumber = Math.abs(array[right]);
+
+            if (leftNumber < rightNumber) {
+                result[k] = leftNumber * leftNumber;
+                left--;
+            } else {
+                result[k] = rightNumber * rightNumber;
+                right++;
+            }
+            k++;
+        }
+
+        while (left >= 0) {
+            result[k++] = array[left] * array[left];
+            left--;
+        }
+
+        while (right < array.length) {
+            result[k++] = array[right] * array[right];
+            right++;
+        }
+
+
+        return result;
+    }
+
+}

src/test/java/in/ashwanik/dcp/problems/p91_120/p118/SolutionTest.java

@@ -0,0 +1,14 @@
+package in.ashwanik.dcp.problems.p91_120.p118;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+
+public class SolutionTest {
+    @Test
+    void testSortArray() {
+        assertArrayEquals(new int[]{}, new Solution().sortArray(new int[]{}));
+        assertArrayEquals(new int[]{0, 4, 4, 9, 81}, new Solution().sortArray(new int[]{-9, -2, 0, 2, 3}));
+        assertArrayEquals(new int[]{0, 4, 4, 9, 81}, new Solution().sortArray(new int[]{0, 2, 2, 3, 9}));
+    }
+}