Frequency Counter is one of the most frequent patterns in programming - if not the most. You will certainly use it in your side projects and work. Let's use the classic anagram problem. Anagram is a word/phrase created by rearranging the letter of an...
Before delving into classic algorithms and data structures, we must learn or revisit some problem-solving patterns. The Multiple Pointers pattern will be our starting point. The main idea here is to create multiple pointers attached to specific posit...
Recursion is basically a process that calls itself until it reaches the finish condition. Here's a factorial algorithm as an example: function factorial(num) { // End of the recursion if (num === 1) return num; // Calls itself decreasing the input by...
A few days ago, I was thinking about contributing to the community and decided to revisit some algorithms and data structure fundamentals and share my journey with you all. So, get ready for some short and to-the-point posts.
