Click here to see the problem details on LeetCode. Pretty simple Binary Tree problem. We can solve this using the Level Order Traversal algorithm. This way, we traverse a tree level by level. After each level completion, we calculate the average of all node values of that level. And then, it will be appended in […]
Average of Levels in Binary Tree | LeetCode 637 | Python | Solution Read More »
Click here to see the problem details. Problem Overview We will be given a string (s) and a substring (part). We have to remove all occurrences from the string based on the given substring. We will continue to remove until all the occurrences of the substring are removed. Each time we have to remove the
Remove All Occurrences of a Substring | LeetCode 1910 | Python | Solution Read More »
Here is the problem link. Problem Overview This is an easy problem, and it’s basically a string-related problem. I hope you already read the problem description from the given link. So we will be given a string and an integer. The given string is basically a sentence which is a list of words separated by
Truncate Sentence | LeetCode 1816 | Python | Solution Read More »
Click here to see the problem details. Problem Overview This problem is quite simple. We will be given a string (s) and an array (indices) that is the same length as the string. All of the integers of the array are unique, and of course, all the integers will be less or equal to the
Shuffle String | LeetCode 1528 | Python | Solution Read More »
Click here to see the problem details. Problem Overview The problem description is pretty straightforward. We are given two sorted Linked List. And we have to merge those given Lists into one sorted list. That’s the problem. Suppose our given two lists are 1 -> 3 and 2 -> 4. And the result will be
Merge Two Sorted Lists | LeetCode 21 | Python | Solution Read More »
Intro List methods are useful, and we have to use these most of the time when working with List. There are more than five methods. But I will write about the five most useful methods that I have used the most. Python List is equivalent to Array. So, if I use Array word instead of
Click here to see the problem details. Read the problem details first. Concept This is clearly a Tree related problem and a medium-type problem. In my sense, it’s not that difficult if you have a basic concept about BST (Binary Search Tree). BST is also a Binary Tree. So what is a Binary Search Tree?
Insert into a Binary Search Tree | LeetCode 701 | Python | Solution Read More »
Intro Python has so many built-in functions. These are really helpful. In this article, we will know about two useful built-in functions. Before getting into the main topic, let’s see two examples first. Code for finding the largest number out of three. Code for finding the smallest number out of three. Look at the previous
Introduction Generally, a string is consists of one or more characters. These characters can be the alphabet, numbers, etc. In most cases, we need to manipulate string as per our need. It is tedious to do this manually. That’s why general-purpose programming languages come with so many useful methods to make our life easier. Similarly,
Introduction ‘Queue’ is another abstract and linear data structure. It’s almost like Stack. The difference is it follows the principle FIFO instead of LIFO. So let’s get into the blog. In this blog, I am going to give you an overview of the Queue data structure. And of course, I will show you the implementation