The Unique Paths problem asks us to find the number of distinct ways to reach the bottom-right corner of a grid starting from the top-left corner. You can only move right or down at any step. This problem is a great example of combinatorics, recursion, and dynamic programming. Imagine you’re…

The Subsets problem is classic combinatorics tasks in which you’re given a list of unique integers, and your goal is to return all possible subsets of the list (including the empty subset of the list itself). It’s a fundamental problem that helps build a deeper understanding of recursion, backtracking, and…

The “Coin Change” problem is a classic example of a dynamic programming problem in which we aim to find the minimum number of coins needed to make up a target amount using a given set of coin denominations. This problem is known for testing the ability to optimize for minimal…

Being able to correctly organize and abstract code into smaller pieces is essential for all code, but especially CSS. When it comes to large, complex frontends SASS is one of the best ways to correctly structure CSS. Nothing pairs better with SASS then BEM methodology. Which stands for: A block…

React is a JS library that allows you to make web UI’s that is very similar to HTML. JSX is for more strict compared to HTML and it is dynamic. You may be asking yourself, why use JSX when we have HTML? In order to use JSX, you must do…