Added 11 solutions

Java/Data Structures/Java Map/Solution.java

@@ -4,19 +4,20 @@
 
 import java.io.BufferedReader;
 import java.io.InputStreamReader;
+import java.io.IOException;
 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 Exception {
-        /* Read input and save as entries in a HashMap */
+    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.valueOf(br.readLine());
+        int n = Integer.parseInt(br.readLine());
         HashMap<String, Integer> map = new HashMap<>();
         while (n-- > 0) {
             String name = br.readLine();
-            int phone   = Integer.valueOf(br.readLine());
+            int phone   = Integer.parseInt(br.readLine());
             map.put(name, phone);
         }