Click here to see the problem. And read the description and try to understand the problem first. Reverse String is one of the most common problems in computer programming. And this time, the input string is given as an array…
Click here to see the problem in LeetCode. And read the problem’s details. This one is a pretty simple problem. We will be given an integer array. We have to find the largest element’s index, which is must be at…
Click here to see the problem details. Read the description first. We will be given a Linked List. We have to determine there is any cycle or not in the linked list. It is an easy problem. See the problem…
Click here to see the problem in LeetCode. Read the description carefully. This one is a pretty easy problem for you if you know how to search on Binary Search Tree (BST). First, we will be given a Binary Search…
This one is a binary search-related problem. Click here to see the problem in LeetCode. We will be given a sorted array in ascending order. And a target value. So, what we have to do? We will have to return…
This one is database related problem and pretty easy. Click here to see the problem on LeetCode. Read the description and try to understand the problem. Note: I assumed that you have basic knowledge of SQL language. The actual problem…
Let’s solve a linked list problem. See the problem in Leetcode. Click Here. The problem description is pretty short and simple. It says that we are will be given a linked list. We have to delete all duplicates such that…
Here is the link to this problem. Read the problem description carefully before solving this problem. It’s an easy Leetcode problem. Here we will be given a non-negative number. We have to reduce the number based on some requirements until…
Read the problem description first. To see the problem, click here. There is nothing to explain. It’s nothing but a binary search implementation. If you know how to implement Binary Search, then you already know the solution. Since you are…
This problem description is pretty simple. The description is: find the sum of all left leaves in a given binary tree. Here is the link of the problem. Let’s see the tree from the example. We see a binary tree…