Rock Paper Scissors is a pretty well-known game. I assume that you know about it and its rule. In this blog, we are going to build...
Continue reading...Python
LeetCode 226 | Invert Binary Tree | Python | Solution
Invert Binary Tree is one of the most popular programming problems. It’s an easy problem. I assume that you have a basic understanding of Binary Tree...
Continue reading...LeetCode 199 | Binary Tree Right Side View | Python | Solution
If you know about the level order traversal algorithm, finding the right-side view of a binary tree becomes easy for you. This problem is nothing but...
Continue reading...Number of 1 Bits | LeetCode 191 | Python | Solution
To solve this ‘number of 1 bits‘ problem, we have to count the number of ‘1’ bits from an unsigned integer. It’s an easy problem if...
Continue reading...Max Area of Island | LeetCode 695 | Python | Solution
‘Max Area of Island’ is a graph problem. I assume you already have a basic understanding of Graph and DFS algorithms. This problem is almost similar...
Continue reading...Recursion | An Awesome Method for Solving Problems
Before getting into details, you don’t need to be disappointed if you don’t understand the recursion quickly. Initially, it may seem a bit complex or fuzzy...
Continue reading...Overview of Python Dictionary | Data Structure
Dictionary in Python is a data structure. Dictionary is similar to HashTable with some extra features. HashTable is one of the most important data structures in...
Continue reading...Number of Islands | LeetCode 200 | Python | Solution
LeetCode 200 The number of islands is one of the most popular programming problems. Read the problem description first. Before getting into the solution, I assume...
Continue reading...Same Tree | LeetCode 100 | Python | Solution
LeetCode 100 It’s an easy LeetCode problem, and the description is concise and straightforward. We can solve this problem using the DFS algorithm. From two binary...
Continue reading...Kth Smallest Element in a BST | LeetCode 230 | Python | Solution
LeetCode 230 I hope you already know about Binary Search Tree. In BST, each node is greater than its left subtree and smaller than its right...
Continue reading...