LeetCode: Find Sqrt(x)
Problem: https://leetcode.com/problems/sqrtx/description/ Code: class Solution: def mySqrt(self, x: int) -> int: if x <= 1: return x low, high = 1, x // 2 while low <= high: mid = (low + high) // 2...
Dec 16, 20252 min read1
Command Palette
Search for a command to run...
#binary-search-algorithm
Articles tagged with #binary-search-algorithm
LeetCode: Minimum Number of Days to Make m Bouquets
Problem: https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/ Code: class Solution: def minDays(self, bloomDay: List[int], m: int, k: int) -> int: # we need m bouquets # each bouquets should have k adjacent flo...
Dec 3, 20253 min read1LeetCode: Binary Search
Problem: https://leetcode.com/problems/binary-search/description/ Code: class Solution: def search(self, nums: List[int], target: int) -> int: if not nums: return -1 low, high = 0, len(nums)-1 while low<=high...
Nov 24, 20251 min read