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
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...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...Binary Tree Level Order Traversal | LeetCode 102 | Python | Solution
LeetCode 102 This problem just simply the implementation of the level order traversal algorithm. If you don’t know about level order traversal yet, you can check...
Continue reading...Maximum Depth of Binary Tree | LeetCode 104 | Python | Solution
LeetCode 104 It’s a common and basic type of problem. The problem title is self-explanatory. We all know about a binary tree. To solve this problem,...
Continue reading...Two Sum | LeetCode 1 | Python | Solution
LeetCode 1 Read the problem description first and think about the problem. We will be given an integer array and target. Target is also an integer....
Continue reading...