# Min Cost Climbing Stairs

Difficulty: Easy Link: Day 8: June Leetcode Challenge Problem Statement You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay…

# Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (Leetcode 1465)

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…

# Partitioning Into Minimum Number Of Deci-Binary Numbers (Leetcode 1689)

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…

# To Lower Case (Leetcode 709)

Difficulty: Easy Link: Day 24: May Leetcode Challenge Problem Description Given a string s, return the string after replacing every uppercase letter with the same lowercase letter.…

# Binary Tree Level Order Traversal (Leetcode 102)

Difficulty : Medium Link: Day 12: May Leetcode Challenge Problem Description Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e.,…

# Minimum Moves to Equal Array Elements II (Leetcode 462)

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…

# Find Duplicate File in System (Leetcode 609)

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…

# Valid Number (Leetcode 65)

Difficulty: Hard Link : Day 15: May Leetcode Challenge Asked in : Facebook, Linkedin, Twitch Problem Description A valid number can be split up into these components…

# Ambiguous Coordinates (Leetcode 816)

Difficulty: Medium Link: Day 13: May Leetcode Challenge Problem Description We had some 2-dimensional coordinates, like “(1, 3)” or “(2, 0.5)”.  Then, we removed all commas, decimal points, and…

# Interval List Intersections (Leetcode 986)

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…