Ttykuu

How do I deal with an unproductive colleague in a small company?

pgfplots: How to draw exponential graph with 60° start angle?

How do I gain back my faith in my PhD degree?

Why were 5.25" floppy drives cheaper than 8"?

Processor speed limited at 0.4 GHz

Where would I need my direct neural interface to be implanted?

What's the in-universe reasoning behind sorcerers needing material components?

Ambiguity in the definition of entropy

Have there been efforts to prevent length extension attacks of hashing algorithms that are based on the Merkle–Damgård construction?

Am I breaking OOP practice with this architecture?

What factors affect how many moons a planet can have?

Could the museum Saturn V's be refitted for one more flight?

Venezuelan girlfriend wants to travel the USA to be with me. What is the process?

How to tell a function to use the default argument values?

How would I stat a creature to be immune to everything but the Magic Missile spell? (just for fun)

Why can't we play rap on piano?

Probability that a draw from a normal distribution is some number greater than another draw from the same distribution

Is it a bad idea to plug the other end of ESD strap to wall ground?

Should I tell management that I intend to leave due to bad software development practices?

How can I deal with my CEO asking me to hire someone with a higher salary than me, a co-founder?

Forgetting the musical notes while performing in concert

Why do bosons tend to occupy the same state?

Detention in 1997

Software update wants to install Command Line Tools. Why? I have no Xcode installed

Determine whether any permutation of a string is a palindrome

Equivalent binary trees (A Tour of Go)Finding if sequential numbers for total existsCoconut, Sailors, and MonkeysTest if a string is a palindromeJava Brute-Force Algorithms HomeworkWord Pattern challenge in LeetCodeFinding an increasing sequence from a given array in a time-efficient manner in PythonDetermine whether any permutation of a given array exists such that the sum of all subarrays of length K are equalFind out whether string A can be shifted to get string BPermCheck Codility

0

$begingroup$

The task:

Given a string, determine whether any permutation of it is a
palindrome.

For example, "carrace" should return true, since it can be rearranged to
form "racecar", which is a palindrome. "daily" should return false, since
there's no rearrangement that can form a palindrome.

My solution:

const isPalindrome = str => 
 const letterOccurrences = str
 .split("")
 .reduce((acc, x) => 
 acc[x] = acc[x] ? acc[x] + 1 : 1;
 return acc;
 , );

 let numberOfOddOccurrences = 0;
 const isMaxOneOddNumberLetter = x => x % 2 === 0 ?
 true : ++numberOfOddOccurrences <= 1;
 return Object.values(letterOccurrences).every(isMaxOneOddNumberLetter);
;

console.log(isPalindrome("carerace"));

javascript algorithm programming-challenge functional-programming

share|improve this question

asked 16 mins ago

thadeuszlaythadeuszlay

732316

$endgroup$

add a comment | 

0

$begingroup$

The task:

Given a string, determine whether any permutation of it is a
palindrome.

For example, "carrace" should return true, since it can be rearranged to
form "racecar", which is a palindrome. "daily" should return false, since
there's no rearrangement that can form a palindrome.

My solution:

const isPalindrome = str => 
 const letterOccurrences = str
 .split("")
 .reduce((acc, x) => 
 acc[x] = acc[x] ? acc[x] + 1 : 1;
 return acc;
 , );

 let numberOfOddOccurrences = 0;
 const isMaxOneOddNumberLetter = x => x % 2 === 0 ?
 true : ++numberOfOddOccurrences <= 1;
 return Object.values(letterOccurrences).every(isMaxOneOddNumberLetter);
;

console.log(isPalindrome("carerace"));

javascript algorithm programming-challenge functional-programming

share|improve this question

asked 16 mins ago

thadeuszlaythadeuszlay

732316

$endgroup$

add a comment | 

$begingroup$

The task:

Given a string, determine whether any permutation of it is a
palindrome.

For example, "carrace" should return true, since it can be rearranged to
form "racecar", which is a palindrome. "daily" should return false, since
there's no rearrangement that can form a palindrome.

My solution:

const isPalindrome = str => 
 const letterOccurrences = str
 .split("")
 .reduce((acc, x) => 
 acc[x] = acc[x] ? acc[x] + 1 : 1;
 return acc;
 , );

 let numberOfOddOccurrences = 0;
 const isMaxOneOddNumberLetter = x => x % 2 === 0 ?
 true : ++numberOfOddOccurrences <= 1;
 return Object.values(letterOccurrences).every(isMaxOneOddNumberLetter);
;

console.log(isPalindrome("carerace"));

javascript algorithm programming-challenge functional-programming

share|improve this question

asked 16 mins ago

thadeuszlaythadeuszlay

732316

$endgroup$

const isPalindrome = str => 
 const letterOccurrences = str
 .split("")
 .reduce((acc, x) => 
 acc[x] = acc[x] ? acc[x] + 1 : 1;
 return acc;
 , );

 let numberOfOddOccurrences = 0;
 const isMaxOneOddNumberLetter = x => x % 2 === 0 ?
 true : ++numberOfOddOccurrences <= 1;
 return Object.values(letterOccurrences).every(isMaxOneOddNumberLetter);
;

console.log(isPalindrome("carerace"));

share|improve this question

asked 16 mins ago

thadeuszlaythadeuszlay

732316

share|improve this question

asked 16 mins ago

thadeuszlaythadeuszlay

732316

asked 16 mins ago

thadeuszlaythadeuszlay

732316

asked 16 mins ago

thadeuszlaythadeuszlay

732316