Java ArrayList vs LinkedList: Choosing the Right Data Structure

From implementing basic arrays to building my own Generic ArrayList from scratch in Java 🚀 Recently, in an interview, I was asked to implement an ArrayList with major operations. Instead of stopping there, I took it as a challenge and went deeper. Here’s what I built: ✔ Dynamic resizing (handled capacity growth) ✔ Generic support using <T> ✔ add(element) and add(index, element) ✔ remove(index) with shifting ✔ get(index) with boundary checks ✔ size() and capacity() methods ✔ Custom toString() for clean output Along the way, I also understood an important concept: 👉 Why Java doesn’t allow new T[] (due to type erasure) 👉 How real ArrayList internally uses Object[] This wasn’t just about coding — it was about understanding how data structures actually work internally. Small improvements daily → big progress over time. #Java #DataStructures #DSA #CodingInterview #Learning #Consistency

Day 5/50 | #50DaysOfCode 📍 Platform: LeetCode 💻 Language: Java ✅ 290. Word Pattern (Easy) Today’s problem focused on mapping relationships between characters and words. It helped strengthen my understanding of hash-based data structures and bijection logic. 🔎 Approach: Split the string s into individual words Check if the length of the pattern matches the number of words Use a HashMap to map each character in the pattern to a word Ensure that each character maps to only one unique word Also verify that no two characters map to the same word Return true if the mapping follows the pattern, otherwise false 📌 Example: Input: pattern = "abba", s = "dog cat cat dog" Output: true Explanation: 'a' → "dog" 'b' → "cat" This problem improved my understanding of HashMap usage, string splitting, and bijection mapping logic in Java. #DSA #LeetCode #Java #CodingJourney #ProblemSolving #Consistency #LearningJourney #50DaysOfCode #LinkedIn

Ever wondered how your computer understands the letter "A"? 🤔 It doesn't. Not directly. Your computer only speaks one language — 0s and 1s. So when we type 'A', behind the scenes it's being converted to a binary code. This is the foundation of Character Type Data in Java. Here's the logic: → 4 symbols need 2-bit codes (2² = 4) → 8 symbols need 3-bit codes (2³ = 8) → 16 symbols need 4-bit codes (2⁴ = 16) Americans standardized this into 128 symbols → ASCII (American Standard Code for Information Interchange) — a 7-bit system. But Java said: "The world speaks more than English." So Java follows UNICODE — supporting 65,536 symbols from languages across the globe. That's why a char in Java takes 2 bytes (16-bit). --- Now here's where it gets practical — Type Casting in Java. Sometimes you need to convert one data type to another. There are two ways: 🔄 Implicit Casting (automatic) — smaller → larger type. No data loss. byte → short → int → long → float → double Java handles this silently. No worries. ⚠️ Explicit Casting (manual) — larger → smaller type. You're in control, but precision is lost. Example: double a = 45.5; byte b = (byte) a; // b stores 45, 0.5 is gone forever That 0.5? Lost. That's the trade-off. --- And lastly — Boolean in Java. Just true or false. Simple. But its size? Decided by the JVM, which is platform-dependent. --- Summary: Understanding how data is stored and converted is not just theory, it directly affects how your programs behave, perform, and sometimes fail silently. #Java #Programming #LearnToCode #ComputerScience #JavaDeveloper #CodingTips #Tech #Unicode #ASCII #TypeCasting #Upskill

