[Python] zip()
zip() zip(*iterables, strict=False) zip() returns an iterator of tuples, where the i-th tuple contains the i-th element from each of the argument iterables. Like: zip([1, 2, 3], ['sugar', 'spice', 'ev ...
[Python] Unpacking, *identifier / **identifier
Unpacking x, y, z = coordinates *iterable print(1, *[2, 3]) ⇒ 1, 2, 3 print([*[1, 2], *[3, 4]]) ⇒ 1, 2, 3, 4 first, second, *other = customers | first, *middle, last = name dict_3 = {**dict_1, **dict_ ...
Leetcode # 8. String to Integer (atoi)
- 2023.07.21
- Deterministic Finite Automaton LeetCode Parsing
https://leetcode.com/problems/string-to-integer-atoi Solution Time Complexity: O(len(s)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class Soluti ...
Leetcode # 418. Sentence Screen Fitting
- 2023.07.21
- LeetCode
https://leetcode.com/problems/sentence-screen-fitting Solution Time Complexity: O(rows * cols) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class ...
Leetcode # 249. Group Shifted Strings
- 2023.07.20
- Hash Table LeetCode set
https://leetcode.com/problems/group-shifted-strings Solution Time Complexity: O(len(strings)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class S ...
Leetcode # 305. Number of Islands II
- 2023.07.20
- Disjoint Set Union LeetCode
https://leetcode.com/problems/number-of-islands-ii Solution Time Complexity: O(len(positions)) Space Complexity: O(len(positions)) (The input and output generally do not count towards the space comple ...
Leetcode # 65. Valid Number
https://leetcode.com/problems/valid-number Solution Time Complexity: O(len(s)) Space Complexity: O(1) (The input and output generally do not count towards the space complexity.) class Solution: def is ...
Leetcode # 735. Asteroid Collision
https://leetcode.com/problems/asteroid-collision Solution Time Complexity: O(len(asteroids)) Space Complexity: O(len(asteroids)) (The input and output generally do not count towards the space complexi ...
Diagnal & Anti-Diagnal
- 2023.07.20
- Data Structure LeetCode
\begin{align} & Diagnal & := \ & matrix[i][i] & \text{ for } i = 0, 1, …, n \\ & Anti-diagnal & := \ & matrix[i][n – i] & \text{ for } i = 0, 1, …, n ...
Leetcode # 54. Spiral Matrix
https://leetcode.com/problems/spiral-matrix Solution Time Complexity: O(len(matrix) * len(matrix[0])) Space Complexity: O(len(matrix) * len(matrix[0])) (The input and output generally do not count tow ...
