brokensandals.net -> Technical -> Programming challenges -> June 2019 KC Code Challenge hints

Posted on 2019-06-16.

For the June 2019 KC Code Challenge Meetup we’re discussing five HackerRank problems. If you’ve gotten stuck, here are some hints that might help. I’ve arranged the problems from easiest to hardest (in my personal, subjective estimation).

Remember, you don’t need to solve all (or any) of these to come to the meetup! Indeed, solving all of them would be a big time investment. Count Triplets and Maximum Subarray Sums, in particular, are quite challenging.

Sock Merchant

If you want to see solutions with explanations for this problem, see this post.

Ransom Note

If you want to see solutions with explanations for this problem, see this post.

Special Palindrome Again

If you want to see solutions with explanations for this problem, see this post.

Count Triplets

If you want to see solutions with explanations for this problem, see this post.

Maximum Subarray Sum

If you want to see solutions with explanations for this problem, see this post.