├── .idea ├── .gitignore ├── misc.xml └── modules.xml ├── LICENSE ├── LearnCollectionFramework.iml ├── README.md ├── out └── production │ └── LearnCollectionFramework │ ├── LearnArrayDeque.class │ ├── LearnArrayList.class │ ├── LearnArraysClass.class │ ├── LearnCollectionsClass$1.class │ ├── LearnCollectionsClass.class │ ├── LearnLinkedListQueue.class │ ├── LearnMap.class │ ├── LearnPriorityQueue.class │ ├── LearnSet.class │ ├── LearnStack.class │ └── Student.class └── src ├── LearnArrayDeque.java ├── LearnArrayList.java ├── LearnArraysClass.java ├── LearnCollectionsClass.java ├── LearnLinkedListQueue.java ├── LearnMap.java ├── LearnPriorityQueue.java ├── LearnSet.java ├── LearnStack.java └── Student.java /.idea/.gitignore: -------------------------------------------------------------------------------- 1 | # Default ignored files 2 | /shelf/ 3 | /workspace.xml 4 | # Datasource local storage ignored files 5 | /dataSources/ 6 | /dataSources.local.xml 7 | # Editor-based HTTP Client requests 8 | /httpRequests/ 9 | -------------------------------------------------------------------------------- /.idea/misc.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /.idea/modules.xml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /LearnCollectionFramework.iml: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Collections-Framework 2 | A beginner's guide to Learn Java Collections Framework 3 | 4 | Collections Framework in 1 video 6 | 7 | ## Topics included: 8 | 9 | * Collection Interface 10 | * ArrayList 11 | * Iterator 12 | * Stack 13 | * Queue and LinkedList 14 | * PriorityQueue 15 | * ArrayDeque 16 | * HashSet 17 | * LinkedHashSet 18 | * TreeSet 19 | * Sets of Custom Classes (hashCode and equals) 20 | * HashMap 21 | * TreeMap 22 | * Arrays Class 23 | * Collections Class 24 | * Sorting Custom Collections 25 | * Comparable Interface 26 | * Comparator Interface 27 | -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnArrayDeque.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnArrayDeque.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnArrayList.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnArrayList.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnArraysClass.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnArraysClass.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnCollectionsClass$1.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnCollectionsClass$1.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnCollectionsClass.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnCollectionsClass.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnLinkedListQueue.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnLinkedListQueue.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnMap.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnMap.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnPriorityQueue.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnPriorityQueue.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnSet.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnSet.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/LearnStack.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/LearnStack.class -------------------------------------------------------------------------------- /out/production/LearnCollectionFramework/Student.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Anuj-Kumar-Sharma/Collections-Framework/bd6b1a4f90d81adbf1c04d580127040fd908bd28/out/production/LearnCollectionFramework/Student.class -------------------------------------------------------------------------------- /src/LearnArrayDeque.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayDeque; 2 | 3 | public class LearnArrayDeque { 4 | 5 | public static void main(String[] args) { 6 | 7 | ArrayDeque adq = new ArrayDeque<>(); 8 | 9 | adq.offer(23); 10 | adq.offerFirst(12); 11 | adq.offerLast(45); 12 | adq.offer(26); 13 | 14 | System.out.println(adq); 15 | 16 | System.out.println(adq.peek()); 17 | System.out.println(adq.peekFirst()); 18 | System.out.println(adq.peekLast()); 19 | 20 | System.out.println(adq.poll()); 21 | System.out.println("poll() " +adq); 22 | 23 | System.out.println(adq.pollFirst()); 24 | System.out.println("pollFirst() " +adq); 25 | 26 | System.out.println(adq.pollLast()); 27 | System.out.println("pollLast() " +adq); 28 | 29 | } 30 | 31 | } 32 | -------------------------------------------------------------------------------- /src/LearnArrayList.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.Iterator; 3 | import java.util.LinkedList; 4 | import java.util.List; 5 | 6 | public class LearnArrayList { 7 | 8 | public static void main(String[] args) { 9 | 10 | List list = new LinkedList<>(); 11 | list.add(1); 12 | list.add(2); 13 | list.add(3); 14 | System.out.println(list); 15 | 16 | list.add(4); // This will add 4 at the end of the List. 17 | System.out.println(list); 18 | 19 | list.add(1, 50); // This will add 50 at index 1. All the other elements will be shifted to right. 20 | System.out.println(list); 21 | 22 | List newList = new ArrayList(); // Creating a new List which will be added to original list. 23 | newList.add(150); 24 | newList.add(160); 25 | 26 | list.addAll(newList); // This will add all the elements present in newList to list. 27 | System.out.println(list); 28 | 29 | System.out.println(list.get(1)); 30 | 31 | // List list = new ArrayList<>(); 32 | // list.add(10); 33 | // list.add(20); 34 | // list.add(30); 35 | // list.add(40); 36 | // list.add(50); 37 | // list.add(60); 38 | // list.add(70); 39 | // list.add(80); 40 | // 41 | // System.out.println(list); 42 | // 43 | // for (int i = 0; i < list.size(); i++) { 44 | // System.out.println("the element is " + list.get(i)); 45 | // } 46 | // 47 | // for (Integer element: list) { 48 | // System.out.println("foreach element is " + element); 49 | // } 50 | // 51 | // Iterator it = list.iterator(); 52 | // 53 | // while (it.hasNext()) { 54 | // System.out.println("iterator " + it.next()); 55 | // } 56 | 57 | // list.set(2, 1000); 58 | // 59 | // System.out.println(list); 60 | // 61 | // System.out.println(list.contains(500)); 62 | 63 | // list.remove(1); // This will remove the element at index 1 i.e 20. 64 | // System.out.println(list); 65 | // 66 | // list.remove(Integer.valueOf(30)); // This will remove 30 from the list 67 | // System.out.println(list); 68 | // 69 | // list.clear(); //This will remove all the elements from the list. 70 | // System.out.println(list); 71 | 72 | 73 | 74 | } 75 | } 76 | -------------------------------------------------------------------------------- /src/LearnArraysClass.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | 3 | public class LearnArraysClass { 4 | 5 | public static void main(String[] args) { 6 | 7 | // int[] numbers = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 }; 8 | // int index = Arrays.binarySearch(numbers, 4); 9 | // 10 | // System.out.println("The index of element 4 in the array is " + index); 11 | 12 | Integer[] numbers = { 10, 2, 32, 12, 15, 76, 17, 48, 79, 9 }; 13 | Arrays.sort(numbers); 14 | 15 | Arrays.parallelSort(numbers); 16 | // 8192 17 | 18 | Arrays.fill(numbers, 12); 19 | 20 | for (int i : numbers) { 21 | System.out.print(i + " "); 22 | } 23 | 24 | 25 | 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /src/LearnCollectionsClass.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.Collections; 3 | import java.util.Comparator; 4 | import java.util.List; 5 | 6 | public class LearnCollectionsClass { 7 | 8 | public static void main(String[] args) { 9 | 10 | List list = new ArrayList<>(); 11 | 12 | list.add(new Student("Anuj", 2)); 13 | list.add(new Student("Ramesh", 4)); 14 | list.add(new Student("Shivam", 3)); 15 | list.add(new Student("Rohit", 1)); 16 | 17 | Student s1 = new Student("Anuj", 2); 18 | Student s2 = new Student("Rohit", 3); 19 | 20 | // System.out.println((s1.compareTo(s2))); 21 | 22 | System.out.println(list); 23 | 24 | Collections.sort(list, (o1, o2) -> o1.name.compareTo(o2.name)); 25 | 26 | System.out.println(list); 27 | 28 | 29 | // List list = new ArrayList<>(); 30 | // list.add(34); 31 | // list.add(12); 32 | // list.add(9); 33 | // list.add(9); 34 | // list.add(9); 35 | // list.add(76); 36 | // list.add(29); 37 | // list.add(75); 38 | // 39 | //// System.out.println("min element " + Collections.min(list)); 40 | //// System.out.println("max element " + Collections.max(list)); 41 | //// System.out.println(Collections.frequency(list, 9)); 42 | // 43 | // Collections.sort(list, Comparator.reverseOrder()); 44 | // 45 | // System.out.println(list); 46 | } 47 | 48 | } 49 | -------------------------------------------------------------------------------- /src/LearnLinkedListQueue.java: -------------------------------------------------------------------------------- 1 | import java.util.LinkedList; 2 | import java.util.Queue; 3 | 4 | public class LearnLinkedListQueue { 5 | 6 | public static void main(String[] args) { 7 | 8 | Queue queue = new LinkedList<>(); 9 | 10 | queue.offer(12); 11 | queue.offer(24); 12 | queue.offer(36); 13 | 14 | System.out.println(queue); 15 | 16 | System.out.println(queue.poll()); 17 | 18 | System.out.println(queue); 19 | 20 | System.out.println(queue.peek()); 21 | 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /src/LearnMap.java: -------------------------------------------------------------------------------- 1 | import java.util.HashMap; 2 | import java.util.Map; 3 | import java.util.TreeMap; 4 | 5 | public class LearnMap { 6 | 7 | public static void main(String[] args) { 8 | 9 | Map numbers = new TreeMap<>(); 10 | 11 | numbers.put("One", 1); 12 | numbers.put("Two", 2); 13 | numbers.put("Three", 3); 14 | numbers.put("Four", 4); 15 | numbers.put("Five", 5); 16 | 17 | 18 | numbers.remove("Three"); 19 | 20 | // if(!numbers.containsKey("Two")) { 21 | // numbers.put("Two", 23); 22 | // } 23 | 24 | // numbers.putIfAbsent("Two", 23); 25 | System.out.println(numbers); 26 | System.out.println(numbers.containsValue(3)); 27 | 28 | System.out.println(numbers.isEmpty()); 29 | 30 | // for (Map.Entry e: numbers.entrySet()) { 31 | // System.out.println(e); 32 | // 33 | // System.out.println(e.getKey()); 34 | // System.out.println(e.getValue()); 35 | // } 36 | // 37 | // for (String key: numbers.keySet()) { 38 | // System.out.println(key); 39 | // } 40 | // 41 | // for(Integer value: numbers.values()) { 42 | // System.out.println(value); 43 | // } 44 | 45 | } 46 | } 47 | -------------------------------------------------------------------------------- /src/LearnPriorityQueue.java: -------------------------------------------------------------------------------- 1 | import java.util.Comparator; 2 | import java.util.PriorityQueue; 3 | import java.util.Queue; 4 | 5 | public class LearnPriorityQueue { 6 | 7 | public static void main(String[] args) { 8 | 9 | Queue pq = new PriorityQueue<>(Comparator.reverseOrder()); 10 | 11 | pq.offer(40); 12 | pq.offer(12); 13 | pq.offer(24); 14 | pq.offer(36); 15 | 16 | System.out.println(pq); 17 | pq.poll(); 18 | System.out.println(pq); 19 | 20 | System.out.println(pq.peek()); 21 | 22 | } 23 | 24 | } 25 | -------------------------------------------------------------------------------- /src/LearnSet.java: -------------------------------------------------------------------------------- 1 | import java.util.HashSet; 2 | import java.util.LinkedHashSet; 3 | import java.util.Set; 4 | import java.util.TreeSet; 5 | 6 | public class LearnSet { 7 | 8 | public static void main(String[] args) { 9 | 10 | Set studentSet = new HashSet<>(); 11 | 12 | studentSet.add(new Student("Anuj", 2)); 13 | studentSet.add(new Student("Ramesh", 4)); 14 | studentSet.add(new Student("Shivam", 3)); 15 | 16 | studentSet.add(new Student("Rohit", 2)); 17 | 18 | Student s1 = new Student("Anuj", 2); 19 | Student s2 = new Student("Rohit", 2); 20 | 21 | System.out.println(s1.equals(s2)); 22 | System.out.println(studentSet); 23 | 24 | // Set set = new HashSet<>(); 25 | // Set set = new LinkedHashSet<>(); 26 | 27 | // Set set = new TreeSet<>(); 28 | // 29 | // set.add(32); 30 | // set.add(2); 31 | // set.add(54); 32 | // set.add(21); 33 | // set.add(65); 34 | // 35 | // System.out.println(set); 36 | // 37 | // set.remove(54); 38 | // 39 | // System.out.println(set); 40 | // 41 | // System.out.println(set.contains(21)); 42 | // 43 | // System.out.println(set.isEmpty()); 44 | // 45 | // System.out.println(set.size()); 46 | // 47 | // set.clear(); 48 | // 49 | // System.out.println(set); 50 | 51 | } 52 | } 53 | -------------------------------------------------------------------------------- /src/LearnStack.java: -------------------------------------------------------------------------------- 1 | import java.util.Stack; 2 | 3 | public class LearnStack { 4 | 5 | public static void main(String[] args) { 6 | Stack animals= new Stack<>(); 7 | 8 | animals.push("Lion"); 9 | animals.push("Dog"); 10 | animals.push("Horse"); 11 | animals.push("Cat"); 12 | 13 | System.out.println("Stack: " + animals); 14 | 15 | System.out.println(animals.peek()); 16 | 17 | animals.pop(); 18 | 19 | System.out.println("Stack: " + animals); 20 | 21 | System.out.println(animals.peek()); 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /src/Student.java: -------------------------------------------------------------------------------- 1 | import java.util.Comparator; 2 | import java.util.Objects; 3 | 4 | public class Student implements Comparable { 5 | 6 | String name; 7 | int rollNo; 8 | 9 | public Student(String name, int rollNo) { 10 | this.name = name; 11 | this.rollNo = rollNo; 12 | } 13 | 14 | @Override 15 | public String toString() { 16 | return "Student{" + 17 | "name='" + name + '\'' + 18 | ", rollNo=" + rollNo + 19 | '}'; 20 | } 21 | 22 | @Override 23 | public boolean equals(Object o) { 24 | if (this == o) return true; 25 | if (o == null || getClass() != o.getClass()) return false; 26 | Student student = (Student) o; 27 | return rollNo == student.rollNo; 28 | } 29 | 30 | @Override 31 | public int hashCode() { 32 | return Objects.hash(rollNo); 33 | } 34 | 35 | @Override 36 | public int compareTo(Student that) { 37 | return this.rollNo - that.rollNo; 38 | } 39 | } 40 | --------------------------------------------------------------------------------