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 206 Reverse Linked List is one of the classic programming problems. The problem description is nothing complicated. We have to reverse the given Linked List and return the reversed list. For example: We can solve this problem in many ways. Before getting into the solution, you can check my blog about the Linked List
Reverse Linked List | LeetCode 206 | 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
LeetCode 2124 This one is one of the easy problems on LeetCode. To solve this problem, mainly you have to know how to split a sentence based on spaces and count array elements. If you know the basics of Python, this will not be a big deal for you. You can solve this problem. I
Last year did not go well for me in terms of achieving goals. I set some major goals last year. And at the end of the year, I have failed miserably. For that, I blame myself. It’s only me who is responsible for this. I have to improve myself a lot. This year I have
There are three Depth First Search (DFS) types of traversal algorithms for Binary Tree. Traversal algorithms are for traversing in a Binary Tree. These three are variations of the Depth First Search (DFS) algorithm. In DFS, we start traversing from the root and go in-depth until there is no node to traverse. Its uses in
Binary Tree Traversal Algorithms | DFS | Algorithm Read More »