Java Sorting & Object Comparison with Comparable & Comparator

🔹 Day 52 of My Internship @ Tap Academy 🚀 Today I explored one of the most important concepts in Java for writing clean and flexible code — compareTo() & Comparator 🔥 Understanding how objects are compared is crucial when working with collections like Lists, Sets, and Maps. 💡 Here’s what I learned: ✔ compareTo() (Comparable Interface) Defines the natural/default sorting Implemented inside the class itself Useful when you have a single sorting logic ✔ Comparator Interface Used for custom and multiple sorting strategies No need to modify the original class Helps write clean and reusable code 👉 In simple terms: Comparable = One default way to compare Comparator = Multiple ways to compare This concept is heavily used in real-world applications like sorting users, ranking systems, and data processing. 📌 Mastering these small concepts builds a strong foundation for writing scalable Java applications. Consistency is the key — showing up every day and learning something new 💯 #Day52 #Java #Programming #CodingJourney #SoftwareDevelopment #DeveloperLife #LearnJava #TechSkills #Coding #JavaDeveloper #CollectionsFramework #ProblemSolving #100DaysOfCode #InternshipExperience #CareerGrowth 🚀

🚀 Day 41 of My Full Stack Developer Internship @ Tap Academy 💻✨ I’m excited to continue sharing my journey as a Full Stack Developer Intern! Every day is helping me strengthen my understanding of core Java concepts and data structures. 📘 Today’s Topic: HashSet in Java (Java Collections Framework) In today’s session, I explored the powerful HashSet class and how it efficiently stores and manages data. 🔹 Key Concepts I Learned: ✔️ No Duplicate Elements – HashSet automatically removes duplicate values ✔️ Unordered Collection – Does not maintain insertion order ✔️ Allows Null Values – Only one null element is permitted ✔️ Internal Working – Uses hashing mechanism (hash function & hash table) ✔️ Default Capacity & Load Factor – Initial capacity = 16, Load factor = 0.75 ✔️ Fast Operations – Insertion, deletion, and search in O(1) time complexity ✔️ Heterogeneous Data – Can store different types of objects 🔹 When to Use HashSet? 👉 When you need unique elements only 👉 When order is not important 👉 When you want fast performance 📊 I also explored how hash functions work internally, how elements are stored in buckets, and how load factor affects resizing of the HashSet. 📸 Sharing my handwritten notes from today’s learning session! 💡 Every concept I learn brings me one step closer to becoming a better developer. Consistency is key! 🔥 🔗 #FullStackDeveloper #Java #JavaCollections #HashSet #LearningJourney #Internship #TapAcademy #CodingLife #DeveloperJourney #100DaysOfCode #TechLearning #Programming #FutureDeveloper 🚀💻

🚀 Day 52 of My Internship Journey at Tap Academy Today’s learning was all about diving deeper into the Java Collections Framework, specifically comparing LinkedList and ArrayDeque—two powerful data structures often used for stacks and queues. 🔍 Key Takeaways: 👉 LinkedList - Built on a doubly linked list structure - Each element (node) stores data + two address references (prev & next) - Offers flexibility in insertion and deletion - ⚠️ However, it comes with higher memory overhead due to extra pointer storage 👉 ArrayDeque - Implemented using a resizable array - More memory-efficient since it avoids node-based overhead - Faster for stack and queue operations in most scenarios - Default initial capacity = 16 - ❌ Does not allow null values - ❌ No index-based access or ListIterator support 💡 Conclusion: While LinkedList is versatile, ArrayDeque is often the better choice for stack and queue implementations due to its superior performance and lower memory consumption. 🌱 Bonus Learning: Got introduced to TreeSet, which automatically sorts elements—great for maintaining ordered data efficiently. 🔥 My Insight: Understanding internal data structures isn’t just theoretical—it directly impacts how efficiently our applications run. Choosing the right structure can make a huge difference in performance and scalability. 📌 Consistency is key—one concept at a time, getting stronger every day! #Java #DataStructures #JavaCollections #LearningJourney #Internship #Programming #DeveloperGrowth #ArrayDeque #LinkedList #TreeSet TAP Academy Sharath R Harshit T Somanna M G

My Internship Journey at Tap Academy Today, I stepped into one of the most important concepts in Java — Collections Framework 🚀 This session completely changed how I look at handling data in real-world applications. It’s not just about storing data anymore, but about doing it efficiently and smartly. 🔹 What I Explored • What is a Collection & why it is important • Difference between Data Structures vs Collections • Role of Collections in real-world applications • Introduction to List, Set, and Map interfaces • Deep dive into ArrayList • How Collections reduce manual coding effort 🔹 Key Learnings ✔ Collections are an inbuilt alternative to Data Structures ✔ No need to manually implement logic like traversal, resizing, etc. ✔ Everything is available as ready-made classes & methods ✔ ArrayList uses a dynamic (resizable) array internally ✔ Default capacity of ArrayList= 10 ✔ Supports heterogeneous data, duplicates, and null values ✔ Maintains insertion order ✔ Automatically resizes when capacity is exceeded 🔹 Real Understanding In DSA → we write logic manually In Collections → Java gives optimized logic already built-in So instead of writing 20 lines of code… we can solve the same problem in just a few lines using Collections. 🔹 Important Insight Learning Collections is not about “how it works internally” — it’s about when and where to use which class and method. Excited to explore more classes like LinkedList, Set, Map and master this powerful framework #Internship #Java #Collections #ArrayList #DSA #Programming #CodingJourney #LearningJourney #TapAcademy TAP Academy

