453-Minimum-Moves-To-Equal-Array-Elements

Sat 17 May 2025

https://leetcode.com/problems/minimum-moves-to-equal-array-elements

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def minMoves(self, nums: List[int]) -> int:
    mini = min(nums)
    return sum(num - mini for num in nums)
new Solution().minMoves()

Score: 5

Category: leetcode

Read More

454-4Sum-Ii

Sat 17 May 2025

https://leetcode.com/problems/4sum-ii

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def fourSumCount(self, A: List[int], B: List[int], C: List[int], D: List[int]) -> int:
    count = Counter(a + b for a in A for b in B)

    return …

Category: leetcode

Read More

457-Circular-Array-Loop

Sat 17 May 2025

https://leetcode.com/problems/circular-array-loop

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def circularArrayLoop(self, nums: List[int]) -> bool:
    def advance(i: int) -> int:
      return (i + nums[i]) % len(nums)

    if len(nums) < 2:
      return False

    for i, num in enumerate …

Category: leetcode

Read More

458-Poor-Pigs

Sat 17 May 2025

https://leetcode.com/problems/poor-pigs

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def poorPigs(self, buckets: int, minutesToDie: int, minutesToTest: int) -> int:
    return ceil(log(buckets) / log(minutesToTest // minutesToDie + 1))
new Solution().poorPigs()

Score: 5

Category: leetcode

Read More

459-Repeated-Substring-Pattern

Sat 17 May 2025

https://leetcode.com/problems/repeated-substring-pattern

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def repeatedSubstringPattern(self, s: str) -> bool:
    return s in (s + s)[1:-1]
new Solution().repeatedSubstringPattern()

Score: 5

Category: leetcode

Read More

46-Permutations

Sat 17 May 2025

https://leetcode.com/problems/permutations

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def permute(self, nums: List[int]) -> List[List[int]]:
    ans = []
    used = [False] * len(nums)

    def dfs(path: List[int]) -> None:
      if len(path) == len(nums):
        ans.append(path.copy …

Category: leetcode

Read More

462-Minimum-Moves-To-Equal-Array-Elements-Ii

Sat 17 May 2025

https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
import statistics


class Solution:
  def minMoves2(self, nums: List[int]) -> int:
    median = int(statistics.median(nums))
    return sum(abs(num - median) for num in nums)
new Solution().minMoves2()

Score: 5

Category: leetcode

Read More

463-Island-Perimeter

Sat 17 May 2025

https://leetcode.com/problems/island-perimeter

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def islandPerimeter(self, grid: List[List[int]]) -> int:
    m = len(grid)
    n = len(grid[0])

    islands = 0
    neighbors = 0

    for i in range(m):
      for j in range(n …

Category: leetcode

Read More

465-Optimal-Account-Balancing

Sat 17 May 2025

https://leetcode.com/problems/optimal-account-balancing

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def minTransfers(self, transactions: List[List[int]]) -> int:
    balance = [0] * 21

    for u, v, amount in transactions:
      balance[u] -= amount
      balance[v] += amount

    debt = [b for b in balance …

Category: leetcode

Read More

469-Convex-Polygon

Sat 17 May 2025

https://leetcode.com/problems/convex-polygon

import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
  def isConvex(self, points: List[List[int]]) -> bool:
    # Pq x qr
    def getCross(p: List[int], q: List[int], r: List[int]):
      return (q[0] - p[0]) * (r[1 …

Category: leetcode

Read More
Page 36 of 77

« Prev Next »