Hacktoberfest-accepted-2022

Hacktoberfest-accepted-2022 copied to clipboard

siddharthsahu23

good cpp problem

Hardikg13

# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def reverseKGroup(self, head: Optional[ListNode], k: int) ->...

DevilANANDGupta

# Definition for singly-linked list. # class ListNode(object): # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution(object): def mergeKLists(self, lists): """ :type lists: List[ListNode]...

DevilANANDGupta

class Solution: def isMatch(self, s: str, p: str) -> bool: m,n = len(s),len(p) DP = [[False for j in range(n+1)] for i in range(m+1)] DP[0][0] = True for i in...

DevilANANDGupta

class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: n1 = len(nums1) n2 = len(nums2) if n1 > n2: return self.findMedianSortedArrays(nums2, nums1) l = 0 r = n1 while...

DevilANANDGupta

class Solution: def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool: d = defaultdict(int) for i, num in enumerate(nums): if num in d and i - d[num]

DevilANANDGupta

class Solution: def containsNearbyDuplicate(self, nums: list[int], k: int) -> bool: d = defaultdict(int) for i, num in enumerate(nums): if num in d and i - d[num]

DevilANANDGupta

sabalanga06

Binary Trees

2

can we add Binary tree Data Structure Program?

Priyanshu-Aggarwal