Mastering LinkedList in Java: Key Learnings and Techniques

📅 Day 10 – Strings in Java 📚 Topic: String Manipulation (Hashing) Today I solved the problem of checking whether two strings are anagrams using an efficient frequency-count approach. This helped me understand how hashing can be used to compare character distributions instead of sorting. ✔ Key Learnings: • Applied hashing using a frequency array • Improved understanding of character frequency comparison • Learned how to optimize from sorting (O(n log n)) to linear time (O(n)) Building problem-solving skills step by step and focusing on writing efficient code 🚀 #DSA #Strings #Java #ProblemSolving #LearningJourney

#TapAcademy #Java #Fullstackdeveloment #Strings Strings in Java are used to store and handle text data. They are created using double quotes. For example, String text = "Hello, World!". Java offers many useful string methods, such as concat(), substring(), and toUpperCase(). You can compare, join, and format strings with these built-in methods. Strings are commonly used for managing text input, output, and data processing in programs.

🚀 Day 53 – Mastering ArrayDeque in Java Today I explored one of the most efficient data structures in Java Collections – ArrayDeque 🔥 📌 Key Learnings: 🔹 ArrayDeque is a resizable array-based Deque (Double Ended Queue) 🔹 Supports insertion & deletion from both ends (front & rear) 🔹 No indexing → cannot use get/set methods 🔹 No null values allowed (throws runtime exception) 🔹 Duplicates & heterogeneous data allowed 🔹 Faster than LinkedList due to no memory overhead ⚙️ Traversal Techniques: ✔ For-each loop ✔ Iterator ✔ Descending Iterator (reverse traversal) 💡 Why ArrayDeque? 👉 O(1) performance for add/remove operations 👉 Best choice for implementing: Stack (LIFO) Queue (FIFO) Deque 🧠 Big Takeaway: ArrayDeque = Fast + Memory Efficient + Flexible (Stack/Queue/Deque in one) Consistency is the key 🔑 — learning something new every day! #Java #DataStructures #ArrayDeque #JavaCollections #CodingJourney #100DaysOfCode #LearningDaily

Day 36/100 – Working with ArrayList in Java 📚 Today I practiced using ArrayList in Java, a dynamic array that allows flexible storage and manipulation of data. Unlike normal arrays, ArrayList can grow and shrink dynamically, making it very useful in real-world applications. Key learnings: • Adding elements using add() • Storing multiple values dynamically • Finding size using size() • Easier and more flexible than traditional arrays Understanding collections like ArrayList is important for handling data efficiently in Java. Building strong fundamentals step by step. 🚀 #100DaysOfCode #Java #ArrayList #DataStructures #CodingJourney #LearningInPublic

#Day86 of #100DaysOfCode Started learning String manipulation in Java. Covered: * Basic string operations * Using built-in methods like length() and charAt() Practiced problems like: * Reversing a string * Checking palindrome strings * Counting vowels Focused on understanding how to process and manipulate text data. #Java #Strings #100DaysOfCode

💻 Day 23 – Strings in Java Today I explored Strings in Java, one of the most fundamental and important concepts. I learned about different types of string handling: 🔹 String – Immutable (cannot be changed) 🔹 StringBuilder – Mutable and faster 🔹 StringBuffer – Mutable and thread-safe Understanding immutability was a key highlight today, as it plays an important role in memory management and performance. 💡 Key takeaway: Choosing the right type of string handling improves both performance and efficiency in Java applications. Continuing to strengthen my core Java concepts step by step 🚀 #Java #Strings #Programming #LearningInPublic #CodingJourney #Day23

🚀 Mastering Java TreeSet – Sorted, Unique, and Efficient! Recently, I explored the powerful TreeSet in Java, a part of the Collection Framework designed for storing unique elements in a sorted order. 🔹 Key Highlights: Built on a Red-Black Tree structure for balanced performance Automatically sorts elements based on natural ordering or custom comparator No duplicates allowed Does not maintain insertion order Does not allow heterogeneous data (requires comparable types) 🔹 Useful Methods: headSet() – Retrieves elements less than a specified value tailSet() – Retrieves elements greater than or equal to a specified value subSet() – Fetches a range of elements 🔹 Hierarchy Insight: TreeSet implements the NavigableSet interface and is a part of the Java Collection Framework 💡 TreeSet is a great choice when you need sorted data with fast retrieval and no duplicates, making it ideal for scenarios like ranking systems, leaderboards, and ordered data processing. #Java #DataStructures #JavaCollections #TreeSet #CodingJourney #SoftwareDevelopment #TapAcademy

Solved Simple Array Sum using LinkedList in Java 8 💻📊 Today I worked on the Simple Array Sum problem and implemented it using LinkedList in Java 8. 💡 What I learned: How to convert a List into a LinkedList Traversing elements efficiently using loops Using Java 8 Streams for cleaner and shorter code ⚙️ Approach: Converted input list into a LinkedList Iterated through elements and calculated sum Also explored stream().mapToInt().sum() for optimized solution 📌 Key Takeaway: Even simple problems help strengthen core concepts like data structures and improve coding efficiency. ⚡ Time Complexity: O(n) ⚡ Space Complexity: O(n) 👨💻 Consistent practice is helping me improve my problem-solving skills step by step. #Java #Java8 #LinkedList #Coding #ProblemSolving

🚀 Day 9 – Understanding Functions and Memory in Java Today, I learned deeper concepts of functions (methods) in Java, especially how they work inside memory and how data is passed between them. First, I understood what happens in memory when a function is called. When a method runs, a new block called a stack frame is created in memory. Each function has its own space, and once the function finishes, that memory is removed. This helped me visualize how programs execute step by step. Next, I learned about Call by Value. In Java, values are always passed by value, not by reference. This means when we pass a variable to a function, a copy of that value is created. So, even if we change the value inside the function, the original value in the main method does not change. This concept was very important to understand. Then, I practiced writing a function to find the product of two numbers. I learned how to pass values as parameters, perform calculations inside the function, and return the result back to the main method. Finally, I worked on finding the factorial of a number (n = 4) using a loop. I understood the logic step by step: 1 × 2 × 3 × 4 = 24. This helped me improve my understanding of loops and function logic together. 💪 I will continue practicing daily and build strong programming fundamentals. #Java #Coding #DSA #LearningJourney #Consistency

Day 49-What I Learned In a Day (JAVA) Today, I focused on understanding the execution flow of static elements in Java. 🔹 Learned about: • Static variables and how they are shared across objects • Static methods and how they can be accessed without object creation • Static initializer (single-line) • Static initializer (multi-line) This helped me clearly understand how Java handles memory and execution at the class level before objects are created. Building strong fundamentals step by step! #Java #Programming #LearningJourney #OOP #TechSkills