*Note* This competition is always going to be available, but will be unpinned by January 15th.

Easy problem:

Given a set of integers represented as an array, print all the possible subsets of the set.

Example:

Input: {1, 2, 3}

Output:

[1, 2, 3]

[1, 2]

[1, 3]

[1]

[2, 3]

[2]

[3]

[]

Medium problem:

Given a string of characters, your job is to find a permutation of the string such that it is a palindrome, if more than one palindrome can be found, return the smallest one lexicographically. If no palindromes can be constructed, return "NOT FOUND".

examples:

Input:

"ABBAC"

Output:

"ABCBA"

Input:

"AB"

Output:

"NOT FOUND"

Hard Problem:

Document Distance

This is an easy problem if implemented a certain way compared to other potential ways. There are efficient methods and non-efficient methods of doing this. I have two documents attached - lewis.txt and Tom Sawyer.txt. Try to compare the Document Distance of these two files in the most efficient method possible.

You can find the methodology and information on Document Distance here:

http://www.andrew.cm...stance/lab.html

This process should take no longer than a minute or two to calculate.

Text files:

lewis.txt

**(1007.29K)**

Number of downloads: 172

Tom Sawyer.txt

**(390.07K)**

Number of downloads: 1399

Good Luck!

_{If you have any ideas or suggestions for future challenges, feel free to PM me with it.}

This post has been edited by **Dogstopper**: 31 December 2010 - 08:13 PM