Click here to see this problem on LeetCode. This problem’s difficulty level is easy. Problem Overview Simple problem. From the given two strings, we have to check the first one is an anagram of the second one. If it’s not true, then we will return False. Otherwise, True. According to Wikipedia: An Anagram is a […]
Valid Anagram | LeetCode 242 | Python | Solution Read More »
Click here to see the problem details on LeetCode. Problem Overview This problem’s difficulty level is easy. The problem description is straightforward. In an integer array, we have to move all 0’s to the end of it. And maintain the relative order of other elements. Suppose we have an array [2, 0, 1] as an
Click here to see the problem details on LeetCode. Solution Simple problem. We need to find out the majority element from an integer array.Suppose we have an array: [5, 5, 1, 2, 5, 1, 3, 5, 5]. In this array, the number 5 appears five times. And it’s the majority element of the array. The
Majority Element | LeetCode 169 | Python | Solution Read More »
Click here to see the problem details on LeetCode. Problem Overview We will be given an integer array (sorted in no-decreasing order) and an integer. We have to find the position of the given integer from the Array. But there is a trick. That is, we have to find the first and last position of
This problem is pretty straightforward. Click here to see the problem. Problem Overview The problem description is one line and pretty simple. It says that we have to find the first unique character from a string and return the index of that character. In the given String, all characters will be English lowercase letters. Suppose
First Unique Character in a String | LeetCode 387 | Python | Solution Read More »
Click here to see the problem details. And read the problem details. Pretty simple problem. We will receive a 2D array. Where array[i] is the list of ith customer money from the different bank account, and we have to find out the wealthiest customer’s total from the list. After that, we have to return the
Richest Customer Wealth | LeetCode 1672 | Python | Solution Read More »
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 »