Be Brave

LeetCode - Problems - Algorithms - 1470. Shuffle the Array Problem Description Given the array nums consisting of 2n elements in the form [x1, x2, ..., xn, y1, y2, ..., yn]. Return the array in the form [x1, y1, x2, y2, ..., xn, yn]. Example: Constraints: My Solution (Python) class Solution: def shuffle(self, nums, n): answer = [] for x in range(n): answer.append(nums[x]) # append x element answ..

LeetCode - Problems - Algorithms - 1365. How Many Numbers Are Smaller Than the Current Number Problem Description Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i] . Return the answer in an array. Example: Constraints: My Solution (Python) cl..

LeetCode - Problems - Algorithms - 1108. Defanging an IP Address Problem Description Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "." with "[.]". Example: Constraints: My Solution (Python) class Solution(object): def defangIPaddr(self, address): """ :type address: str :rtype: str """ return address.replace(".", "[.]")

LeetCode - Problems - Algorithms - 1431. Kids With the Greatest Number of Candies Problem Description Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has. For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multipl..

LeetCode - Problems - Algorithms - 1672. Richest Customer Wealth Problem Description You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the ith customer has in the jth bank. Return the wealth that the richest customer has. A customer's wealth is the amount of money they have in all their bank accounts. The richest customer is the customer that has the maximu..

LeetCode - Problems - Algorithms - 1480. Running Sum of 1d Array Problem Description Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]...nums[i]). Return the running sum of nums. Examples: Constraints: 1

Question Write the solution which returns an array that includes numbers capable of being divided by a divisor provided and in ascending order. If there is no divisible number, then return an array contains -1. Limitation arr is an array that includes only natural numbers. For integer i and j, if i =! j, then arr[i] =! arr[j]. The divisor is a natural number. array's length is equal or longer th..

Question Return the number of prime numbers between 1 and the given number n. The prime number can be divided only by 1 and itself. (1 is not a prime number) Limitation n a natural number that is more than or equal to 2 and less than or equal to 1000000. Example of I/O n result description 10 4 4 prime numbers [2, 3, 5, 7] between 1 and 10. 5 3 3 prime numbers [2, 3, 5] between 3 and 5. My Solut..

Question When two integers a and b are given, return the sum of integers between a and b. For example, when a is 3 and b is 5, 3 + 4+ 5 = 12, then return 12. Limitation If a and b are equal, return one of them. a and b is more than or equal to -10,000,000 and less than or equal to 10,000,000. a and b will be given regardless of size. Example of I/O a b return 3 5 12 3 3 3 5 3 12 My Solution def ..

Question You need to get the Kth number from an array that is between the Ith number and the Jth number in the given array. For example, if the given array = [1, 5, 2, 6, 3, 7, 4], i = 2, j = 5, and k = 3, [5, 2, 6, 3] is the array from the 2nd number to 5th number in the given array The array from the first step can be arranged in order ascending as [2, 3, 5, 6] 5 is the 3rd number in the array..