Added more solutions

kanahaiya · kanahaiya · commit 83a4979b8667 · 2018-01-24T23:28:26.000+05:30
diff --git a/LeetCodeSolutions/EasyLevelSolutions/.classpath b/LeetCodeSolutions/EasyLevelSolutions/.classpath
@@ -12,7 +12,8 @@
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
 	</classpathentry>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/J2SE-1.5">
+	<classpathentry kind="src" path="src/main/resources"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.8">
 		<attributes>
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
diff --git a/LeetCodeSolutions/EasyLevelSolutions/.settings/org.eclipse.jdt.core.prefs b/LeetCodeSolutions/EasyLevelSolutions/.settings/org.eclipse.jdt.core.prefs
@@ -1,8 +1,8 @@
 eclipse.preferences.version=1
 org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
-org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.5
-org.eclipse.jdt.core.compiler.compliance=1.5
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
+org.eclipse.jdt.core.compiler.compliance=1.8
 org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
 org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
 org.eclipse.jdt.core.compiler.problem.forbiddenReference=warning
-org.eclipse.jdt.core.compiler.source=1.5
+org.eclipse.jdt.core.compiler.source=1.8
diff --git a/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/FindAnagramMappings.java b/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/FindAnagramMappings.java
@@ -0,0 +1,24 @@
+/**
+ * 
+ */
+package com.javaaid.solutions.easy.arrays;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class FindAnagramMappings {
+	public int[] anagramMappings(int[] A, int[] B) {
+		int len = A.length;
+		int a[] = new int[len];
+		for (int i = 0; i < len; i++) {
+			for (int j = 0; j < len; j++) {
+				if (A[i] == B[j]) {
+					a[i] = j;
+				}
+			}
+		}
+		return a;
+	}
+
+}
diff --git a/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/HammingDistance.java b/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/HammingDistance.java
@@ -0,0 +1,26 @@
+/**
+ * 
+ */
+package com.javaaid.solutions.easy.arrays;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class HammingDistance {
+	public int hammingDistance(int x, int y) {
+		int xor = x ^ y;
+		return countNoOf1s(xor);
+
+	}
+
+	private int countNoOf1s(int n) {
+		int count = 0;
+		while (n != 0) {
+			n = n & (n - 1);
+			count++;
+		}
+
+		return count;
+	}
+}
diff --git a/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/JudgeRouteCircle.java b/LeetCodeSolutions/EasyLevelSolutions/src/main/java/com/javaaid/solutions/easy/arrays/JudgeRouteCircle.java
@@ -0,0 +1,30 @@
+/**
+ * 
+ */
+package com.javaaid.solutions.easy.arrays;
+
+/**
+ * @author Kanahaiya Gupta
+ *
+ */
+public class JudgeRouteCircle {
+	public boolean judgeCircle(String moves) {
+		int n = moves.length();
+		int x = 0, y = 0;
+		for (int k = 0; k < n; k++) {
+			char ch = moves.charAt(k);
+			if (ch == 'L') {
+				x--;
+			} else if (ch == 'R') {
+				x++;
+			} else if (ch == 'U') {
+				y++;
+			} else if (ch == 'D') {
+				y--;
+			}
+
+		}
+		return x == 0 && y == 0;
+
+	}
+}
diff --git a/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/BigCountries.sql b/LeetCodeSolutions/EasyLevelSolutions/src/main/resources/BigCountries.sql
@@ -0,0 +1,4 @@
+# Write your MySQL query statement below
+SELECT NAME, POPULATION, AREA 
+FROM WORLD 
+WHERE AREA>3000000 OR POPULATION >25000000
