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,…
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…
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…
Binary Search is one of the most popular searching algorithms. We use this to search specific elements on a sorted list. A binary search is not applicable on an unsorted list. It’s a fast and widely used algorithm. In real…
Click here to see the problem details on LeetCode. Reverse a string is a pretty common type of problem. We all know how to reverse a string. But in this problem, we are not allowed to reverse the entire string.…
When we hear the word tree before we know the tree of computer science, the image of the tree of real-life floats in our eyes. The concept of the tree in Computer Science is similar to a real-life tree. But…
Intro Markdown is a light Markup language for formatting text and more readable content. It’s easy to learn, and you will not regret it after learning it. If you are a content writer or a programmer who needs to write…
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…
Date object is pretty useful. Often, you have to use it If you use JavaScript. Not only current time and date, but also we can do more than that using this object. But I am not going to write all…
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…