Be Brave

LeetCode - Problems - Algorithms - 1528. Shuffle String Problem Description Given a string s and an integer indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuffled string. Return the shuffled string. Example: Constraints: My Solution (Python) class Solution(object): def restoreString(self, s, indices): """ :type s:..

LeetCode - Problems - Algorithms - 1512. Number of Good Pairs Problem Description Given an array of integers nums. A pair (i, j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example: Constraints: My Solution (Python) class Solution(object): def numIdenticalPairs(self, nums): """ :type nums: List[int] :rtype: int """ answer = 0 length = len(nums) for i in range..

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 - Database - 620. Not Boring Movies 더보기 Given SQL Schema Create table If Not Exists cinema (id int, movie varchar(255), description varchar(255), rating float(2, 1)) Truncate table cinema insert into cinema (id, movie, description, rating) values ('1', 'War', 'great 3D', '8.9') insert into cinema (id, movie, description, rating) values ('2', 'Science', 'fiction', '8.5') inser..

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

LeetCode - Problems - Database - 627. Swap Salary 더보기 Given SQL Schema create table if not exists salary(id int, name varchar(100), sex char(1), salary int) Truncate table salary insert into salary (id, name, sex, salary) values ('1', 'A', 'm', '2500') insert into salary (id, name, sex, salary) values ('2', 'B', 'f', '1500') insert into salary (id, name, sex, salary) values ('3', 'C', 'm', '5500..