Skip to content
#30DaysofCode

#30DaysofCode

I had started the #30DaysofCode📚 challenge while I was revising the basic concepts, data structures, and solving easy problems on LeetCode. I documented this so that it helps both me and others to recall what we have learned. How to use this list📑 First, look at the given questions, if… Read More »#30DaysofCode

Indirect Recursion and direct recursion

Direct & Indirect Recursion

In programming, Recursion means a function calling itself. The best use of recursion is when we have a big/complex problem and is solved by breaking down the problem into smaller instances. In this post, we’ll see direct and indirect recursion. Types of Recursion Generally, there are two main types of… Read More »Direct & Indirect Recursion

Brackets Balanced Program

Balanced Parenthesis Program

We have an expression that contains brackets and alphanumeric characters, and we need to check whether the parenthesis are balanced or not. Balanced Parenthesis means an equal number of opening and closing brackets. Example Solution Approach – Using Stack Why Stack Data Structure? Here, our priority is to find if… Read More »Balanced Parenthesis Program