Tackling the "Silent Overflow" in Java 🛑🔢 I recently worked through LeetCode #7: Reverse Integer, and it was a fantastic deep dive into how Java handles 32-bit integer limits and the dangers of "silent overflows." The Problem: Reverse the digits of a signed 32-bit integer. If the reversed number goes outside the 32-bit signed range of [-2^{31}, 2^{31} - 1], the function must return 0 The "Asymmetry" Challenge: In Java, Integer.MIN_VALUE is -2,147,483,648, while Integer.MAX_VALUE is 2,147,483,647. The negative range is one unit larger than the positive range due to Two's Complement arithmetic. This creates a massive trap: using Math.abs() on the minimum value will actually overflow and remain negative! My Optimized Solution Strategy: I implemented a two-pronged approach to handle these edge cases efficiently: 1️⃣ Pre-emptive Boundary Filtering: I added a specific optimization check at the very beginning: if(x >= Integer.MAX_VALUE - 4 || x <= Integer.MIN_VALUE + 6) return 0;. This catches values at the extreme ends of the 32-bit range immediately, neutralizing potential Math.abs overflow before the main logic even begins. 2️⃣ 64-bit Buffering: I used a long data type for the reversal calculation. This provides a 64-bit "safety net," allowing the math to complete so I can verify if the result fits back into a 32-bit int boundary. Complexity Analysis: 🚀 Time Complexity: O(log_10(n))— The loop runs once for every digit in the input (at most 10 iterations for any 32-bit integer). 💾 Space Complexity: O(1)— We use a constant amount of extra memory regardless of the input size. Small details like bit-range asymmetry can break an entire application if ignored. This was a great reminder that as developers, we must always think about the physical limits of our data types! #Java #LeetCode #SoftwareDevelopment #ProblemSolving #Algorithms #CleanCode #JavaProgramming #DataStructures #CodingLife

🚀 Day 15/30 – Java DSA Challenge 🔎 Problem 67: 225. Implement Stack using Queues (LeetCode – Easy) Continuing Day 15 with another foundational data structure problem — implementing a Stack (LIFO) using only Queue (FIFO) operations. This problem strengthens core understanding of: ✅ Stack vs Queue behavior ✅ Data Structure simulation ✅ Queue rotation logic ✅ LIFO implementation under constraints 🧠 Problem Summary We must design a stack using only standard queue operations: push(x) pop() top() empty() ⚠ Constraint: Only queue operations like add (push to back), poll (remove from front), peek, size, and isEmpty are allowed. 💡 Key Insight Stack → Last In First Out (LIFO) Queue → First In First Out (FIFO) To simulate LIFO behavior using FIFO: 👉 After every push, rotate the queue so the newly added element moves to the front. That ensures: pop() removes the most recently added element top() always returns the latest element 🔄 Approach Used 1️⃣ Use a single queue 2️⃣ On push(x): Add element to queue Rotate all previous elements behind it 3️⃣ pop() → simply poll from queue 4️⃣ top() → peek front 5️⃣ empty() → check if queue is empty ⏱ Complexity Analysis Push: O(N) Pop: O(1) Top: O(1) Space Complexity: O(N) 📌 Concepts Strengthened ✔ Stack fundamentals ✔ Queue manipulation ✔ Data structure transformation ✔ Logical thinking under constraints 📈 Learning Reflection Even though the problem is labeled Easy, it tests conceptual clarity. When constraints change, true understanding of data structures helps you adapt — not just memorize implementations. ✅ Day 15 Progress Update 🔥 67 Problems Solved in 30 Days DSA Challenge Consistency + Concept Clarity = Long-Term Mastery 🚀 #Day15 #30DaysOfDSA #Java #LeetCode #Stack #Queue #DataStructures #ProblemSolving #InterviewPreparation #CodingJourney

🚀 Day 19/30 – Java DSA Challenge 🔎 Problem 74: 206. Reverse Linked List (LeetCode – Easy) Today’s problem covered one of the most fundamental operations in Linked List data structures — reversing a singly linked list. Even though it is categorized as an Easy problem, it is one of the most frequently asked interview questions and builds strong foundations for working with pointers and node manipulation. 🧠 Problem Summary You are given the head of a singly linked list. 🎯 Goal: Reverse the linked list and return the new head. Example: Input: 1 → 2 → 3 → 4 → 5 Output: 5 → 4 → 3 → 2 → 1 💡 Key Insight To reverse a linked list, we need to change the direction of each node’s next pointer. We maintain three references during traversal: prev → stores the previous node head → current node being processed nextNode → temporarily stores the next node By updating pointers step by step, we reverse the entire list without using extra space. 🔄 Approach Used 1️⃣ Initialize prev as null 2️⃣ Traverse the linked list 3️⃣ Store next node temporarily 4️⃣ Reverse the current node’s pointer 5️⃣ Move prev and head forward 6️⃣ Continue until the list ends Finally, prev becomes the new head of the reversed list. ⏱ Complexity Analysis Time Complexity: O(n) — Each node is visited exactly once. Space Complexity: O(1) — No additional memory is used. 📌 Concepts Reinforced ✔ Linked List traversal ✔ Pointer manipulation ✔ In-place data structure modification ✔ Iterative linked list algorithms 📈 Day 19 Progress Update ✅ 74 Problems Solved in my 30 Days DSA Challenge Every day I’m strengthening my understanding of data structures, algorithm patterns, and efficient problem-solving. Consistency is turning practice into real progress 🚀 #Day19 #30DaysOfDSA #Java #LeetCode #LinkedList #DataStructures #ProblemSolving #CodingJourney #InterviewPreparation

