> First pass of Top Stack datastructure.
> Implemented by storing every item with a current max.
>> The problem with this is that it doubles the space usage.
>> TODO: Look at reducing space requirement.
> Palindrome first pass.
> Pointers based implementation as the code seemed to suggest C.
>> Pretty standard implementation.
>> TODO: Revisit documentation and perhaps cleanup.