Leetcode Detailed Solutions

Category: Easy Problem A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0. Also, a self-dividing number is not allowed to contain the digit zero. Given a lower and upper number bound, […]

Category: Easy Problem Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image. To flip an image horizontally means that each row of the image is reversed.  For example, flipping [1, 1, 0] horizontally results in [0, 1, 1]. To invert an image means that each 0 is replaced by 1, and each 1 is

Category: Easy Problem A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string “”, or a single character not equal to “(” or “)”, It can be written as AB (A concatenated with B), where A and B are VPS‘s, or It can be written as (A), where A is a VPS. We can similarly define the nesting depth depth(S) of any VPS S as follows: depth(“”) = 0

Category : Easy Problem Given an array nums of integers, return how many of them contain an even number of digits. https://leetcode.com/problems/find-numbers-with-even-number-of-digits/ Examples Example 1: Example 2: Constraints 1 <= nums.length <= 500 1 <= nums[i] <= 10^5 Solution Approach The problem states that we need to find a count of all the numbers in the array which has

Category : Easy Problem Given an integer n and an integer start. Define an array nums where nums[i] = start + 2*i (0-indexed) and n == nums.length. Return the bitwise XOR of all elements of nums. https://leetcode.com/problems/xor-operation-in-an-array/ Examples Example 1: Example 2: Example 3: Example 4: Constraints 1 <= n <= 1000 0 <= start <= 1000 n == nums.length Solution Approach In this problem, we

Category : Easy Problem Given an integer number n, return the difference between the product of its digits and the sum of its digits. https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/ Examples Example 1: Example 2: Constraints 1 <= n <= 10^5 Solution Approach In this question, you just need to find the sum and product of the digits of a given

Category : Easy Problem Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. https://leetcode.com/problems/shuffle-string/ Examples Example 1: Example 2: Example 3: Example 4: Example 5: Constraints s.length == indices.length == n 1 <= n <= 100 s contains only

Category : Easy Problem Given the array candies and the integer  extraCandies, where  candies[i] represents the number of candies that the ith kid has. For each kid check if there is a way to distribute  extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have the greatest number of candies. https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/ Examples Example 1:

Category : Easy Problem Given the array nums for each  nums[i] find out how many numbers in the array are smaller than it. That is, for each  nums[i] you have to count the number of valid  j's such that  j != i and  nums[j] < nums[i]. Return the answer in an array. https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/ Examples Example 1: Example 2: Example 3: Constraints: 2 <= nums.length <= 500 0

Category : Easy Problem Given an array  nums. We define a running sum of an array as  runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of  nums. https://leetcode.com/problems/running-sum-of-1d-array Examples Example 1: Example 2: Example 3: Constraints 1 <= nums.length <= 1000 -10^6 <= nums[i] <= 10^6 Solution Approach In this question, you just need to find the running sum i.e the at any