If you are a self-learner, especially a computer programmer or developer, keep the following things in mind. I think keeping these in mind will help you. And save you a lot of time. I made a lot of mistakes during…
Before getting into the Binary Search Tree (BST), you have to know the basics of Tree and Binary Tree. I assume that you have the basic idea of Tree and Binary Tree. Intro A Binary Search Tree is a special…
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…
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…
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…
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 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…
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…
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…
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…