🚀 DAY 76/150 — CHECKING SUBTREES WITH RECURSION! 🌳 Day 76 of my 150 Days DSA Challenge in Java and today I solved a problem that strengthens my understanding of tree comparison and recursion 💻🧠 📌 Problem Solved: Subtree of Another Tree 📌 LeetCode: #572 📌 Difficulty: Easy–Medium The task is to determine whether one binary tree is a subtree of another binary tree. A subtree must match both structure and node values exactly. 🔹 Approach Used I used a recursive DFS approach: • Traverse each node of the main tree • For every node: Check if the subtree starting at that node is identical to the given tree • Use a helper function to compare two trees: If both nodes are null → true If values differ → false Recursively compare left and right subtrees ⏱ Complexity Time Complexity: O(n × m) (n = nodes in main tree, m = nodes in subtree) Space Complexity: O(h) (recursion stack) 🧠 What I Learned • Tree problems often require combining traversal + comparison • Recursion is powerful for handling hierarchical structures like trees • Breaking the problem into smaller checks simplifies the solution 💡 Key Takeaway This problem taught me how to: Compare two trees efficiently Apply recursion for structural matching Think in terms of subproblems within trees 🌱 Learning Insight As I continue my Binary Tree journey, I’m understanding that: Most tree problems are based on DFS, BFS, or recursion patterns Mastering these basics makes complex tree problems easier ✅ Day 76 completed 🚀 74 days to go 🔗 Java Solution on GitHub: 👉 https://lnkd.in/gZNXaW-C 💡 In trees, solving smaller parts correctly leads to the full solution. #DSAChallenge #Java #LeetCode #BinaryTree #Recursion #DFS #150DaysOfCode #ProblemSolving #CodingJourney #InterviewPrep #LearningInPublic

The Hidden Mechanism Behind ThreadLocal in Java ThreadLocal is often explained simply as: “Data stored per thread.” That’s true — but the interesting part is how it actually works internally. Most developers think the data lives inside ThreadLocal. It doesn’t. How ThreadLocal Works Internally Each Thread object maintains its own internal structure: Thread └── ThreadLocalMap ├── ThreadLocal → Value ├── ThreadLocal → Value The important detail: The map belongs to the Thread, not to ThreadLocal. ThreadLocal simply acts as a key. Basic Flow When you call: ThreadLocal.set(value) Internally: Copy code thread = currentThread map = thread.threadLocalMap map.put(ThreadLocal, value) When you call: ThreadLocal.get() It retrieves the value from the current thread’s map. Each thread therefore has its own independent copy. Where This Is Used in Real Systems You’ll find ThreadLocal used in many frameworks: • Spring Security → SecurityContextHolder • Transaction management → TransactionSynchronizationManager • Logging correlation IDs • Request scoped context It allows frameworks to store request-specific data without passing it through every method. The Hidden Danger If you forget to call: Copy code ThreadLocal.remove() You can create memory leaks. Why? Because thread pools reuse threads. Old values may remain attached to long-lived threads. ThreadLocal is simple conceptually. But its internal design is what makes many Java frameworks work efficiently. Have you used ThreadLocal in production code? #Java #CoreJava #Multithreading #ThreadLocal #SpringBoot #BackendEngineering #InterviewPreparation

