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 trees, we have to check whether both are the same or not. Consider the following cases for two different nodes. If both nodes are null, we can say that […]
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 subtree. If we print all the nodes of a BST using an inorder traversal algorithm, we will get the sorted value in ascending order. Inorder traversal follows the rule:
Kth Smallest Element in a BST | LeetCode 230 | Python | Solution Read More »
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 my blog on this topic. As we know, using level order traversal, we traverse through the tree level by level. But in this problem, we have to separate values
Binary Tree Level Order Traversal | LeetCode 102 | Python | Solution Read More »
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, we have to find the maximum depth of a binary tree. We can solve this using both DFS and BFS algorithms. I am going to use the DFS solution.
Maximum Depth of Binary Tree | LeetCode 104 | Python | Solution Read More »
This one is another way of traversing through a binary tree. There are many other ways you can do it. Click here to check. Level order traversal is a binary tree version of the BFS (Breadth-First Search) algorithm. The concept is simple. I hope you already know about the binary tree. If we visualize a
This game is surely not going to be the fanciest game. But any beginner with a basic knowledge of the Python programming language can built-it and understand it easily. I think this can be a good and simple project for a beginner to practice. By the way, this game has no fancy GUI. You have
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. We have to find two elements out from the given array, where the sum of those two elements has to be equal to the target. After that, we will
LeetCode 1903 It’s a simple problem. We have to return the largest odd number from the given string. If we check odd numbers from the last, we will get the result. If a number is odd, we can say that all the numbers from start to including this number are odd. Suppose the given number
Largest Odd Number in String | LeetCode 1903 | Python | Solution Read More »
LeetCode 9 Before getting into the solution, let’s see the definition of a palindrome. According to Wikipedia: A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward So to solve this problem, we have to reverse the given number. After that, we can check both versions
Palindrome Number | LeetCode 9 | Python | Solution Read More »
LeetCode 383 Problem Overview Ransom Note is a pretty common programming problem. The problem description is concise and understandable. So, this problem says that we will be given two strings (ransomNote and magazine). In short, we have to return True if all the characters of the ransomNote are in the magazine string. Otherwise, False. For