mask ```python “”” initialize res, mask loop 32 bits, cnt cases any bit n& mask != 0, then move mask bit 1 forward return cnt cases “"”s class Solution: def hammingWeight(self, n: int) -> int: # time O(1) space O(1) mask = 1 res = 0 for i in range(32):...
[Read More]
LC154. Find Minimum in Rotated Sorted Array II
```python
class Solution:
def findMin(self, A: List[int]) -> int:
l,r = 0,len(A)-1
while l < r:
mid = l + (r - l)//2
if A[mid] > A[r]: #
l = mid + 1
elif A[mid] < A[r]:
r = mid
elif A[mid] == A[r]:
r -= 1
return A[l]
[Read More]
LC153. Find Minimum in Rotated Sorted Array
class Solution:
def findMin(self, A: List[int]) -> int:
l,r = 0, len(A)-1
while l < r:
mid = l + (r-l)//2
if A[mid] < A[r]:
r = mid
else:
l = mid + 1
return A[l]
[Read More]
LC158. Read N Characters Given Read4 II - Call multiple times
```python
[Read More]
LC554. Brick Wall
```python class Solution: def leastBricks(self, wall: List[List[int]]) -> int: “”” tc O(NM) sc O(L) N: len of wall ; M: max len of each row ; L : number of unique accuemutive sum main idea: break least bricks means for each list, presum at each point freq is the most...
[Read More]