𝗙𝗿𝗼𝗺 𝟱𝟬 𝗟𝗶𝗻𝗲𝘀 𝘁𝗼 𝟭: 𝗠𝘆 𝗝𝗼𝘂𝗿𝗻𝗲𝘆 𝘄𝗶𝘁𝗵 𝗝𝗮𝘃𝗮 𝗜𝗺𝗺𝘂𝘁𝗮𝗯𝗶𝗹𝗶𝘁𝘆 🚀 I used to think creating a safe, immutable class in Java was a chore. It turns out, I was just doing it the "old" way. Here is how I moved from complex boilerplate to clean, modern Java: Phase 1: The Traditional Way (The 5 Steps) 📝 To make a standard class truly immutable, you need to follow these strict rules: final class: Stop anyone from extending and changing your logic. private final fields: Lock your variables so they can’t be reassigned. No Setters: If you don’t provide a setX() method, the data can’t change! Defensive Copying: If you have a List, copy it in the constructor so the caller can’t change it from the outside. Boilerplate: Manually write equals(), hashCode(), and toString(). (Total: ~50 lines of code for one simple object! 😫) Phase 2: The "Record" Revolution (The 1-Line Way) ⚡ Since Java 14, we can replace all that manual work with a Record. 𝐩𝐮𝐛𝐥𝐢𝐜 𝐫𝐞𝐜𝐨𝐫𝐝 𝐔𝐬𝐞𝐫(𝐒𝐭𝐫𝐢𝐧𝐠 𝐧𝐚𝐦𝐞, 𝐋𝐢𝐬𝐭<𝐒𝐭𝐫𝐢𝐧𝐠> 𝐠𝐫𝐚𝐝𝐞𝐬) {} Why this is a game-changer: It is final by default. Fields are private final by default. equals(), hashCode(), and toString() are generated for you. Phase 3: The Final Level (Deep Immutability) ❄️ Wait! Even in a Record, a List is still mutable. To make it 100% safe, use a Compact Constructor: 𝐩𝐮𝐛𝐥𝐢𝐜 𝐫𝐞𝐜𝐨𝐫𝐝 𝐔𝐬𝐞𝐫(𝐒𝐭𝐫𝐢𝐧𝐠 𝐧𝐚𝐦𝐞, 𝐋𝐢𝐬𝐭<𝐒𝐭𝐫𝐢𝐧𝐠> 𝐠𝐫𝐚𝐝𝐞𝐬) {   𝐩𝐮𝐛𝐥𝐢𝐜 𝐔𝐬𝐞𝐫 {     𝐠𝐫𝐚𝐝𝐞𝐬 = 𝐋𝐢𝐬𝐭.𝐜𝐨𝐩𝐲𝐎𝐟(𝐠𝐫𝐚𝐝𝐞𝐬); // 𝐍𝐨𝐰 𝐢𝐭'𝐬 𝐭𝐫𝐮𝐥𝐲 𝐟𝐫𝐨𝐳𝐞𝐧!   } } The Result? ✅ Thread Safety: No more race conditions. ✅ Clean Code: You focus on the data, not the "ceremony." ✅ Peace of Mind: Your objects won't change behind your back. #Java #SoftwareEngineering #CleanCode #JavaRecords #ProgrammingTips #LearningInPublic

🔹 In Java, the Map hierarchy forms the foundation for key-value data structures: Map interface → HashMap, LinkedHashMap, TreeMap. Each has its own behavior and use-case in terms of ordering, and sorting. Many developers use HashMap daily, but do you know what happens behind the scenes? Let’s decode it 👇 HashMap Internals: Beyond Simple Key-Value Storage 1️⃣ Buckets & Nodes HashMap stores entries in an array of buckets. Each bucket contains nodes, and each node holds a key-value pair. 2️⃣ Hashing: The Core Mechanism Every key generates a hash code, which is used to compute the bucket index: index = (n - 1) & hash This ensures efficient data distribution and fast access. 3️⃣ Collision Handling When multiple keys map to the same bucket → collision occurs. Java handles collisions using: Linked List (Java < 8) Red-Black Tree (Java 8+, when bucket size > 8) 4️⃣ Insertion & Retrieval Insertion (put): hash → bucket → insert/update node Retrieval (get): hash → bucket → traverse nodes → match key 5️⃣ Resize & Load Factor Default capacity = 16, load factor = 0.75 When size > capacity × load factor, HashMap resizes (doubles capacity) to maintain performance 💡 Performance Insights Average case: O(1) ✅ Worst case: O(log n) after Java 8 ✅ Takeaway: A well-implemented hashCode() and equals() is key to fast, reliable HashMap performance. #Java #HashMap #DataStructures #Programming #SoftwareEngineering #CodingTips #DeveloperInsights