16. Product array puzzle

-

16. Product array puzzle

\

Problem link :- click here


package program;

public class Searching__16
{

	/*
	 	Given an array arr[] of size n, construct a product array p[] of same size n
	 	such that p[i] is equal to the products of all the elements of arr[] except arr[i]
	 			arr[] ={10, 3, 5, 6, 2}	
	 			output : {180, 600, 360, 300, 900}
	 	
	 	We will take two arrays left array and a right array 
	 	left array will have the product of the elements to the left of that element
	 	similarly right array 
	 	
	 	and we will store the p[] with the product of all elements except itself
	 */
	
	static int[] productExceptSelf(int arr[], int n)
	{
		int left[] = new int[n];
		int right[] = new int[n];
		
		//initiating left array 
		left[0] = 1;
		for(int i=1; i<n; i++)
			left[i] = left[i-1] * arr[i-1];
		
		//initiating right array 
		right[n-1] = 1;
		for(int i=n-2; i>=0; i--)
			right[i] = right[i+1] * arr[i+1];
		
		//initiating the product array
		int product[] = new int[n];
		for(int i=0; i<n; i++)
        		product[i] = left[i] * right[i];
		
		return product;
	}
	
	public static void main(String[] args)
	{
		int arr[] = {10, 3, 5, 6, 2};
		int ans[] = productExceptSelf(arr, arr.length);
		System.out.println("Product array is : ");
		for(int i=0; i<ans.length; i++)
			System.out.print(ans[i] + " ");
	}

}

Time copmplexity :- O(n)
Space complexity :- O(n)

Comments

Post a Comment

Popular posts from this blog

4.Sort an array of 0's, 1's & 2's.

-
Image
4.Sort an array of 0's, 1's & 2's. Problem link :- click here C code #include<stdio.h> void swap(int *a, int *b) { int temp; temp = *a; *a = *b; *b = temp; } void sort_012(int A[], int n) { int i, j, m; i = 0; j = n-1; m = 0; while(m<=j) { if(A[m] == 0) { swap(&A[i], &A[m]); i++; m++; } else if(A[m] == 1) { m++; } else { swap(&A[j], &A[m]); j--; } } } void main() { int arr[30]; int n, i; printf("Enter the size of the array\n"); scanf("%d",&n); printf("Enter the elements of the array(only 0, 1, or 2)\n"); for(i=0; i<n; i++) scanf("%d",&arr[i]); printf("Given Array\n"); for(i=0; i<n; i++) printf("\t%d",arr[i]); printf("\n...
Read more

1. Reverse

-
Image
1. Reverse the Array.   Problem link :- Reverse the array Algorithm idea :- C code //Reverse the array #include<stdio.h> void rev_arr(int arr[], int start, int end) { int temp; while(start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } void print_arr(int arr[], int size) { int i; for(i=0; i<size; i++) printf("\t%d",arr[i]); printf("\n"); } void main() { int arr1[30]; int n, i; printf("Enter the size of the array\n"); scanf("%d",&n); printf("Enter the elements of the array\n"); for(i=0; i<n; i++) scanf("%d",&arr1[i]); printf("Array before reversing\n"); print_arr(arr1, n); rev_arr(arr1, 0, n-1); printf("\nArray after reversing\n"); print_arr(arr1, n); } Java code //Reverse the array package programs;...
Read more

3. Height of Binary tree

-
3. Height of Binary tree Problem link :- click here package Binary_Tree; public class BinaryTree__3 { static int heightOfTree(Node root) { if(root == null) return 0; int left_height = heightOfTree(root.left); int right_height = heightOfTree(root.right); return Math.max(left_height, right_height) + 1; } public static void main(String[] args) { BinaryTree tree = new BinaryTree(); int arr[] = {2, -1, 3, -1, -1, 3}; tree.root = tree.createTree(arr, 0); int ans = heightOfTree(tree.root); System.out.println("Height : " + ans); } } Time complexity :- O(n) Space complexity :- O(n)
Read more