LeetCode

[Solved] Calculate Amount Paid in Taxes LeetCode Contest Problem

[Solved] Calculate Amount Paid in Taxes LeetCode Contest Problem

Calculate Amount Paid in Taxes: You are given a 0-indexed 2D integer array brackets where brackets[i] = [upperi, percenti] means that the ith tax bracket has an upper bound of upperi and is taxed at a rate of percenti. The brackets are sorted by upper bound (i.e. upperi-1 < upperi for 0 < i < brackets.length). Tax…

[Solved] Successful Pairs of Spells and Potions LeetCode Contest Problem

[Solved] Successful Pairs of Spells and Potions LeetCode Contest Problem

Successful Pairs of Spells and Potions: You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] represents the strength of the jth potion. You are also given an integer success. A spell and potion pair is considered successful if the product of their…

[Solved] Strong Password Checker II LeetCode Contest Problem

[Solved] Strong Password Checker II LeetCode Contest Problem

Strong Password Checker II: You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] represents the strength of the jth potion. You are also given an integer success. A spell and potion pair is considered successful if the product of their strengths is at…

[Solution] Min Max Game – LeetCode Weekly Contest 296

Min Max Game - LeetCode Weekly Contest 296

You are given a 0-indexed integer array nums whose length is a power of 2. Apply the following algorithm on nums: Let n be the length of nums. If n == 1, end the process. Otherwise, create a new 0-indexed integer array newNums of length n / 2. For every even index i where 0 <= i < n / 2, assign the value of newNums[i] as min(nums[2 *…