1382. Balance a Binary Search Tree# Definition for a binary tree node. # class TreeNode: # def __init__(self, val=0, left=None, right=None): # self.val = val # self.left = left # self.right = right class Solution: def balanceBST(self, root: TreeNode) -...Feb 9, 2026·1 min read
2566. Maximum Difference by Remapping a Digitclass Solution: def minMaxDifference(self, num: int) -> int: snum = str(num) maxNum = minNum = snum for e in str(num): if int(e) < 9 and maxNum == snum: maxNum = snum.replace(e, "9") ...Jun 14, 2025·1 min read
2616. Minimize the Maximum Difference of Pairsclass Solution: def minimizeMax(self, nums: List[int], p: int) -> int: l = len(nums) def canMakePairs(maxDiff): count = 0 i = 1 while i < len(nums): if nums[i] - nums[i - 1] <= ...Jun 14, 2025·1 min read
3423. Maximum Difference Between Adjacent Elements in a Circular Arrayclass Solution: def maxAdjacentDistance(self, nums: List[int]) -> int: nums = [nums[-1]] + nums maxDiff = 0 for i in range(len(nums) - 1): a = nums[i] b = nums[i + 1] diff = abs(a - b)...Jun 14, 2025·1 min read
1863. Sum of All Subset XOR Totalsclass Solution: def subsetXORSum(self, nums: List[int]) -> int: l = len(nums) s = 0 def traverse(prev, index): nonlocal s if index + 1 >= l: s += prev return ...Apr 5, 2025·1 min read
2206. Divide Array Into Equal Pairsclass Solution: def divideArray(self, nums: List[int]) -> bool: c = Counter(nums) for e in c: if c[e] % 2 != 0: return False return TrueMar 17, 2025·1 min read
CSS Battle March 16thhttps://cssbattle.dev/play/NkhAQ3q5hgG6BFMP39Ll <div class="parent"> <div class="child"></div> <div class="child"></div> <div class="child"></div> <div class="child"></div> </div> <!-- <div class="square"></div> --> <style> body { bac...Mar 16, 2025·1 min read
