Be Brave

LeetCode - Problems - Database - 1179. Reformat Department Table 더보기 Given SQL Schema Create table If Not Exists Department (id int, revenue int, month varchar(5)) Truncate table Department insert into Department (id, revenue, month) values ('1', '8000', 'Jan') insert into Department (id, revenue, month) values ('2', '9000', 'Jan') insert into Department (id, revenue, month) values ('3', '10000'..

LeetCode - Problems - Algorithms - 1684. Count the Number of Consistent Strings Problem Description You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number of consistent strings in the array words. Example: Constraints: My Solution (Python) class Solution..

LeetCode - Problems - Algorithms - 1678. Goal Parser Interpretation Problem Description You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()" and/or "(al)" in some order. The Goal Parser will interpret "G" as the string "G", "()" as the string "o", and "(al)" as the string "al". The interpreted strings are then concatenated in the original or..

LeetCode - Problems - Algorithms - 1603. Design Parking System Problem Description Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. Implement the ParkingSystem class: ParkingSystem(int big, int medium, int small) Initialized object of the ParkingSystem class. The number of slots for e..

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..