Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions diagonal_traverse.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution:
def findDiagonalOrder(self, mat: List[List[int]]) -> List[int]:

hash_map=defaultdict(list)

result = []

for i in range(len(mat)):
for j in range(len(mat[0])):

hash_map[i+j].append(mat[i][j])



limit = (len(mat)+len(mat[0]))
for i in range(limit):
curr_res = hash_map[i]

if (i%2==0):
curr_res= curr_res[::-1]

for i in curr_res:
result.append(i)

return result


30 changes: 30 additions & 0 deletions product_array_except_self.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:

left_product_arr = [1]*(len(nums)+1)

right_product_arr = [1]*(len(nums)+1)

res = [1]*(len(nums))

left_sum = 1

right_sum = 1

for i in range(len(nums)):

left_sum*=nums[i]
right_sum*=nums[len(nums)-1-i]

left_product_arr[i+1] = left_sum
right_product_arr[len(nums)-1-i] = right_sum


for i in range(len(nums)):

res[i] = left_product_arr[i]*right_product_arr[i+1]


return res


29 changes: 29 additions & 0 deletions spiral_matrix.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
class Solution:
def spiralOrder(self, matrix: List[List[int]]) -> List[int]:
top,left, bottom, right = 0,0,len(matrix)-1, len(matrix[0])-1
result = []

while(top<=bottom and left<=right):

for i in range(top, right+1):
result.append(matrix[top][i])
top+=1

for i in range(top, bottom+1):
result.append(matrix[i][right])
right-=1

if(left>right or top>bottom):
break

for i in range(right, left-1,-1):
result.append(matrix[bottom][i])
bottom-=1


for i in range(bottom, top-1, -1):
result.append(matrix[i][left])
left+=1

return result