|
|
|
|
|
|
by orangecat
1914 days ago
|
|
|
2. Determine whether a string has permutations which are palindromes. If I understand this correctly, it's the sort of problem that's simple if you see the trick and hard if you don't. I'd expect many candidates to think that you actually want them to generate all the permutations and then get bogged down in recursion. #1 is good, and #3 sounds interesting. |
|
|
Ideally the candidate should realize that this is computationally infeasible and quickly come up with a much more efficient solution, right? Perhaps they believe that this question filters out people who 1) don't have a feel for what is computationally feasible 2) will just dive into coding without spending 10 seconds to see if there's a significant optimization.