Update Reverse First K Elements

Author: akshayavb99

Course 2 - Data Structures in JAVA/Lecture 10 - Queues/Reverse First K Elements

@@ -27,3 +27,45 @@ Sample Input 2:
 Sample Output 2:
 8 7 6 5 2 4 3
 */
+import java.util.LinkedList;
+import java.util.Queue;
+
+public class Solution {
+
+	public static Queue<Integer> reverseKElements(Queue<Integer> input, int k) 
+    {
+		//Your code goes here
+        if (input.size()>k)
+        {
+            k=k%input.size();
+        }
+        if (k==0 || k==1)
+        {
+            return input;
+        }
+        
+        reverseQueue(input,k);
+        
+        for (int i=0;i<input.size()-k;i++)
+        {
+            input.add(input.remove());
+        }
+        
+        return input;
+        
+	}
+    
+    public static void reverseQueue(Queue<Integer> input, int k) 
+    {
+		//Your code goes here
+        if (input.size()==0 || input.size()==1 || k==0)
+        {
+            return;
+        }
+        
+        int temp=input.remove();
+        reverseQueue(input,k-1);
+        input.add(temp);
+	}
+
+}