fix: all Deque interface with ArrayDeque implementation to Queue interface with LinkedList implementation

Author: Jer3myYu

java/Graphs/MatrixInfection.java

@@ -1,10 +1,10 @@
-import java.util.ArrayDeque;
-import java.util.Deque;
+import java.util.LinkedList;
+import java.util.Queue;
 
 public class MatrixInfection {
     public int matrixInfection(int[][] matrix) {
         int[][] dirs = new int[][]{{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
-        Deque<int[]> queue = new ArrayDeque<>();
+        Queue<int[]> queue = new LinkedList<>();
         int ones, seconds;
         ones = seconds = 0;
         // Count the total number of uninfected cells and add each infected 

java/Graphs/Prerequisites.java

@@ -1,6 +1,6 @@
-import java.util.ArrayDeque;
 import java.util.ArrayList;
 import java.util.HashMap;
+import java.util.LinkedList;
 import java.util.List;
 import java.util.Map;
 import java.util.Queue;
@@ -18,7 +18,7 @@ public boolean prerequisites(int n, int[][] prerequisites) {
             graph.get(prerequisite).add(course);
             inDegrees[course]++;
         }
-        Queue<Integer> queue = new ArrayDeque<>();
+        Queue<Integer> queue = new LinkedList<>();
         // Add all courses with an in-degree of 0 to the queue.
         for (int i = 0; i < n; i++) {
             if (inDegrees[i] == 0) {

java/Graphs/ShortestTransformationSequence.java

@@ -1,7 +1,7 @@
-import java.util.ArrayDeque;
-import java.util.Deque;
 import java.util.HashSet;
+import java.util.LinkedList;
 import java.util.List;
+import java.util.Queue;
 import java.util.Set;
 
 public class ShortestTransformationSequence {
@@ -14,7 +14,7 @@ public int shortestTransformationSequence(String start, String end, List<String>
             return 1;
         }
         String lowerCaseAlphabet = "abcdefghijklmnopqrstuvwxyz";
-        Deque<String> queue = new ArrayDeque<>();
+        Queue<String> queue = new LinkedList<>();
         Set<String> visited = new HashSet<>();
         queue.offer(start);
         visited.add(start);

java/Graphs/ShortestTransformationSequenceOptimized.java

@@ -1,7 +1,7 @@
-import java.util.ArrayDeque;
-import java.util.Deque;
 import java.util.HashSet;
+import java.util.LinkedList;
 import java.util.List;
+import java.util.Queue;
 import java.util.Set;
 
 public class ShortestTransformationSequenceOptimized {
@@ -13,9 +13,9 @@ public int shortestTransformationSequenceOptimized(String start, String end, Lis
         if (start == end) {
             return 1;
         }
-        Deque<String> startQueue = new ArrayDeque<>();
+        Queue<String> startQueue = new LinkedList<>();
         Set<String> startVisited = new HashSet<>();
-        Deque<String> endQueue = new ArrayDeque<>();
+        Queue<String> endQueue =  new LinkedList<>();
         Set<String> endVisited = new HashSet<>();
         startQueue.offer(start);
         startVisited.add(start);
@@ -46,7 +46,7 @@ public int shortestTransformationSequenceOptimized(String start, String end, Lis
 
     // This function explores the next level in the level-order traversal 
     // and checks if two searches meet.
-    private boolean exploreLevel(Deque<String> queue, Set<String> visited, Set<String> otherVisited, Set<String> dictionarySet) {
+    private boolean exploreLevel(Queue<String> queue, Set<String> visited, Set<String> otherVisited, Set<String> dictionarySet) {
         String lowerCaseAlphabet = "abcdefghijklmnopqrstuvwxyz";
         int size = queue.size();
         for (int j = 0; j < size; j++) {