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…

Max Area of Island (Leetcode 695)

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)…

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.…

Find and Replace Pattern (Leetcode 890)

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…

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…

Longest String Chain (Leetcode 1048)

Difficulty: Medium Link: Day 17: May Leetcode Challenge Problem Description Given a list of words, each word consists of English lowercase letters. Let’s say word1 is a…

Flatten Binary Tree to Linked List (Leetcode 114)

Difficulty: Medium Link: Day 14: May Leetcode Challenge Problem Description Given the root of a binary tree, flatten the tree into a “linked list”: The “linked list”…

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…

Delete Operation for Two Strings (Leetcode 583)

Problem Description Given two strings word1 and word2, return the minimum number of steps required to make word1 and word2 the same. In one step, you can delete exactly one character in either string. Examples Constraints…