🚀 Day 55 of My Internship Journey at Tap Academy Today’s learning deepened my understanding of one of the most powerful parts of Java — the Collection Framework, with a focus on the Map hierarchy. I explored how different map implementations serve different real-world needs: 🔹 HashMap Stores data using hashing for fast access Allows one null key and multiple null values Does not maintain order 🔹 LinkedHashMap Maintains insertion order Slightly slower than HashMap due to ordering overhead Useful when order matters (e.g., caching, UI display) 🔹 TreeMap Stores data in sorted order (natural or custom comparator) Does not allow null keys Ideal for scenarios requiring sorted data 💡 I also learned how to work with data using: entrySet() → Access key-value pairs efficiently keySet() → Retrieve all keys for iteration These methods play a crucial role in optimizing data traversal and manipulation. 🧠 Understanding the hierarchy matters The relationship between Collection → Set/List → Map helped me see the bigger picture of how Java structures data and why different interfaces exist for different use cases. ⏳ Legacy Classes vs Modern Collections I explored older classes like: Vector Hashtable These are synchronized by default, making them thread-safe but slower — which is why modern alternatives are preferred in most applications. 🔄 Iteration Evolution Legacy: Enumeration Modern: Iterator This shift highlights how Java evolved toward more flexible and powerful data traversal mechanisms. 🔥 Key Takeaway Today reinforced an important lesson: 👉 It’s not just about using a data structure — it’s about understanding why it exists and when to use it. That deeper understanding is what helps build efficient, scalable, and high-performance applications. 📌 Every day I’m getting closer to thinking like a developer who not only writes code — but understands the system behind it. #Java #CollectionsFramework #LearningJourney #InternshipExperience #SoftwareDevelopment #Coding #Developers #LinkedInLearning #GrowthMindset TAP Academy Sharath R Harshit T Somanna M G

🚀 Day 50 of My Internship Journey at Tap Academy Today’s learning deep dive was into one of the most powerful data structures in the Java Collections Framework — the Java LinkedList. Understanding how LinkedList works internally really changed how I think about data handling and performance in Java. 🔍 Key Learnings 📌 1. LinkedList vs ArrayList Unlike the Java ArrayList, which is backed by a dynamic array, LinkedList is implemented using a doubly linked list structure. This means: Each element (node) stores references to both previous and next nodes No shifting of elements during insertion or deletion More efficient for frequent modifications 📌 2. Dynamic Nature & Capacity A LinkedList starts with zero capacity and grows dynamically as elements are added — making it highly flexible compared to arrays. 📌 3. Efficient Insertions & Deletions One of the biggest advantages: Inserting/removing elements is faster than ArrayList (especially in the middle) No need to shift elements → better performance in such operations 📌 4. Constructors & Collection Conversion Learned how LinkedList can be initialized using different constructors: Empty LinkedList From another collection This demonstrates the power of polymorphism and loose coupling, where code becomes more flexible and reusable. 📌 5. Traversing LinkedList (4 Ways) We explored multiple ways to access elements: 1️⃣ Standard for loop 2️⃣ Enhanced for-each loop 3️⃣ Iterator (forward traversal) 4️⃣ ListIterator (forward + backward traversal) 💡 The ListIterator stood out as the most powerful because it allows: Bidirectional traversal Modification during iteration 📌 6. Importance of Collections Framework The Java Collections Framework provides ready-made data structures like LinkedList, saving developers from building complex structures manually (as done in languages like C). 💡 My Key Takeaway Choosing the right data structure is not just about functionality — it's about performance and efficiency. Use ArrayList when frequent access is needed Use LinkedList when frequent insertions/deletions are required ✨ Grateful to keep learning and growing every day in this journey! #Java #LinkedList #CollectionsFramework #Programming #SoftwareDevelopment #LearningJourney #Internship #JavaDeveloper #Coding #TechSkills TAP Academy Sharath R Harshit T Somanna M G

