Merge branch 'main' into main

Author: Moutasim02

Programs/PrintPattern.java

@@ -0,0 +1,24 @@
+/**
+ * Program to print a pattern using nested for loops
+ * eg:- *
+ *      * *
+ *      * * *
+ *      * * * *
+ *      * * * * *
+ * @author arshcoder13 - https://github.com/arshcoder13/
+ **/
+
+public class PrintPattern {
+
+    public static void main(String args[]){
+
+        for(int i=1;i<=5;i++){
+            for(int j=1;j<=i;j++){
+                System.out.print("* ");
+            }
+            System.out.println();
+        }
+        
+    }
+    
+}

Programs/Two_Sum.java

@@ -0,0 +1,47 @@
+//In this code a array is taken along with an target element. The sum of two elements matching with the target element is displayed
+
+
+import java.util.*;
+public class Two_Sum {
+    public static void main(String args[])
+    {
+        try (Scanner sc = new Scanner(System.in)) {
+            int n = sc.nextInt();
+            // length of the array is taken
+            int a[] = new int[n];
+            for(int i = 0; i < n; i++)
+            {
+                a[i] = sc.nextInt();
+            }
+            int target=sc.nextInt();
+            // target value is initialzized
+            int array[] = new int[2];
+            a=twoSum(array,target);
+            // method is called
+            for(int i=0;i<2;i++)
+            {
+                System.out.print(a[i]+" ");
+            }
+            System.out.println();
+        }
+    }
+    public static int[] twoSum(int[] n, int target) {
+        Map<Integer,Integer> nm=new HashMap<>();
+        // hashmap is created to store the array elements
+        int array[]=new int[2];
+        int k=n.length;
+        for(int i=0;i<k;i++)
+        {
+            if(nm.containsKey(target-n[i]))
+            {
+                array[0]=nm.get(target-n[i]);
+                array[1]=i;
+                break;
+                // The sum of the elements equals to the target is storee
+            }
+            nm.put(n[i],i);
+        }
+        return array;
+        // the answer array is returned
+    }
+}

README.md

@@ -111,10 +111,13 @@ It is very easy to contribute, you may follow these steps -
 84. [Sieve of Eratosthenes](https://github.com/siddhant2002/Java-1/blob/main/Programs/Sieve_Of_Eratosthenes.java) - Program to multiply two matrices.
 85. [Reverse a LinkedList](https://github.com/siddhant2002/Java-1/blob/main/Programs/ReverseList.java) - Program to reverse a linkedList.
 86. [Peg Solitaire](https://github.com/PrajaktaSathe/Java/blob/main/Programs/Games/peg-solitaire/) - Peg Solitaire Game
-87. [ToDO List](./Programs/ToDoList.java) - Simple ToDo list program.
-88. [Ceaser Cipher Encryption](./Programs/CeaserCipher.java) - Encrypt Text with Ceaser Cipher Methodology.
-89. [Recursion](./Programs/Check_If_Sorted.java) - Check if an Array is sorted using recursion.
-90. [Patterns](./Programs/patterns) - Print out patterns in terminal (Steps included).
+87. [PrintPattern](https://github.com/arshcoder13/Java/blob/main/Programs/PrintPattern.java) - Print Pattern using Nested For Loops.
+88. [Two Sum](https://github.com/siddhant2002/Java-1/blob/main/Programs/Two_Sum.java) - Sum of two elements which is equal to the target element.
+89. [ToDO List](./Programs/ToDoList.java) - Simple ToDo list program.
+90. [Ceaser Cipher Encryption](./Programs/CeaserCipher.java) - Encrypt Text with Ceaser Cipher Methodology.
+91. [Recursion](./Programs/Check_If_Sorted.java) - Check if an Array is sorted using recursion.
+92. [Patterns](./Programs/patterns) - Print out patterns in terminal (Steps included).
+
 # Contributors - 
 ## A big thank you to all our contributors!!!