Login

All Problems

Problem title

Difficulty

Avg time to solve

N-th Fibonacci Number

Moderate

40 mins

Product Of Array Except Self

Easy

26 mins

K Largest Element

Moderate

10 mins

Search In Rotated Sorted Array

Moderate

30 mins

Two Sum

Easy

10 mins

Subset OR

Moderate

20 mins

Find Unique

Easy

--

Count all sub-arrays having sum divisible by k

Moderate

15 mins

Average Marks

Easy

5 mins

Sum Of Max And Min

Easy

10 mins

Problem

Submissions

82

Avg. time to solve

26 min

Problem Statement

```
Each product can cross the integer limits, so we should take modulo of the operation.
Take MOD = 10^9 + 7 to always stay in the limits.
```

```
Can you try solving the problem in O(1) space?
```

```
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first line of each test case or query contains an integer 'N' representing the size of the array/list.
The second line contains 'N' single space-separated integers representing the elements in the array/list.
```

```
For each test case, print the elements of the 'PRODUCT' array separated by a single space.
Output for every test case will be printed in a separate line.
```

```
You are required to return the product array and no need to print the result explicitly. It has already been taken care of.
```

```
1 <= T <= 100
0 <= N <= 10^5
0 <= ARR[i] <= 10^5
Time Limit: 1 sec
```

```
2
3
1 2 3
3
5 2 2
```

```
6 3 2
4 10 10
```

```
Test case 1 : Given array = {1, 2, 3]
Required array = [2 * 3, 1 * 3, 1 * 2] = [6, 3, 2]
Test case 2 : Given array = {5, 2, 2]
Required array = [2 * 2, 5 * 2, 5 * 2] = [4, 10, 10]
```

```
2
1
100
2
1 2
```

```
1
2 1
```

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Language

Change Theme

Solution submission not allowed

Save Code

Reset Code