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…
Click here to see the problem details. It’s an easy LeetCode problem with straightforward problem details. In a simple word, we will be given a sentence to check it is Pangram or not. So, what is Pangram? According to the…
Click here to see the problem details on LeetCode. Before solving this problem, we have to know about palindrome. According to the definition of Wikipedia: A palindrome is a word, number, phrase, or other sequence of characters which reads the…
Click here to see the problem details. Problem Overview This one is a very much simple problem. We have to find out the sum of all the unique values from an integer array. Nothing else, and we don’t have to…
Click here to see the problem details. Problem Overview The problem description is pretty precise. It says that we have to return the reverse version of the given string. But we can only reverse letters. Characters that are not a…
Click here to see the problem on LeetCode. A simple Tree related problem and description is pretty straightforward. We have to return the sum of values of all nodes with a value in the range. The range is actually a…
Click here to see the problem on LeetCode. The problem description is pretty straightforward. We have to return all the nodes’ values following the preorder traversal algorithm. I can assume that you have a basic understanding of Tree data structure.…
Here is the link to the problem. See the problem description. We have to check the given array is monotonic or not. What is a monotonic array? “An array is monotonic if it is either monotone increasing or monotone decreasing.”…
This one is a simple SQL problem. Here is the link to this problem. This one is an absolute beginner type problem. We have to query all the duplicates emails from the given table. The name of the table is…
Click here to see the problem details. The problem is simple. We have to find at least one duplicate in the given array. If we found any duplicate number, we will return True. Otherwise, we will return False. That’s the…