CareerCup

nums = [2,3,1,4,3,2]
res = 1
for num in nums:
    res *= num
for num in nums:
    print(res / num)

nums = [2,3,1,4,3,2]
res = 1
for num in nums:
    res *= 1
for num in nums:
    print(res/num)

int[] tab = {2,3,1,4,3,2};
int p = 1;
for (int i=0;i<tab.length;i++)
   p = p * tab[i];

for(int i =0;i<tab.length;i++)
    console.writeline(p/tab[i]);

you can do this is 0(n)..

1. run through the loop to compute product which is the product of all the numbers.
2. Once you have product, run through a loop and divide product/arr[i] and and add it to a new array with the results.

// ZoomBA
nums = [  2,3,1,0, 4,3,2 ]
def do_yahoo( nums ){
  #(num_zeros, product)  = lfold ( nums ,[0, 1] ) -> {  
    if ( $.o == 0 ){ $.p.0 += 1 } else { $.p.1 *= $.o } 
    $.p  
  }
  product = num_zeros > 1 ? 0 : product 
  for ( nums ) {
    println ( $ == 0 ? product : (product/$) )
  }
}
do_yahoo ( nums )

Note the handling of zeros. Obviously, if there is one zero, the problem is non trivial. For multiple zeros, the problem is trivial again.

int[] tab = {2,3,1,4,3,2};
		for (int i = 0; i < tab.length; i++) {
			int res = 1;
			for (int j = 0; j < tab.length; j++) {
				if (i != j) {
					res = res * tab[j];
				}
			}
			System.out.println(res);
		}

int[] tab = {2,3,1,4,3,2};
		for (int i = 0; i < tab.length; i++) {
			int res = 1;
			for (int j = 0; j < tab.length; j++) {
				if (i != j) {
					res = res * tab[j];
				}
			}
			System.out.println(res);
		}

int[] tab = {2,3,1,4,3,2};
		for (int i = 0; i < tab.length; i++) {
			int res = 1;
			for (int j = 0; j < tab.length; j++) {
				if (i != j) {
					res = res * tab[j];
				}
			}
			System.out.println(res);
		}

int[] tab = {2,3,1,4,3,2};
	int product = 1;
	
	for(int i=0; i < tab.length; i++){
			product  = product *  tab[i];	
	}

	for(int i=0; i < tab.length; i++){
		System.out.print(product/tab[i]+" ");
	}

public int[] productExceptSelf(int[] nums) {
        if(nums.length == 0){
            return new int[0];
        }
        int[] result = new int[nums.length];
        result[0]=1;
        for(int i=1;i<nums.length;i++){
            result[i]=result[i-1]*nums[i-1];
        }
        int product = 1;
        for(int i=nums.length-1;i>=0;i--){
            result[i]=result[i]*product;
            product = product*nums[i];
        }
        return result;
    }

To solve this, we have to use two loops. Is it possible to do it with one loop? Any leads?

It is possible with one loop

Is it possible to do it with one loop?

int a[]={2,3,1,4,3,2},pro;
for(int i=0;i<6;i++){
pro=1;
for(int j=0;j<6;j++)
if(i!=j) pro*=a[j];
cout<<pro<<endl;
}

public static void printProduct(int[] arr) {
	int sum = 0, j = 0;
	for (int i = 0; i < arr.length; i++) {
		while (j < arr.length) {
			if (j == i) continue;
			sum *= arr[j];
			j++;
		}
		System.out.println(j);
	}
}

import java.util.Arrays;

public class ProductWholeArrayExceptElement {
	
	public static void main(String[] args){
	int[] arr = {2,3,4,1,5,2};
	System.out.println(Arrays.toString(printProductExceptElement(arr)));
	}

	static int prod = 1;
	
	private static int[] printProductExceptElement(int[] arr){
		int[] result = new int	[arr.length];
		
		for(int i=0;i<arr.length;i++){
			prod *= arr[i];
		}
		for(int i=0;i<arr.length;i++){
			result[i] = prod/arr[i];	
		}
		return result;
	}
}

Complexity - O(n)

The same as all previus posts

public static int[] GetProducts(int[] a)
{
	if (a == null || a.Length == 0)
		return new int[0];
	
	long product = 1;
	foreach (var numb in a)
		product *= numb;
	
	int[] result = new int[a.Length];
	for (int i=0; i < a.Length; i++)
		result[i] = (int)(product / a[i]);
	
	return result;
}

This problem we solve o(n) time complexity and o(1) space complexity but if anyone has better solution so please share thier solution.

printNum()
	{
		int arr[]={2,3,1,4,3,2};
		int size=sizeof(arr)/sizeof(arr[0]);
		for(i=0;i<size;i++)
		{
			mul = mul*arr[i];
		}
		for(i=0;i<size;i++)
		{
			printf("%d\n",mul/arr[i]);
		}
	}

public static void main(String[] args) {
		int [] arrays = {2,3,1,4,3,2};
		int sum = 1;
		for( int i = 0; i < arrays.length; i++ ){
			sum = sum * arrays[i];
		}
		
		for( int i = 0; i < arrays.length; i++ ){
			System.out.println( sum / arrays[i]);
		}
	}

my $length=@ARGV;
@ARRAY=@ARGV;
for(my $i = 0; $i <= $length-1; $i++)
{
        splice(@ARGV,$i,1);
        print eval(join ("*",@ARGV));
        print "\n";
        @ARGV=@ARRAY;
}

{
int [] nums = {2,3,1,4,3,2} ;
int product = 1;
for (int x : nums) {
product*= x;
}
for (int x : nums) {
System.out.println(product/x);
}
}