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: spoj

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 18: May Leetcode Challenge Problem Description Given a list paths of directory info, including the directory path, and all the files with contents…

Difficulty: Medium Link: Leetcode 986 Problem Statement You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of…