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 simple idea about the problem. And given array’s elements will be integers. Let’s see two […]
Contains Duplicate | LeetCode 217 | Python | Solution Read More »
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 of characters. We have to return the reverse version of the given array. See the
Reverse String | LeetCode 344 | Python | Solution Read More »
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 least twice as much as every other number in the array. If it’s not matched
Largest Number At Least Twice of Others | LeetCode 747 | Python | Solution Read More »
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 details for the visual representation of the cycle in a linked list. Coding Part Generally,
Linked List Cycle | LeetCode 141 | Python | Solution Read More »
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 Tree and a value for search. We have to search for the given value in
700. Search in a Binary Search Tree | LeetCode | Python | Solution Read More »
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 do we have to do? We will have to return the index of the target value. If the target value is not in the
35. Search Insert Position | LeetCode | Python | Solution Read More »
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 is, we have to retrieve data from the database with some condition. We have to
620. Not Boring Movies | LeetCode | SQL | Solution Read More »
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 each element appears only once. Suppose the given linked list is: 1 -> 2 ->
83. Remove Duplicates from Sorted List | LeetCode | Python | Solution Read More »
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 it gets zero. And then have to return how many steps it takes. To reduce
1342. Number of Steps to Reduce a Number to Zero | LeetCode | Python | Solution Read More »
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 in Leetcode, I believe you know this searching algorithm. If you don’t know binary search,
704. Binary Search | LeetCode | Python | Solution Read More »