#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…
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…
Even Odd Separation O(N) Single Iteration
Given an array containing a mix of even and odd numbers, and we need to perform Even Odd Separation. In this post we’ll see how to separate even and odd…
Tree Traversals – Preorder, Inorder, Postorder
Tree Traversal: visiting every node of a tree. Unlike other linear data structures, where we traverse through every element in order, it’s not the same with the tree. Trees being…
Program to Evaluate Postfix Expression – LeetCode
Given, an arithmetic expression. We need to Evaluate Postfix Expression, also known as Reverse Polish Notation. Operators include /,*,+,- and we will always return a finite result, there won’t be…
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…