Explore the latest articles and tutorials in Data Structures And Algorithms
Optimizing the Top-K Elements Problem: From Naive to Efficient Finding the k largest numbers in an array is a common problem in software engineering and data science. An i…
Finding the Maximum Number of Vowels in a Substring I will help you find the number of vowels in a substring of fixed length. This is a common problem in bo…
Problem-Solving in Data Structures and Algorithms Here's an all-inclusive guide to problem-solving techniques in DSA, ordered from the easiest to the most advance…
Sliding Window Techniques The techniques used in the sliding window are at the core of efficient algorithm design. More so for solving problems involving arrays, strings, or…
Checking for Permutations in Strings: A Sliding Window Approach The task is to determine if one string contains a permutation of another. The latter is part of string manipu…
Optimizing the Longest Substring Without Repeating Characters One everyday use case of string manipulation is finding the length of the longest substring. This can be …
The Prefix Sums Technique When dealing with large datasets, computing range sums efficiently is always a challenge. The Prefix Sums technique is a powerful algorithmic appro…
Mastering how to generate Parenthesis Generating valid combinations of parentheses tests your recursion and backtracking skills. Whether you're preparing for codin…
The Daily Temperatures Problem Given a list of temperatures denoted as "temps" we will determine how many days we must wait for a warmer day. The two solutio…
Understanding the Frequency Counter Technique in Algorithm Design The Frequency Counter technique is a powerful and efficient approach to solving problems requiring counting el…