🚀 Day 42 as a Full Stack Developer Intern at Tap Academy Excited to share my learning journey as I continue growing in my Full Stack Development internship! 💻✨ Today’s session focused on one of the most important data structures in Java — HashMap 🔑 📌 What I learned: 🔹 Core methods of HashMap: put(K, V) – to insert key-value pairs entrySet() – to access entries keySet() – to get all keys values() – to get all values 🔹 When to use HashMap? ✔️ When working with key-value pairs ✔️ Fast insertion and access (O(1)) ⚡ ✔️ Useful for storing and retrieving data efficiently 🔹 Key Properties: ✅ Allows heterogeneous values ❌ No duplicate keys (but duplicate values allowed) ❌ Does not maintain insertion order ✔️ Allows one null key and multiple null values 🔹 Additional Concepts: 🔸 Initial capacity (default: 16) 🔸 Internal working based on hashing 🔸 Difference between HashMap, LinkedHashMap (maintains order), and TreeMap (sorted order) Learning step by step and building a strong foundation in Java 🔥 Looking forward to diving deeper into more advanced concepts! #FullStackDevelopment #Java #HashMap #LearningJourney #CodingLife #DeveloperLife #Internship #TapAcademy #100DaysOfCode #Programming #JavaDeveloper 🚀💡

🚀 Day 5 of My Internship Journey at Tap Academy Continuing my learning journey, today I explored one of the most fundamental data structures in Java — 1D Arrays. Here’s what I learned: 🔹 What is a 1D Array? A one-dimensional array is a collection of elements of the same data type stored in a contiguous memory location. It helps in managing multiple values using a single variable. 🔹 Declaration & Initialization Learned different ways to declare and initialize arrays: • int[] arr = new int[5]; • int[] arr = {1, 2, 3, 4, 5}; 🔹 Accessing Elements Array elements are accessed using index values starting from 0. Example: arr[0], arr[1] 🔹 Traversal of Array Understood how to iterate through arrays using loops like for loop to process each element efficiently. 🔹 Why Arrays are Important? ✔ Store multiple values efficiently ✔ Easy data access using index ✔ Helps in solving complex problems ✔ Foundation for advanced data structures Learning arrays gave me a strong foundation for handling data in Java and solving real-world problems more effectively. Excited to explore more data structures in the upcoming days! #Internship #Java #Arrays #DataStructures #Programming #LearningJourney #TapAcademy TAP Academy

🚀 Day 40 of My Full Stack Developer Internship @ Tap Academy 💻✨ I’m excited to share another milestone in my learning journey as a Full Stack Developer Intern! Each day is helping me build stronger fundamentals and practical understanding. 📘 Today’s Topic: TreeSet in Java (Java Collections Framework) In today’s session, I explored the powerful TreeSet class and its role in handling sorted data efficiently. Here’s a quick summary of what I learned: 🔹 Key Concepts I Learned: ✔️ TreeSet stores elements in sorted (ascending) order by default ✔️ It is based on a Binary Search Tree (BST) ✔️ No duplicate elements are allowed ✔️ Does not allow null values ✔️ Provides efficient operations with O(log n) time complexity ✔️ Useful for maintaining unique and sorted data 🔹 Important Methods: ➡️ add() – Adds elements ➡️ first() / last() – Retrieves first & last elements ➡️ headSet() / tailSet() / subSet() – Range operations ➡️ ceiling() / floor() / higher() / lower() – Navigation methods ➡️ pollFirst() / pollLast() – Removes elements 🔹 When to Use TreeSet? ✔️ When data needs to be automatically sorted ✔️ When duplicates are not allowed ✔️ When performing range-based operations ✔️ When fast searching and ordering is required 🔹 Hierarchy Insight: Collection → Set → SortedSet → NavigableSet → TreeSet 💡 This session helped me understand how TreeSet is different from other collections and when to use it effectively in real-world applications. I’m looking forward to applying these concepts in projects and continuing to grow step by step! 🚀 #FullStackDeveloper #Java #TreeSet #JavaCollections #LearningJourney #CodingLife #DeveloperJourney #TapAcademy #100DaysOfCode #SoftwareDevelopment #Programming #InternshipExperience

My Internship Journey at Tap Academy Today, I learned one of the important concepts in OOP — Polymorphism and how it works in Java. “Same method, different behavior — that’s the power of polymorphism.” 🔹 What I Worked On • Understanding Polymorphism • Method overriding concept • Upcasting (Parent reference → Child object) • Downcasting (Child reference from Parent) • Real-time example using Plane, CargoPlane, PassengerPlane, FighterPlane 🔹 What I Learned ✔ How polymorphism helps achieve flexibility in code ✔ Concept of runtime polymorphism ✔ Difference between upcasting and downcasting ✔ How a single reference can call different implementations ✔ Importance of inheritance in achieving polymorphism 🔹 Key Takeaway Polymorphism helps in writing flexible and reusable code. Understanding concepts like upcasting and downcasting makes it clearer how objects behave at runtime. Continuing to explore more OOP concepts step by step. #Internship #Java #OOP #Polymorphism #Programming #LearningJourney #TapAcademy TAP Academy