```python
from collections import defaultdict
class Node:
def init(self,key,value):
self.key = key
self.val = value
self.cnt = 1
self.prev = None
self.next = None
[Read More]
Lc1295
solution 1
```python
class Solution:
def findNumbers(self, nums: List[int]) -> int:
res = 0
for num in nums:
if len(str(num)) % 2 == 0:
res += 1
return res
[Read More]
LC1331 Rank Transform of an Array
Given an array of integers arr, replace each element with its rank.
[Read More]
LC1297 Maximum Number of Occurrences of a Substring
```python class Solution: # main idea: if a string has appeared x times, then its substring at least appeares x times # time O(KN) space (KN) where K is minSize def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int: d = {} str_len = len(s) for i...
[Read More]
LC1282 Group the People Given the Group Size They Belong To
Group the People Given the Group Size They Belong To
[Read More]