#leetcode
Read more stories on Hashnode
Articles with this tag
class Solution: def canMakeSubsequence(self, str1: str, str2: str) -> bool: if len(str2) > len(str1): return False ...
Way 1 - Using bit matrix class Solution: def largestCombination(self, candidates: List[int]) -> int: maxBits =...
class Solution: def rotateString(self, s: str, goal: str) -> bool: return len(goal) == len(s) and goal in s * 2
class Solution: def maxMoves(self, grid: List[List[int]]) -> int: ans = 0 def traverse(a, b, prevVal): nonlocal...
class Solution: def maxArea(self, height: List[int]) -> int: x = 0 l = len(height) y = l - 1 maxWater = 0 ...
class TrieNode: def __init__(self): self.children = {} self.is_end_of_word = False class Trie: def __init__(self): ...
