static int runTestCase(int casenum__) {
		switch (casenum__) {
		case 0: {
			String[] S = { "abcd", "abdc", "dabc", "bacd" };
			int expected__ = 1;

			return verifyCase(casenum__, expected__, new AnagramFree().getMaximumSubset(S));
		}
		case 1: {
			String[] S = { "abcd", "abac", "aabc", "bacd" };
			int expected__ = 2;

			return verifyCase(casenum__, expected__, new AnagramFree().getMaximumSubset(S));
		}
		case 2: {
			String[] S = { "aa", "aaaaa", "aaa", "a", "bbaaaa", "aaababaa" };
			int expected__ = 6;

			return verifyCase(casenum__, expected__, new AnagramFree().getMaximumSubset(S));
		}
		case 3: {
			String[] S = { "creation", "sentence", "reaction", "sneak", "star", "rats", "snake" };
			int expected__ = 4;

			return verifyCase(casenum__, expected__, new AnagramFree().getMaximumSubset(S));
		}

		// custom cases

		/*
		 * case 4: {
		 * String[] S = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new
		 * AnagramFree().getMaximumSubset(S));
		 * }
		 */
		/*
		 * case 5: {
		 * String[] S = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new
		 * AnagramFree().getMaximumSubset(S));
		 * }
		 */
		/*
		 * case 6: {
		 * String[] S = ;
		 * int expected__ = ;
		 *
		 * return verifyCase(casenum__, expected__, new
		 * AnagramFree().getMaximumSubset(S));
		 * }
		 */
		default:
			return -1;
		}
	}