#array
Read more stories on Hashnode
Articles with this tag
class Solution: def construct2DArray(self, original: List[int], m: int, n: int) -> List[List[int]]: idealSize = len(original) if...
class Solution: def frequencySort(self, nums: List[int]) -> List[int]: c = Counter(nums) v = [x[0] for x in...
class Solution: def minDifference(self, nums: List[int]) -> int: n = len(nums) if n <= 4: return 0 ...
class Solution: def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]: c1 = Counter(nums1) c2 = Counter(nums2) ...
class Solution: def threeConsecutiveOdds(self, arr: List[int]) -> bool: count = 0 for e in arr: if e % 2: ...
class Solution: def maxSatisfied(self, customers: List[int], grumpy: List[int], minutes: int) -> int: satisfiedCustomers = 0 ...
