Merge branch 'SarthakKeshari:master' into master

Author: neelshah2409

Arrays/1D Arrays/intersectionOfTwoArrays.java

@@ -0,0 +1,46 @@
+/*
+Given two arrays arr1 and arr2. We need to find the intersection of both the arrays and return the result as a list.
+*/
+
+import java.util.*;
+
+public class intersectionOfTwoArrays{
+    
+    public static void main(String[] args){
+        Scanner sc = new Scanner(System.in);
+        int n1 = sc.nextInt();
+        int[] arr1 = new int[n1];
+        int n2 = sc.nextInt();
+        int[] arr2 = new int[n2];
+        for(int i = 0; i < n1; i++){
+            arr1[i] = sc.nextInt();
+        }
+        for(int i = 0; i < n1; i++){
+            arr2[i] = sc.nextInt();
+        }
+        intersection(arr1, arr2, n1, n2);
+        sc.close();
+    }
+    
+    public static void intersection(int[] a,int[] b, int n, int m){
+        HashMap<Integer,Integer> map = new HashMap<>();     // created a hashmap which will store distinct elements with their frequencies
+        for(int i = 0; i < n; i++){
+            map.put(a[i],map.getOrDefault(a[i],0)+1);      // updating frequencies of each element
+        }
+        int[] arr = new int[100001];        // created an array which will store the elements which are present in both the arrays
+        Arrays.fill(arr,0);              
+        for(int i = 0; i < m; i++){
+            if(map.containsKey(b[i])){   // updating array which contains elements that are present in both the arrays
+                arr[b[i]] = 1;
+            }
+        }
+        ArrayList<Integer> al = new ArrayList<>();     // creating a list 
+        for(int i = 0; i < m; i++){
+            if(arr[b[i]]==1){                // checking if the element is present in both the arrays or not
+                al.add(b[i]);                // adding the elements to the list
+            }
+        }
+        System.out.println(al);
+    }
+
+}

Arrays/1D Arrays/longestAscendingSequence.java

@@ -0,0 +1,83 @@
+import java.util.Scanner;
+
+/**
+ * Write a program that reads an array of ints and outputs the length of the longest sequence in strictly ascending order. 
+ * Print the elements of longest ascending sequence in an array
+ * Elements of the sequence must go one after another. A single number is assumed to be an ordered sequence with the length = 1.
+ */
+
+public class longestAscendingSequence {
+    
+    public static void main(String[] args) {
+        
+        //Read elements and size
+        Scanner scanner = new Scanner(System.in);
+        int tam = scanner.nextInt();
+        int[] numbers = new int[tam];
+
+        for (int i = 0; i < numbers.length; i++) {
+            numbers[i] = scanner.nextInt();
+        }
+        
+        //Defining auxiliary variables
+
+        int maxTmp = 0;
+        int count = 1;
+        int pos = -1;
+
+        //Traverse the array and increment the amount by 1 the longest amount in the array, in addition to obtaining the position
+        for (int i = 0; i < numbers.length - 1; i++) {
+            if (numbers[i] < numbers[i + 1]) {
+                ++count;
+            } else {
+                if (count > maxTmp) {
+                    maxTmp = count;
+                    pos = i;
+                }
+                count = 1;
+            }
+        }
+
+        //Check if count or maxTemp is the highest to assign the position from which the numbers will start printing
+        if (maxTmp > count) {
+            pos = (pos - maxTmp);
+        }
+
+        //Get max value
+        int max = Math.max(count, maxTmp);
+        System.out.println("The max value is : " + max);
+
+        //Print elements
+        for (int i = pos + 1; i <= pos + max; i++) {
+            System.out.print(numbers[i] + " ");
+        }
+
+        scanner.close();
+
+
+        /*
+        Value test
+        10
+        1 2 4 1 2 3 5 7 4 3
+
+        12
+        1 2 4 1 2 3 5 7 8 9 10 11
+
+        20
+        1 2 4 1 2 3 5 7 4 3 5 8 9 10 12 15 16 2 5 6
+
+        15
+        1 0 2 4 6 3 8 7 0 1 5 8 2 1 3
+
+        3
+        1 2 4
+
+        4
+        1 2 0 0
+
+        8
+        1 2 3 4 5 6 0 3*/
+
+    }
+    
+}

Arrays/2D Arrays/matrixAddition.java

@@ -0,0 +1,60 @@
+//Addition of 2 n*n matrices
+//this program works for m*n matrices also!
+import java.util.Scanner;
+public class matrixAddition {
+
+	public static void main(String[] args) {
+		Scanner reader=new Scanner(System.in);
+		
+		int matrix_1[][];
+		int matrix_2[][];
+		int add_matrix[][];
+		
+		//taking input of number of rows and columns from user
+		 System.out.println("enter row size of both matrices to be added :");
+		 int row = reader.nextInt();
+		 System.out.println("enter column size of both matrices to be added :");
+		 int col = reader.nextInt();
+		 
+		 // declaring matrices of user defined rows and columns
+	     matrix_1 = new int[row][col];
+	     matrix_2 = new int[row][col];
+	     add_matrix = new int[row][col];
+	     
+		 //entering elements in matrix 1
+	     System.out.println("Enter elemtents in Matrix 1\n");
+	     for(int i=0; i<row; i++){
+	         for(int j=0; j<col; j++){
+	             matrix_1[i][j] = reader.nextInt();
+	         }
+	     }
+	     
+		 //entering elements in matrix 2
+	     System.out.println("Enter elemtents in Matrix 2\n");
+	     for(int i=0; i<row; i++){ 
+	         for(int j=0; j<col; j++){
+	             matrix_2[i][j] = reader.nextInt();
+	         }
+	     }
+	     
+	    // adding matrix 1 and 2
+	     for( int i=0; i<row; i++){
+	         for(int j=0; j<col; j++){
+	             add_matrix[i][j] = matrix_1[i][j] + matrix_2[i][j];
+	         }
+	     }
+	     
+		 // Printing output matrix
+	     System.out.println("Resultant Matrix: \n");
+	     for(int i=0; i<row; i++){
+	         for(int j=0; j<col; j++){
+	        	 System.out.print(add_matrix[i][j]+" ");
+	        	 
+	         } System.out.println();
+	     }
+	     
+	    
+		
+	}
+
+}

