Added 10 solutions

Java/Data Structures/Java 2D Array/Solution.java

@@ -5,7 +5,7 @@
 import java.util.Scanner;
 
 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int arr[][] = new int[6][6];
         for (int row = 0; row < 6; row++) {

Java/Data Structures/Java Comparator/Solution.java

@@ -26,7 +26,7 @@ class Player {
 }
 
 class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         Scanner scan = new Scanner(System.in);
         int n = scan.nextInt();
 

Java/Data Structures/Java Dequeue/Solution.java

@@ -15,7 +15,7 @@ import java.util.HashMap;
 // Space Complexity: O(n)
 
 public class test {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
         HashMap<Integer, Integer> map = new HashMap<>();
         ArrayDeque<Integer> deque     = new ArrayDeque<>();
         

Java/Data Structures/Java Map/Solution.java

@@ -10,7 +10,7 @@ import java.util.HashMap;
 /* BufferedReader is used instead of Scanner since it's faster and
    won't time out on HackerRank test cases when using Java8 */
 class Solution {
-    public static void main(String [] args) throws IOException {
+    public static void main(String[] args) throws IOException {
         /* Save input as entries in a HashMap */
         BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         int n = Integer.parseInt(br.readLine());