Tree traversal algorithms are easy. Let’s see the Python implementation of these three types of tree traversal in the recursive way. Click here to see the iterative implementation of tree traversals. TreeNode Class Pre Order Traversal In Order Traversal Post Order Traversal
(Pre|In|Post)Order Traversal In Binary Tree | Recursive Way | Code Snippet Read More »
The tree is one of the most important data structures in computer science. We are going to see the Python implementation of tree traversals. In this blog, we will see only iterative implementation. Pre Order Traversal In Order Traversal Post Order Traversal Level Order Traversal
Read the problem description first. To see the problem, click here. There is nothing to explain. It’s nothing but a binary search implementation. If you know how to implement Binary Search, then you already know the solution. Since you are in Leetcode, I believe you know this searching algorithm. If you don’t know binary search,
704. Binary Search | LeetCode | Python | Solution Read More »
This problem description is pretty simple. The description is: find the sum of all left leaves in a given binary tree. Here is the link of the problem. Let’s see the tree from the example. We see a binary tree in the above example. In a binary tree, each node has at most two child
404. Sum Of Left Leaves | LeetCode | Python | Solution Read More »
Often we have to center an element vertically and horizontally. We can do this easily using CSS Grid and Flexbox. But it was boring before the advent of CSS Grid and Flexbox. Let’s see an example first. Suppose we have a container with a black border. Inside this container, we have an element with a
Center An Element Vertically and Horizontally Using Flexbox Read More »
Creating images of code snippets is very simple and easy. But I didn’t know before. It takes a short time to create it. You can create this by using a simple tool called Carbon. Here is the link. So many options you will find there to modify your background, theme, and which language you write.
Problem link Given an array of integers, We have to return the running sum of that array. Suppose, we have an array of integers like [1, 2, 3]. As per the problem, the result of this array will be [1, 3, 6]. We define a running sum of an array as arr[i] = sum(arr[0]…arr[i]). In
1480. Running Sum of 1d Array | LeetCode | Python | Solution Read More »
Here is the problem link to see the problem details. The problem description is very concise and easy to understand. Given an array of integers, we have to return how many of them contain an even number of digits. Example of an even number of digits:1234 = even (here are four digits and four is
1295. Find Numbers with Even Number of Digits | LeetCode | Python | Solution Read More »
Here is the problem link. See the problem explanation first and try to understand the problem. It’s an easy linked list problem. We have to return the middle node from a linked list. We don’t have to check the emptiness of the given linked list. We will receive only a non-empty linked list. If there
876. Middle of the Linked List | LeetCode | Python | Solution Read More »
This problem is not about programming related. It’s about the database. Here is the link to the problem. There is a table called the world. It contains some information about countries around the world. These are name, continent, area, population, etc. To solve this problem, we have to write a SQL solution to output big
595. Big Countries | Database | LeetCode | Solution Read More »