Cyclic Sort
Cyclic SortTime Complexcity: O(n)Space Complexity: O(1)for i in 0 to n-1: while nums[i] is not the value expected at the spot: let d = destination index to which nums[i] should…
API Rate Limiting System
Requirements 1. Threshold of 1 million qps for 1 hour 2. For example, https://github.com/changpil/pywork Limiting for framework API when users access to https://github.com/changpil/gowork 3. Public API, no username and password…
Substring Subset Permutation Combination
# O(n^3)import itertoolsdef substring(s): substrings = [] for i in range(len(s)): for j in range(i + 1, len(s)+1): substrings.append(s[i:j]) return substrings# O(2^N)def subset(s): store = [] running = [] def…
- 1
- 2
- 3
- 4
- …
- 10
- Go to the next page