Merge pull request #1 from ankitgautam03/Problems

Leetcode Problems on Arrays and Strings

Author: ankit0313

Leetcode/JewelsAndStones.java

@@ -0,0 +1,17 @@
+//Problem Link:- https://leetcode.com/problems/jewels-and-stones/
+
+//Problem Solution in Java:
+
+class Solution {
+    public int numJewelsInStones(String jewels, String stones) {
+        int count=0;
+        for(int i=0;i<stones.length();i++){
+            for(int j=0;j<jewels.length();j++){
+                if(jewels.charAt(j) == stones.charAt(i)){
+                    count = count+1;
+                }
+            }
+        }
+        return count;
+    }
+}

Leetcode/SquaresOfSortedArray.java

@@ -0,0 +1,22 @@
+//Problem Link:- https://leetcode.com/problems/squares-of-a-sorted-array/
+
+//Solution Of the Problem:
+
+class Solution {
+    public int[] sortedSquares(int[] nums) {
+        for(int i=0;i<nums.length;i++){
+            nums[i] = nums[i]*nums[i];
+        }
+        for(int j=1;j<nums.length;j++){
+            int key = nums[j];
+            int k=j-1;
+            
+            while(k>=0 && nums[k]>key){
+                nums[k+1] = nums[k];
+                k=k-1;
+            }
+            nums[k+1] = key;
+        }
+        return nums;
+    }
+}

Leetcode/duplicateZeroes.java

@@ -0,0 +1,16 @@
+class Solution {
+    public void duplicateZeros(int[] arr) {
+        for(int i=0;i<arr.length;i++){  
+            if(arr[i] == 0){
+                for(int j=arr.length-1;j>=i+1;j--)    
+                {                    
+                    arr[j] = arr[j-1];            
+                }
+                i=i+1;
+            }
+        }
+        for(int i=0;i<arr.length;i++){
+            System.out.println(arr[i]);
+        }
+    }
+}