Add files via upload

Author: pkprajapati7402

01. Data Structures/07. Set/MyHashSet.java

@@ -0,0 +1,40 @@
+package sets;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class MyHashSet {
+
+	public static void main(String args[]) {
+
+		Set<String> fruits = new HashSet<>();
+
+		fruits.add("Apple");
+		fruits.add("Banana");
+		System.out.println(fruits.add("Kiwi")); // this will print true as add function will return true
+		System.out.println(fruits.add("Banana")); // this will print false as add function will return false
+		/*
+		 * fruits.add("Banana"); this "Banana" will not be added in the set because Set
+		 * does not allow duplicate elements
+		 */
+
+		/*
+		 * HashSet uses a HashMap internally to implement a Set so the elements will not
+		 * retain the order in which they are inserted
+		 */
+		System.out.println(fruits);
+
+		Set<Integer> numbers = new HashSet<>();
+		numbers.add(5);
+		numbers.add(3);
+		numbers.add(99);
+		numbers.add(6);
+		numbers.add(5);
+		numbers.add(56);
+		numbers.add(8);
+		numbers.add(1);
+
+		System.out.println("\nNUMBER SET:");
+		System.out.println(numbers);
+	}
+}

01. Data Structures/07. Set/MyLinkedHashSet.java

@@ -0,0 +1,41 @@
+package sets;
+
+import java.util.LinkedHashSet;
+import java.util.Set;
+
+public class MyLinkedHashSet {
+
+	public static void main(String[] args) {
+
+		Set<String> fruits = new LinkedHashSet<>();
+
+		fruits.add("Kiwi");
+		fruits.add("Banana");
+		fruits.add("Apple");
+		fruits.add("Orange");
+		System.out.println(fruits.add("Banana")); // this will print false as add function will return false
+		/*
+		 * fruits.add("Banana"); this "Banana" will not be added in the set because Set
+		 * does not allow duplicate elements
+		 */
+
+		/*
+		 * LinkedHashSet uses a LinkedList internally to implement a Set so the elements
+		 * will retain the order in which they are inserted
+		 */
+		System.out.println(fruits);
+
+		Set<Integer> numbers = new LinkedHashSet<>();
+		numbers.add(5);
+		numbers.add(3);
+		numbers.add(99);
+		numbers.add(6);
+		numbers.add(5);
+		numbers.add(56);
+		numbers.add(8);
+		numbers.add(1);
+
+		System.out.println("\nNUMBER SET:");
+		System.out.println(numbers);
+	}
+}

01. Data Structures/07. Set/MyTreeSet.java

@@ -0,0 +1,43 @@
+package sets;
+
+import java.util.Set;
+import java.util.TreeSet;
+
+public class MyTreeSet {
+
+	public static void main(String[] args) {
+
+		Set<String> fruits = new TreeSet<>();
+
+		fruits.add("Kiwi");
+		fruits.add("Banana");
+		fruits.add("Apple");
+		fruits.add("Orange");
+		System.out.println(fruits.add("Banana")); // this will print false as add function will return false
+		/*
+		 * fruits.add("Banana"); this "Banana" will not be added in the set because Set
+		 * does not allow duplicate elements
+		 */
+
+		/*
+		 * TreeSet uses a Tree internally to implement a Set so the elements will be
+		 * arranged in a sorted order, int values will be stored in ascending order,
+		 * strings will be stored lexicographically
+		 */
+		System.out.println("FRUIT SET:");
+		System.out.println(fruits);
+
+		Set<Integer> numbers = new TreeSet<>();
+		numbers.add(5);
+		numbers.add(3);
+		numbers.add(99);
+		numbers.add(6);
+		numbers.add(5);
+		numbers.add(56);
+		numbers.add(8);
+		numbers.add(1);
+
+		System.out.println("\nNUMBER SET:");
+		System.out.println(numbers);
+	}
+}

01. Data Structures/07. Set/README.md

@@ -0,0 +1,28 @@
+### Set is a data structure that is used as a collection of objects. Java supports it through its Java Collection library. There are several ways to implement a set and Java supports three different implementations along with useful operations like intersection between sets.
+
+
+#### Learn about Set Data Structures in JAVA: [Video Reference](https://youtu.be/rS4VWfPUArY)
+#### [Article 1](https://www.geeksforgeeks.org/set-in-java/) | [Article 2](https://iq.opengenus.org/set-in-java/)
+
+<hr>
+
+## HashSet vs TreeSet vs LinkedHashSet:
+### [HashSet :](./MyHashSet.java)
+- HashSet Use hashtable to store elements.
+- Elements are not stored in sorted order(unsorted).
+- add,remove,contain method have constant time complexitiy O(1).
+
+### [TreeSet :](./MyTreeSet.java)
+- TreeSet Use RedBlack tree to store elements.
+- Elements are stored in sorted order (sorted).
+- add, remove, and contains methods has time complexity of O(log (n)).
+
+### [LinkedHashSet :](./MyLinkedHashSet.java)
+- LinkedHashSet is between HashSet and TreeSet. It is implemented as a hash table with a slinked list running through it.
+- The time complexity of basic methods is O(1).
+
+#### HashSet has best-performing implementation of Set compare to LinkedHashSet and TreeSet .
+
+### Problem Link: [GFG - Subarray with 0 sum](https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1#)
+### Editorial Link: [Apni Kaksha - Anuj Kumar Sharma](https://youtu.be/PSpuM9cimxA)
+### [Code](./SubarrayWith0Sum.java)

01. Data Structures/07. Set/SubarrayWith0Sum.java

@@ -0,0 +1,23 @@
+// Problem Link: https://practice.geeksforgeeks.org/problems/subarray-with-0-sum-1587115621/1#
+// Editorial Link: https://youtu.be/PSpuM9cimxA
+
+class Solution{
+    //Function to check whether there is a subarray present with 0-sum or not.
+    static boolean findsum(int arr[],int n)
+    {
+        Set<Integer> set = new HashSet<>();
+        int sum=0;
+        boolean found = false;
+        for(int ele: arr)
+        {
+            set.add(sum);
+            sum += ele;
+            if(set.contains(sum))
+            {
+                found = true;
+                break;
+            }
+        }
+        return found;
+    }
+}