https://leetcode.com/problems/hand-of-straights
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def isNStraightHand(self, hand: List[int], W: int) -> bool:
count = Counter(hand)
for start in sorted(count):
value = count[start]
if value > 0:
for i in range(start, start …Category: leetcode
Read Morehttps://leetcode.com/problems/shortest-path-visiting-all-nodes
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def shortestPathLength(self, graph: List[List[int]]) -> int:
n = len(graph)
goal = (1 << n) - 1
ans = 0
q = deque() # (u, state)
seen = set()
for i in range(n):
q …Category: leetcode
Read Morehttps://leetcode.com/problems/shifting-letters
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def shiftingLetters(self, s: str, shifts: List[int]) -> str:
ans = []
for i in reversed(range(len(shifts) - 1)):
shifts[i] += shifts[i + 1]
for c, shift in zip(s …Category: leetcode
Read Morehttps://leetcode.com/problems/maximize-distance-to-closest-person
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def maxDistToClosest(self, seats: List[int]) -> int:
n = len(seats)
ans = 0
j = -1
for i in range(n):
if seats[i] == 1:
ans = i if j == -1 else …Category: leetcode
Read Morehttps://leetcode.com/problems/maximal-rectangle
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def maximalRectangle(self, matrix: List[List[str]]) -> int:
if not matrix:
return 0
ans = 0
hist = [0] * len(matrix[0])
def largestRectangleArea(heights: List[int]) -> int:
ans = 0
stack …Category: leetcode
Read Morehttps://leetcode.com/problems/rectangle-area-ii
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def rectangleArea(self, rectangles: List[List[int]]) -> int:
events = []
for x1, y1, x2, y2 in rectangles:
events.append((x1, y1, y2, 's'))
events.append((x2, y1, y2, 'e'))
events …Category: leetcode
Read Morehttps://leetcode.com/problems/loud-and-rich
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def loudAndRich(self, richer: List[List[int]], quiet: List[int]) -> List[int]:
graph = [[] for _ in range(len(quiet))]
for u, v in richer:
graph[v].append(u)
@functools …Category: leetcode
Read Morehttps://leetcode.com/problems/peak-index-in-a-mountain-array
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def peakIndexInMountainArray(self, arr: List[int]) -> int:
l = 0
r = len(arr) - 1
while l < r:
m = (l + r) // 2
if arr[m] < arr[m + 1]:
l = m + 1 …Category: leetcode
Read Morehttps://leetcode.com/problems/car-fleet
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def carFleet(self, target: int, position: List[int], speed: List[int]) -> int:
ans = 0
times = [
float(target - p) / s for p, s in sorted(zip(position, speed),
reverse=True …Category: leetcode
Read Morehttps://leetcode.com/problems/k-similar-strings
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def kSimilarity(self, s1: str, s2: str) -> int:
ans = 0
q = deque([s1])
seen = {s1}
while q:
for _ in range(len(q)):
curr = q.popleft()
if curr == s2 …Category: leetcode
Read More