Confilcting problems

.gitignore

@@ -1,2 +1,7 @@
 *.class
+.DS_Store
+.classpath
+.project
+AmazonProblems.iml
 
+*.json

src/geeksforgeeks/.vscode/launch.json

@@ -0,0 +1,178 @@
+{
+    "configurations": [
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - LongestUniqueSubstring",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.LongestUniqueSubstring"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - DesignTicTacToe",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.DesignTicTacToe"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - RomanToInteger",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.RomanToInteger"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MaxProductString",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MaxProductString"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - ReorganiseString",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.ReorganiseString"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - ValidParentheses",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.ValidParentheses"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - TwoSumClosestToZero",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.TwoSumClosestToZero"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - TrailingZeroes",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.TrailingZeroes"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - SpiralMatrix",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.SpiralMatrix"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - SnakeAndLadder",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.SnakeAndLadder"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - SerializeAndDeserialize",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.SerializeAndDeserialize"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - JumpsToReachEnd",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.JumpsToReachEnd"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - ReorderLogs",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.ReorderLogs"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - QueensAttackKing",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.QueensAttackKing"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - ProductExceptSelf",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.ProductExceptSelf"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - PrisonAfterNDays",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.PrisonAfterNDays"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - PrintParenthesis",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.PrintParenthesis"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - NextGreaterNumber",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.NextGreaterNumber"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MinimumSwapSortArray",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MinimumSwapSortArray"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MinimumDistanceBetweenTwoNumbers",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MinimumDistanceBetweenTwoNumbers"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MaximumSubstringWithKDistinctChar",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MaximumSubstringWithKDistinctChar"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MajorityVoting",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MajorityVoting"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - CountDistinctKSubString",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.CountDistinctKSubString"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - UrlEncode",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.UrlEncode"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - FirstMissingPositive",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.FirstMissingPositive"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MergeIntervals",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MergeIntervals"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - InorderSuccessorPredecessor",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.InorderSuccessorPredecessor"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - PalindromePartion",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.PalindromePartion"
+        },
+        {
+            "type": "java",
+            "name": "CodeLens (Launch) - MobileKeyPadCombinations",
+            "request": "launch",
+            "mainClass": "geeksforgeeks.MobileKeyPadCombinations"
+        }
+    ]
+}

src/geeksforgeeks/.vscode/settings.json

@@ -0,0 +1,9 @@
+{
+    "files.exclude": {
+        "**/.classpath": true,
+        "**/.project": true,
+        "**/.settings": true,
+        "**/.factorypath": true
+    },
+    "explorer.sortOrder": "modified"
+}

src/geeksforgeeks/AdvantageShuffle.java

@@ -0,0 +1,37 @@
+package geeksforgeeks;
+
+// the advantage of A with respect to B is the number of indices i for which A[i] > B[i].
+
+// Return any permutation of A that maximizes its advantage with respect to B.
+//Input: A = [12,24,8,32], B = [13,25,32,11]
+//Output: [24,32,8,12]
+// Input: A = [2,7,11,15], B = [1,10,4,11]
+// Output: [2,11,7,15]
+public class AdvantageShuffle {
+    public int[] advantageCount(int[] A, int[] B) {
+        Arrays.sort(A); 
+
+        PriorityQueue<Integer[]> pq= new PriorityQueue<>((a,b)->Integer.compare(b[0],a[0]));
+        for(int i=0;i<B.length;i++){
+            pq.offer(new Integer[]{B[i],i}); // add elements of B along with it's index to max queue
+        }
+        int[] result= new int[A.length]; // new placeholder for result;
+        int lo=0; int hi= A.length-1; // start and end index
+          //B is transformed to [32,25,13,11]
+         //A is transformed to  [8,12,24,32]
+        while(!pq.isEmpty()){
+            Integer[] temp= pq.poll();
+            int index=temp[1];
+            int val=temp[0];
+
+            if(A[hi]>val){ // if polled element is lesser thar A[hi], put A[hi] at index of
+                            // queued elements index, means, equal to B's current index we are putting 
+                            // a value greater that B's in result arrays
+                result[index]=A[hi--];
+            }else{
+                result[index]=A[lo++];
+            }
+        }
+        return result;
+    }
+}