Completed Array-1

[sreevardhan1099]

Problem 1
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:

Input: [1,2,3,4] Output: [24,12,8,6] Note: Please solve it without division and in O(n).

Follow up: Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

Problem 2
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.

Example:

Input:

[

[ 1, 2, 3 ],

[ 4, 5, 6 ],

[ 7, 8, 9 ]

]

Output: [1,2,4,7,5,3,6,8,9]

Problem 3
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Example 1:

Input:

[

[ 1, 2, 3 ],

[ 4, 5, 6 ],

[ 7, 8, 9 ]

] Output: [1,2,3,6,9,8,7,4,5] Example 2:

Input:

[

[1, 2, 3, 4],

[5, 6, 7, 8],

[9,10,11,12]

] Output: [1,2,3,4,8,12,11,10,9,5,6,7]

[super30admin]

• The student's solution for "Product Except Self" is excellent. It correctly implements the optimal approach with O(n) time and O(1) space complexity.
• The comments are helpful and explain the approach clearly.
• The code is clean and follows best practices.
• The student should ensure that all files are relevant to the problem being evaluated. In this case, the other files (Problem-2.py and Problem-3.py) are not related to the "Product Except Self" problem and should not be included in the evaluation for this specific problem.