PalendromeFind.txt

Given a string of random characters, write code that will find the longest palendrome.

Example input:
  GHDUFNEICJSODLFJGHFYDNDJSKDNCHFGEJDBDJEGFHCNDKYATRSMZPLOBSRQNSB

Extra credit:
Please analyze the runtime of your solution. Can you improve on it?


Notes:

With emphasis on the "longest" palendrome one idea would be first to start spliting the string and looking for long palendromes.

What is a palendrome?
http://en.wikipedia.org/wiki/Palindrome

challenges:
- is the string a palendrome?
- strategy for evaluating sub strings in a large string
- generate randome stings
- what if the string was larger than what could fit in RAM?
- profile

examples:

ABBA
CDC
ABCDEFGFEDCBA

notice that you don't start recognizing the palendrome until the mirror starts

idea: to start in the middle of the string and work your way towards the ends
idea: start with len of string, decrement and shift the sub string across the entire string.

idea: why not just reverse the entire string and compare it against itself... for large strings this would mean double memory? splitting the string first means less ops in the reverse?

if the string is too large to fit in memory, we could build a hash of the chars as they are read off disk then compare the hashes.

how should multiples be handled?
do we always just return the first largest or should we continue checking for others of the same size?

profile:
how many slots will need to be evaluated for each test string?