2684. Maximum Number of Moves in a Grid
class Solution: def maxMoves(self, grid: List[List[int]]) -> int: ans = 0 def traverse(a, b, prevVal): nonlocal count, ans if (a, b) in visited: return visited.add((a, b)) ...
Oct 30, 20241 min read2
Command Palette
Search for a command to run...
#backtracking
Articles tagged with #backtracking
40. Combination Sum II
class Solution: def combinationSum2(self, candidates: List[int], target: int) -> List[List[int]]: candidates.sort() N = len(candidates) ans = set() def checker(currentSum, nextIndex, nums): if currentS...
Aug 13, 20241 min read3
1255. Maximum Score Words Formed by Letters
class Solution: def maxScoreWords(self, words: List[str], letters: List[str], score: List[int]) -> int: L = len(words) ans = 0 def isValid(word, letters): safe = letters.copy() localScore = 0 ...
May 25, 20241 min read3
2597. The Number of Beautiful Subsets
Approch 1 : Using Array class Solution: def beautifulSubsets(self, nums: List[int], k: int) -> int: ans = 0 def checkBeauty(arr, num): for e in arr: if abs(e - num) == k: return Fal...
May 23, 20241 min read4
131. Palindrome Partitioning
class Solution: def partition(self, s: str) -> List[List[str]]: def checkPalindrome(word): return word == word[::-1] ans = [] def backtrack(index, prev, temp): nonlocal ans if index >= ...
May 22, 20241 min read4
78. Subsets
class Solution: def subsets(self, nums: List[int]) -> List[List[int]]: L = len(nums) ans = [[]] def recurse(index, arr): nonlocal ans if index < L: recurse(index + 1, arr + [nums[in...
May 21, 20241 min read4