Leetcode May Month Challenge[May 1,2020 - May 31,2020]

Leetcode April 30 day challenge is successfully completed. If you ever miss any day problem in April, check out here for April month problems with solutions and explanation.

After this completion, Leetcode is again going to conduct 31 day challenge for month of May. According to the article from Leetcode, they are going to start from May 1 to May 31, with lot of rewards for successful completion. User who made successful submission for each problem will receive 10 coins as reward. Read this article for more prizes and rules.

Daily problems with solutions and explanation will be updated here. Subscribe us for daily reminders of each problems.

Click here for May month challenge on Leetcode

DAY 1 - First Bad Version

DAY 2 - Jewels and Stones 

DAY 3 - Ransom Note 

DAY 4 - Number Complement







DAY 11 - Flood Fill










Remaining problems [From May 19] will be update later.

We are extremely sorry for the inconvenience. Due to some issues, we are unable to provide daily updates.But we are back with June Daily Challenge on Leetcode

Please let us know your views in comment section.

Click Follow button to receive updates from us instantly.


Happy Coding...!!😍

Comments

  1. Unknown18 May 2020 at 12:17

    thanks allot for sharing this. I think you would do great in explaining the solutions in details!

    ReplyDelete
    Replies
    1. Fellow Programmer18 May 2020 at 20:25

      Thanks for sharing your opinion. Please do subscribe and follow us. Also unfortunately, due to some situations we are not able to continue daily updates and will provide more problems & tutorials in upcoming weeks.

      Delete

Post a Comment

Popular posts from this blog

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.sub...
Read more

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 ...
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 ...
Read more

Sequential Digits

An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high]  inclusive that have sequential digits. Example 1: Input: low = 100, high = 300 Output: [123,234] Example 2: Input: low = 1000, high = 13000 Output: [1234,2345,3456,4567,5678,6789,12345] Constraints: 10 <= low <= high <= 10^9 class Solution {     public List<Integer> sequentialDigits(int low, int high) {         List<Integer> result = new ArrayList();         String str = "123456789";         int i, j, length = str.length(), num;         for( i = 2; i <= length; i++) {             for( j = 0; j <= length - i; j++) {      ...
Read more