Difficulty: Medium Link: Day3: June Leetcode Challenge 2021 Problem Statement Given a rectangular cake with height h and width w, and two arrays of integers horizontalCuts and verticalCuts where horizontalCuts[i] is the distance from…

# Tag: codeforces

Difficulty: Medium Link: Day1 : June LeetCode Challenge Problem Description You are given an m x n binary matrix grid. An island is a group of 1‘s (representing land)…

Difficulty: Medium Link: Day 27: May Leetcode Challenge Problem Statement Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not…

Difficulty: Medium Link: Day 26, May Leetcode Challenge Problem Description A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For…

Difficulty: Medium Link: Day 21: May Leetcode Challenge Problem Description Given a list of strings words and a string pattern, return a list of words[i] that match pattern. You may return the…

Difficulty: Medium Link: Day 19:May Leetcode Challenge Problem Description Given an integer array nums of size n, return the minimum number of moves required to make all array elements…

Difficulty: Medium Link: Day 18: May Leetcode Challenge Problem Description Given a list paths of directory info, including the directory path, and all the files with contents…

Difficulty: Easy Link: Day 2: May LeetCode Challenge Problem Description Count the number of prime numbers less than a non-negative number, n. Examples Constraints 0 <=…

Difficulty: Medium. Link: Day 6: May Leetcode Challenge Problem Description Given the head of a singly linked list where elements are sorted in ascending order, convert it to…

Difficulty: Easy Link: Day 3: May Leetcode Challenge Problem Statement Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return…