Search for a command to run...
Articles tagged with #leetcode
Problem: https://leetcode.com/problems/contains-duplicate-ii/ Code: class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: # window = k seen_in_window = set() for i in range(len(nums)): ...
Problem: https://leetcode.com/problems/rearrange-array-elements-by-sign/ Code: class Solution: def rearrangeArray(self, nums: List[int]) -> List[int]: non_neg_nums = [] neg_nums = [] result = [] # Segregated non-n...
Problem: https://www.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1 Code: class Solution: def leaders(self, arr): leads = [] n = len(arr) maximum = arr[-1] # till will handle negatives # we will colle...
Problem: https://leetcode.com/problems/intersection-of-two-arrays/ Code: class Solution: def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]: result = set() n2 = set(nums2) for num in nums1: ...
Problem: https://leetcode.com/problems/missing-number/ Code: class Solution: def missingNumber(self, nums: List[int]) -> int: n = len(nums) actual_sum = sum(nums) expected_sum = (n * (n + 1))//2 # including the missing num...
Problem: https://leetcode.com/problems/second-largest-digit-in-a-string/ Code: class Solution: def secondHighest(self, s: str) -> int: dgts = set() for ch in s: if ch.isdigit(): dgts.add(int(ch)) ...