Subramani .T’s Post

🚀 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 54 of My Internship Journey at Tap Academy Today’s session was a deep dive into one of the most essential parts of Java programming — the Collection Framework, with a strong focus on HashSet, LinkedHashSet, and HashMap. Here’s a breakdown of what I learned 👇 🔹 Understanding HashSet HashSet is built on a hash table structure where data is stored in buckets based on computed hash values. It ensures no duplicate elements Provides fast performance for insertion and retrieval Uses a hash function to determine where each element should be stored 🔹 LinkedHashSet – Order Matters While HashSet focuses on performance, LinkedHashSet adds an important feature: Maintains the insertion order of elements Combines efficiency with predictability This makes it useful when both uniqueness and order are required. 🔹 The Power of Hashing A key concept covered was the internal hashing process: A hash function converts data into a unique hash value This value determines the storage location (bucket) Efficient hashing leads to faster data access and minimal collisions 🔹 Introduction to HashMap The session then moved to Map-based structures, especially HashMap: Stores data as key-value pairs Ideal for managing labeled or structured data Allows heterogeneous data (different data types) Key concepts: ✔️ Initial Capacity ✔️ Load Factor ✔️ Efficient key-based retrieval 🔹 Beyond Code – A Reality Check 💡 What made today’s session impactful was not just the technical knowledge, but also the life lesson shared: Stay focused on your goals Respect the sacrifices made by your parents Understand the intense competition in today’s job market Consistency and discipline matter more than motivation ✨ My Takeaway: Mastering concepts like hashing and collections is not just about coding — it’s about building a strong foundation for writing efficient, scalable applications. At the same time, maintaining the right mindset is equally important for long-term success. 📌 Every day is a step closer to becoming a better developer and a better professional. #Day54 #InternshipJourney #Java #CollectionsFramework #HashSet #HashMap #LinkedHashSet #LearningInPublic #FutureDeveloper #TapAcademy TAP Academy Sharath R Harshit T Somanna M G

🚀 Day 13 of My Internship Journey at TAP Academy Today’s session was super insightful as I dived deeper into one of the most important concepts in Java — static and its real meaning behind the scenes. 💡 Here are my key takeaways: 🔹 Local Variables vs Static Variables I learned that local variables belong to methods (method members), and they are created only when the method is called. 👉 That’s why we cannot declare a local variable as static — because static variables belong to the class and get memory during class loading. 🔹 Memory Concept Clarity Static variables → memory allocated once (class loading) Local variables → memory allocated every time method is called and destroyed after execution This cleared a big confusion for me! 🔹 Instance vs Static Access One important rule I understood today: 👉 You cannot access instance variables directly inside a static method ✔️ If needed → you must create an object 🔹 Example Insight: Static method → no object required Instance variable → needs object (because memory is allocated during object creation) 🔹 Where can we use static? ✔️ Variables ✔️ Methods ✔️ Blocks ✔️ Inner classes (not outer classes!) 🔹 Static Block Use Initialize static variables Execute code before the main method runs 🔹 Static Methods Used when functionality is independent of objects — can be accessed directly using class name 🌱 Bonus Learning: Introduction to Inheritance We also got introduced to the next OOP pillar — Inheritance Understanding it with real-world examples (like traits passed across generations) made it super easy to relate 💡 ✨ My Reflection: Today was all about understanding how Java manages memory and structure internally. Concepts like static vs instance finally make logical sense rather than just theory! Every day, I feel one step closer to becoming a strong Java developer 💻🔥 #Day13 #InternshipJourney #Java #OOP #StaticKeyword #LearningDaily #FutureDeveloper #TAPAcademy TAP Academy

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 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-51 of My Internship @ Tap Academy 🚀 Today, I explored one of the most important concepts in Java that directly connects to real-world applications — Sorting & Object Comparison. Here’s what I learned 👇 🔸 Comparable vs Comparator Understanding the difference between natural sorting and custom sorting completely changed how I look at data organization. ✔️ Comparable → Defines a single default sorting logic ✔️ Comparator → Allows multiple custom sorting strategies 🔸 Wrapper Classes Ever wondered how Java Collections handle primitives? That’s where wrapper classes come in: 👉 Converting primitives into objects 👉 Enabling powerful utilities like sorting, searching, and more 🔸 Sorting in Action From simple lists to complex objects, sorting plays a key role in: 📊 Data organization ⚡ Performance optimization 🏆 Real-world use cases like rankings & leaderboards 💡 Key takeaway: Writing code is one thing, but making data structured, searchable, and optimized is what makes a developer stand out. Excited to keep learning and building! 🚀 #Java #Programming #CodingJourney #SoftwareDevelopment #JavaDeveloper #LearningInPublic #100DaysOfCode #InternshipJourney #TechLearning #Developers #CodeNewbie #ProgrammingLife #BackendDevelopment #DSA #CareerGrowth #TechCommunity #CodingLife

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

🚀 Day 47 of My Internship at Tap Academy Today, I explored one of the most widely used classes in Java Collections Framework — ArrayList. 🔹 What is an ArrayList? ArrayList is a dynamic array that can grow and shrink in size automatically. Unlike traditional arrays, it doesn’t have a fixed length, making it highly flexible for real-world applications. 🔹 Key Features: ✅ Maintains insertion order ✅ Allows duplicate elements ✅ Provides fast random access (index-based) ✅ Automatically resizes when elements are added or removed 🔹 Why ArrayList over Arrays? While arrays are fixed in size, ArrayList handles resizing internally, reducing the need for manual memory management. It also comes with built-in methods that simplify operations like adding, removing, and searching elements. 🔹 Common Methods: • "add()" – Add elements • "get()" – Access elements • "set()" – Update elements • "remove()" – Delete elements • "size()" – Get total elements 🔹 When to Use ArrayList? 👉 When frequent read operations are required 👉 When size of data is not fixed 👉 When you need ordered data with duplicates allowed 💡 Key Insight: ArrayList is powerful, but not always the best choice for frequent insertions/deletions in the middle — in such cases, LinkedList can be more efficient. Learning these small but powerful concepts step-by-step is helping me build a strong foundation in Java 🚀 Looking forward to exploring more advanced topics tomorrow! #Java #JavaCollections #ArrayList #Programming #CodingJourney #SoftwareDevelopment #Developers #LearnJava #TechLearning #InternshipJourney #OpenToWork #CareerGrowth #CodingLife #100DaysOfCode

🚀 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

🚀 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 🚀💡