News for hackers. Stuff that matters.
Re:How to win the coding interview by garrettgrimsley on Tuesday May 31, 2016 @01:21AM (#11804770)
>I'd also be impressed if they came up with the idea of sorting the string and counting characters

While that method would identify if a string has the necessary attributes of a palindromic string it is not sufficient to prove that a string is a palindrome.

>This is the person judging the candidates on whether they are talented enough at computer science? Yikes.

Right, anyone reading the OP would probably be better served by Steve Yegge's posts[0, 1] on the subject.

[0] https://sites.google.com/site/steveyegge2/five-essential-pho...

[1] http://steve-yegge.blogspot.com/2008/03/get-that-job-at-goog...

Edit: Went back and actually read the code provided, they only use regex for a preprocessing step.

Re:How to win the coding interview by p4wnc6 on Tuesday May 31, 2016 @09:23AM (#11806346)
You're totally right. I was confusing the stated problem with a common associated problem: whether a string is a permutation of a palindrome.