Empowering coders, one solution at a time
Empowering coders, one solution at a time
![[Solved] Search In Rotated Sorted Array Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Search-In-Rotated-Sorted-Array-Problem.png "[Solved] Search In Rotated Sorted Array Problem")
Search In Rotated Sorted Array: You have been given a sorted array/list ARR consisting of ‘N’ elements. You are also given an integer ‘K’. Now the array is rotated at some pivot point unknown to you. For example, if ARR…
Search In Rotated Sorted Array: Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1,…
![[Solved] Naming a Company LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Naming-a-Company-LeetCode-Contest-Problem.png "[Solved] Naming a Company LeetCode Contest Problem")
Naming a Company: You are given an array of strings ideas that represents a list of names to be used in the process of naming a company. The process of naming a company is as follows: Choose 2 distinct names from ideas, call them ideaA and ideaB. Swap…
![[Solved] Fair Distribution of Cookies LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Fair-Distribution-of-Cookies-LeetCode-Contest-Problem.png "[Solved] Fair Distribution of Cookies LeetCode Contest Problem")
Fair Distribution of Cookies: You are given an integer array cookies, where cookies[i] denotes the number of cookies in the ith bag. You are also given an integer k that denotes the number of children to distribute all the bags of cookies to. All the cookies in the same…
![[Solved] Minimum Path Cost in a Grid LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Minimum-Path-Cost-in-a-Grid-LeetCode-Contest-Problem.png "[Solved] Minimum Path Cost in a Grid LeetCode Contest Problem")
Minimum Path Cost in a Grid: You are given a 0-indexed m x n integer matrix grid consisting of distinct integers from 0 to m * n – 1. You can move in this matrix from a cell to any other cell in the next row. That is, if you are in…
![[Solved] Calculate Amount Paid in Taxes LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Calculate-Amount-Paid-in-Taxes-LeetCode-Contest-Problem.png "[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] Count Subarrays With Score Less Than K LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Count-Subarrays-With-Score-Less-Than-K-LeetCode-Contest-Problem.png "[Solved] Count Subarrays With Score Less Than K LeetCode Contest Problem")
Count Subarrays With Score Less Than K: The score of an array is defined as the product of its sum and its length. For example, the score of [1, 2, 3, 4, 5] is (1 + 2 + 3 + 4 + 5) * 5 = 75.…
![[Solved] Match Substring After Replacement LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Match-Substring-After-Replacement-LeetCode-Contest-Problem.png "[Solved] Match Substring After Replacement LeetCode Contest Problem")
Match Substring After Replacement: You are given two strings s and sub. You are also given a 2D character array mappings where mappings[i] = [oldi, newi] indicates that you may replace any number of oldi characters of sub with newi. Each character in sub cannot be replaced more than once. Return true if it is possible to make sub a substring…
![[Solved] Successful Pairs of Spells and Potions LeetCode Contest Problem](https://realcoder.techss24.com/wp-content/uploads/2022/06/Solved-Successful-Pairs-of-Spells-and-Potions-LeetCode-Contest-Problem.png "[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…