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…

# Tag: swiftprogramminglanguage

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 17: May Leetcode Challenge Problem Description Given a list of words, each word consists of English lowercase letters. Let’s say word1 is a…

Difficulty: Medium Link: Day 12: May Leetcode Challenge Problem Description Given a 2D matrix matrix, handle multiple queries of the following type: Calculate the sum of the elements…

Difficulty: Medium Link : Day 5: May Leetcode Challenge Problem Description Given an array of non-negative integers nums, you are initially positioned at the first index…

Difficulty: Medium Link: Day 4 : May Leetcode Challenge Problem Description Given an array nums with n integers, your task is to check if it could become non-decreasing by…