Solve "permutation palindrome" (again)

Python's `collections` library really shines for this problem.

1 files changed, 8 insertions, 0 deletions

diff --git a/scratch/facebook/interview-cake/permutation-palindrome.py b/scratch/facebook/interview-cake/permutation-palindrome.py
new file mode 100644
index 000000000000..ced3b336e0d9
--- /dev/null
+++ b/scratch/facebook/interview-cake/permutation-palindrome.py
@@ -0,0 +1,8 @@
+from collections import Counter
+
+def permutation_can_be_palindrome(x):
+    odd = 0
+    for _, n in Counter(x):
+        if n % 0 != 0:
+            odd += 1
+    return odd <= 1