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 »
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 in the above example. In a binary tree, each node has at most two child
404. Sum Of Left Leaves | LeetCode | Python | Solution Read More »
Here is the problem link to see the problem details. The problem description is very concise and easy to understand. Given an array of integers, we have to return how many of them contain an even number of digits. Example of an even number of digits:1234 = even (here are four digits and four is
1295. Find Numbers with Even Number of Digits | LeetCode | Python | Solution Read More »
Here is the link to the problem. An easy problem to solve. The problem description is easy. Given a string and we have to returns it in lowercase. We can solve this problem in many ways. The first one is we will check each character. If it is uppercase we will change it to lowercase.
709. To Lower Case | LeetCode | Solution | Python Read More »
This problem is all about designing a stack data structure. Here is the problem link. See the detailed explanation there. To solve this problem, we have to write the most common stack operations. A stack is an abstract data structure. It’s Follow the LIFO (Last In First Out) rules. I hope you already know about
It’s a classic programming problem and a very beginner type of problem. Here is the link to the problem. See the explanation in LeetCode first. And try to understand the problem. First, we will be given a number n as input. We have to store each number from 1 to n in an array as
Here is the link to the problem. See the full explanation on LeetCode first. Try to understand the problem. It’s an easy problem. So the problem is, we have to return the length of the last word from the given string. The string can be consist of uppercase and lowercase letters and separated by a