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…
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.…
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…
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…
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…
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.…
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…
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…