If you are working with multiple threads that contribute to the result of output. An important consideration is how the various threads would communicate, or sync to avoid producing confusing results. Today's Challenge was a lot of that for me (threa...
My approach today involves a naive solution of looping true the input and creating a mapping between the character and number of occurrences in a dictionary. After the mapping is complete, I would now use the mapping in the dictionary to create a wor...
Problem Statement for Day3 Given an integer x, return true if x is a palindrome integer. An integer is a palindrome when it reads the same backward as forward. Approach: The first step is to create a base case which is when the length of the integer ...
Let's start with defining the problem statement for today's challenge. Problem Statement: Given an integer array (nums) and an integer (val), remove all occurrences of val in nums in-place. The relative order of the elements may be changed. Return k...
I started out hoping to implement a solution that uses O(1) space and takes at most O(nlogn) time. My initial thought was to modify the merge sort algorithm to drop duplicates when encountered, by drop I mean swapping it with a value at the back. But...
This is CS50!! LOL, no this isn't. This is just me making a case for CS50, why I think it's the most useful course to self-improve as a newbie developer. But before I make my case what even is CS50? What is CS50? CS50 is Harvard's introduction to the...
