Add SRM 621.

Author: junk0612

TopCoder/SRMs/SRM621/Div2_1000_MixingColors/MixingColors.java

@@ -0,0 +1,14 @@
+import java.util.*;
+public class MixingColors {
+
+	public int minColors(int[] colors) {
+		Arrays.sort(colors);
+		Set<Integer> set = new HashSet<Integer>();
+		int n = colors.length;
+		for(int i=0;i<n;i++){
+			
+		}
+		return 0;
+	}
+
+}

TopCoder/SRMs/SRM621/Div2_250_TwoWaysSorting/TwoWaysSorting.java

@@ -0,0 +1,20 @@
+public class TwoWaysSorting {
+
+	public String sortingMethod(String[] stringList) {
+		boolean length = true, lexicographically = true;
+		for (int i = 1; i < stringList.length; i++) {
+			length = length
+					&& (stringList[i - 1].length() < stringList[i].length());
+			lexicographically = lexicographically
+					&& (stringList[i - 1].compareTo(stringList[i]) < 0);
+		}
+		if (length && lexicographically)
+			return "both";
+		if (length)
+			return "lengths";
+		if (lexicographically)
+			return "lexicographically";
+		return "none";
+	}
+
+}

TopCoder/SRMs/SRM621/Div2_500_NumbersChallenge/NumbersChallenge.java

@@ -0,0 +1,22 @@
+import java.util.*;
+
+public class NumbersChallenge {
+
+	public int MinNumber(int[] S) {
+		List<Integer> result = new ArrayList<Integer>();
+		for (int i = 0; i < S.length; i++) {
+			int n = result.size();
+			for (int j = 0; j < n; j++) {
+				result.add(result.get(j) + S[i]);
+			}
+			result.add(S[i]);
+		}
+		Set<Integer> set = new HashSet<Integer>();
+		set.addAll(result);
+		int i = 1;
+		while (!set.add(i))
+			i++;
+		return i;
+	}
+
+}