Split Set To Equal Subsets - Javascript Question

"Both subsets sum to 19 and are equal." - sure this should be 21? Link to problem: Split Set To Equal Subsets .

Sorted Two Sum - Javascript Question

Could this also be implemented as a binary search in O) time? Link to problem: Sorted Two Sum .

Treats Distribution - Javascript Question

Why do we need to sort the array? Just keep adding the values into a set and then take the min of the size of the set and n /2 . Should be O time complexity - no? Link to problem: Treats Distribution .

Least Missing Positive Number - Javascript Question

So, what happens when the array contains a value greater than the length of the array? It would be useful if the problem statement actually specified that. Similarly, that there could be many missing positive integers, or only one. Link to problem...

Lonely Number - Python Question

Stritcly speaking ins't the hasmap solution also O space complexity? The unique values in the array are the numbers base 10 so there are only max 10 entries in the map. Space complexity of O is the same as O as it doesn't vary with the length of t...

Majority Element - Python Question

Is it not possible to create a O solution? By creating a hashmap where the keys are the digits and the values are the number of times that the digits appear, and then looking for the hashmap value that is greater than n / 2? By using a sort you a...

Is An Anagram - Python Question

is_anagram should return False - Mistake? Should return True Link to problem: Is An Anagram .

How Out Of Order (Main Thread)

This is the main discussion thread generated for How Out Of Order .

Swap Every Two Nodes In A Linked List (Main Thread)

This is the main discussion thread generated for Swap Every Two Nodes In A Linked List .

Validate Palindrome

I think for the solution you provided, we must account for the case of the character or letter as well as the whitespaces.

So here's my solution:

```js /* jshint esversion: 6 */ function isPalindrome { if ) { // return false; ...