My Solutions to Blind 75 - LeetCode Discuss
My Solutions to Blind 75 - LeetCode Discuss
#Transpose
n = len(matrix)
for i in range(n):
for j in range(i):
matrix[i][j], matrix[j][i] = matrix[j][i], matrix[i][j]
#Swap columns
for i in range(n):
matrix[i] = matrix[i][::-1]
//Go
func reverse(array []int) []int {
m := len(array)
for i := 0; i < m/2; i++ {
array[i], array[m-i-1] = array[m-i-1], array[i]
}
return array
}
Group Anagrams
Time Complexity: O(n ⋅ k log k) -|- k = length of longest anagram
Space Complexity: O(n)
#Python3
class Solution:
def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
mapper = {}
return list(mapper.values())
https://leetcode.com/discuss/interview-question/4915703/my-solutions-to-blind-75 1/1