Added codes for 10 April

GeeksForGeeks/April/10-4-24/GFG.java

@@ -0,0 +1,44 @@
+//{ Driver Code Starts
+//Initial Template for Java
+import java.io.*;
+import java.util.*;
+
+class GFG
+{
+    public static void main(String args[])throws IOException
+    {
+        BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
+        int t = Integer.parseInt(read.readLine());
+        while(t-- > 0)
+        {
+            int N = Integer.parseInt(read.readLine());
+            String input_line[] = read.readLine().trim().split("\\s+");
+            int arr[]= new int[N];
+            for(int i = 0; i < N; i++)
+                arr[i] = Integer.parseInt(input_line[i]);
+
+            Solution ob = new Solution();
+            System.out.println(ob.findSingle(N, arr));
+        }
+    }
+}
+
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+class Solution
+{
+    static int findSingle(int n, int arr[])
+    {
+        // code here
+        int x = 0;
+        for (int i = 0; i < n; i++) 
+        {
+            x = x ^ arr[i];
+        }
+
+        return x;
+    }
+}

GeeksForGeeks/April/10-4-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)

LeetCode/April/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n * logn)
+Space complexity - O(n)

LeetCode/April/Solution.java

@@ -0,0 +1,24 @@
+class Solution 
+{
+    public int[] deckRevealedIncreasing(int[] deck) 
+    {
+        int n = deck.length;
+
+        Arrays.sort(deck);
+
+        Deque<Integer> dq = new ArrayDeque<>();
+        dq.addFirst(deck[n - 1]);
+
+        for (int i = n - 2; i >= 0; --i) 
+        {
+            dq.addFirst(dq.getLast());
+            dq.pollLast();
+            dq.addFirst(deck[i]);
+        }
+
+        for (int i = 0; i < n; ++i)
+            deck[i] = dq.pollFirst();
+
+        return deck;
+    }
+}