Leetcode 30 Day Challenge [April 1,2020 - April 30,2020]

Leetcode is currently running a 30 day challenge to make use of lock down in useful way. So for the month of April , each day they release a new problem till April 30, 2020. Here are the list of questions and solutions with explanation till date. Solve each problem within 24 hours from it's opening time to receive coins reward.

DAY 1 - Single Number

DAY 2 - Happy Number

DAY 3 - Maximum Subarray

DAY 4 - Move Zeroes

DAY 5 - Best Time to Buy and Sell Stock II

DAY 6 - Group Anagrams

DAY 7 - Counting Elements

DAY 8 - Middle of the Linked List

DAY 9 - Backspace String Compare

DAY 10 - Min Stack

DAY 11 - Diameter of Binary Tree

DAY 12 - Last Stone Weight 

DAY 13 - Contiguous Array

DAY 14 - Perform String Shifts

DAY 15 - Product of Array Except Self 

DAY 16 - Valid Parenthesis String

DAY 17 - Number of Islands

DAY 18 - Minimum Path Sum

DAY 19 - Search in Rotated Sorted Array 

DAY 20 - Construct Binary Search Tree from Preorder traversal

DAY 21 - Leftmost column with atleast a one

DAY 22 - Subarray Sum equals K

DAY 23 - Bitwise AND of Numbers Range 

DAY 24 - LRU Cache

DAY 25 - Jump Game  

DAY 26 - Longest Common Subsequence

DAY 27 - Maximal Square

DAY 28 - First Unique Number

DAY 29 - Binary Tree Maximum Path Sum

DAY 30 - Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree


It is happy to share here on because of successful completion of April 30 day challenge, Leetcode is again going to conduct May 31 day challenge.

Check out here for Leetcode 31 day challenge[May 1.2020 - May 31,2020]

Click Follow button to receive updates from us instantly.

Please let us know your views in comment section.

Happy Coding..!!😍

Comments

Post a Comment

Popular posts from this blog

Balanced Binary Tree

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the left and right subtrees of  every  node differ in height by no more than 1. Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: true   Constraints: The number of nodes in the tree is in the range  [0, 5000] . -10 4  <= Node.val <= 10 4 Solution: /**  * Definition for a binary tree node.  * public class TreeNode {  *     int val;  *     TreeNode left;  *     TreeNode right;  *     TreeNode() {}  *     TreeNode(int val) { this.val = val; }  *     TreeNode(int val, TreeNode left, TreeNode right) {  *         this.val = val;  *         this.left = left;  *         this.right = right;  *     }
Read more

First Unique Character in a String

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Note: You may assume the string contain only lowercase letters. class Solution {     public int firstUniqChar(String s) {         int length = s.length();         String str;         for(int i=0;i<length;i++){             if(i==length-1){                 str = s.substring(0, i);             }             else{                 str = s.substring(0,i)+s.substring(i+1);             }             if(!str.contains(s.charAt(i)+""))                 return i;         }         return -1;     } } Try it on Leetcode Here, we are going to use substring method. 1) If character is at end, then take substring from 0 till before last character of string. 2) Else make a temporary string, by removing exactly that particular character using index. [e.g..
Read more

Majority Element

Given an array of size n , find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority element always exist in the array. Example 1: Input: [3,2,3] Output: 3 Example 2: Input: [2,2,1,1,1,2,2] Output: 2   class Solution { public int majorityElement(int[] nums) { Arrays.sort(nums); return nums[nums.length/2]; } } Here, we are sorting the entire array using sort() of Arrays class. Then, number at index position n/2 would be a majority element. There is no chance of wrong values in odd or even length.   Below is another method using HashMap. METHOD 2: class Solution { public int majorityElement(int[] nums) { HashMap<Integer, Integer>list = new HashMap<Integer, Integer>(); int repeatLen
Read more

Smallest Range II

Given an array   A   of integers, for each integer   A[i]   we need to choose   either  x = -K  or  x = K , and add   x   to   A[i]  (only once) . After this process, we have some array  B . Return the smallest possible difference between the maximum value of  B  and the minimum value of  B . Example 1: Input: A = [1] , K = 0 Output: 0 Explanation : B = [1] Example 2: Input: A = [0,10] , K = 2 Output: 6 Explanation : B = [2,8] Example 3: Input: A = [1,3,6] , K = 3 Output: 3 Explanation : B = [4,6,3] Note: 1 <= A.length <= 10000 0 <= A[i] <= 10000 0 <= K <= 10000 Solution: class Solution {     public int smallestRangeII(int[] A, int K) {         int i, min=0, max=0, min1, min2, max1, max2, length = A.length, diff
Read more