Arrays/2D Arrays/matrix_Multiplication.java

@@ -0,0 +1,68 @@
+// Q. matrix multiplication in java ?
+
+import java.util.Scanner;
+
+public class matrix_Multiplication {
+    public static void main(String args[]) {
+
+        int m, n, p, q, sum = 0, c, d, k;
+        Scanner in = new Scanner(System.in);
+
+        System.out.print("Enter Number of Rows and Columns of First Matrix : ");
+        m = in.nextInt(); // enter no. of rows of first matrix
+        n = in.nextInt(); // enter no. of vplumns of first matrix
+
+        int first[][] = new int[m][n];
+
+        System.out.print("Enter First Matrix Elements : ");
+
+        for (c = 0; c < m; c++) {
+            for (d = 0; d < n; d++) {
+                first[c][d] = in.nextInt(); // here we have to enter first matrix's element
+            }
+        }
+
+        System.out.print("Enter Number of Rows and Columns of Second Matrix : ");
+        p = in.nextInt(); // enter no. of vplumns of second matrix
+        q = in.nextInt(); // enter no. of vplumns of second matrix
+
+        if (n != p) {
+            System.out.print("Matrix of the entered order can't be Multiplied..!!");
+        } else {
+            int second[][] = new int[p][q];
+            int multiply[][] = new int[m][q];
+
+            System.out.print("Enter Second Matrix Elements :\n");
+
+            for (c = 0; c < p; c++) {
+                for (d = 0; d < q; d++) {
+                    second[c][d] = in.nextInt(); // here we have to enter second matrix's element
+                }
+            }
+
+            System.out.print("Multiplying both Matrix...\n");
+
+            for (c = 0; c < m; c++) {
+                for (d = 0; d < q; d++) {
+                    for (k = 0; k < p; k++) {
+                        sum = sum + first[c][k] * second[k][d];
+                    }
+
+                    multiply[c][d] = sum; // here sum is the element of multiply matrix and one by one element will be inserted
+                    sum = 0;
+                }
+            }
+
+            System.out.print("Multiplication Successfully performed..!!\n");
+            System.out.print("Now the Matrix Multiplication Result is :\n");
+
+            for (c = 0; c < m; c++) {
+                for (d = 0; d < q; d++) {
+                    System.out.print(multiply[c][d] + "\t"); // multiply matrix output
+                }
+                System.out.print("\n");
+            }
+        }
+
+    }
+}

Basic Codes/TempConversion.java

@@ -0,0 +1,37 @@
+import java.util.Scanner;
+
+public class TempConversion {
+    public static void main(String[] args) {
+                                        // Question: Convert the temperature from celsius to fahrenheit and Fahrenheit to
+                                        // Celsius according to the user`s choice provided by the input
+
+        System.out.println("To convert from Celsius to Fahrenheit Enter 0\n" + "To convert from Fahrenheit to Celsius enter 1");    // Asking user for input
+
+        Scanner input = new Scanner(System.in);
+        int n = input.nextInt();        // Taking input to choose the temperature conversion
+
+        switch (n) {
+
+            case 0:
+                System.out.println("Enter the temperature in Celsius");
+
+                float temp = input.nextFloat();             // Taking the temperature in celsius
+                double ans = ((temp * 9) / 5) + 32;         // Formula to calculate the temperature in celsius
+
+                System.out.printf("The %.3f degree celsius = %.3f Fahrenheit", temp, ans);
+                break;
+
+            case 1:
+                System.out.println("Enter the temperature in Fahrenheit");
+
+                temp = input.nextFloat();                   // Taking the temperature in celsius
+                ans = ((temp - 32) * 5) / 9;                // Formula to calculate the temperature in celsius
+
+                System.out.printf("The %.3f = %.3f degree celsius", temp, ans);
+                break;
+
+            default:            // Showing the message if user provides invalid argument
+                System.out.println("Enter valid input");
+        }
+    }
+}

Bit Manipulation/IsNthBitSet.java

@@ -0,0 +1,42 @@
+/*
+Problem Statement: Given two numbers 'a' and 'n', check if nth bit is set in 'a'. Consider 0 based indexing.
+Idea: Do a bitwise AND operation with 1 at the nth position. If the result is non-zero bit is set otherwise
+it is unset.
+
+Examples:
+
+Input: 4 2
+Output: Bit is unset at position 2
+
+Input: 10 4
+Output: Bit is set at position 4
+ */
+
+import java.util.Scanner;
+
+public class IsNthBitSet {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int a = sc.nextInt();
+        int n = sc.nextInt();
+
+        checkNthBit(a, n);
+    }
+
+    public static void checkNthBit(int a, int n) {
+        //Create a mask that has only nth bit set
+        int mask = 1 << (n - 1);
+
+        //If nth bit is set in 'a' then bitwise AND with mask
+        //will give non-zero result
+        if ((a & mask) != 0) {
+            System.out.println("Bit is set at position " + n);
+        }
+        //If nth bit is unset in 'a' then bitwise AND with mask
+        //will give zero result
+        else {
+            System.out.println("Bit is unset at position " + n);
+        }
+    }
+}