Java Iterator Types: Fail-Fast vs Fail-Safe

🔀 𝐂𝐨𝐧𝐜𝐮𝐫𝐫𝐞𝐧𝐭𝐌𝐨𝐝𝐢𝐟𝐢𝐜𝐚𝐭𝐢𝐨𝐧𝐄𝐱𝐜𝐞𝐩𝐭𝐢𝐨𝐧 𝙞𝙣 𝙅𝙖𝙫𝙖 Why does it happen? This is one exception many developers face while working with collections 𝐖𝐡𝐚𝐭 𝐢𝐬 𝐂𝐨𝐧𝐜𝐮𝐫𝐫𝐞𝐧𝐭𝐌𝐨𝐝𝐢𝐟𝐢𝐜𝐚𝐭𝐢𝐨𝐧𝐄𝐱𝐜𝐞𝐩𝐭𝐢𝐨𝐧? ➡️ It occurs when we modify a collection while iterating over it 📃 Example 𝐢𝐦𝐩𝐨𝐫𝐭 𝐣𝐚𝐯𝐚.𝐮𝐭𝐢𝐥.*; 𝐩𝐮𝐛𝐥𝐢𝐜 𝐜𝐥𝐚𝐬𝐬 𝐃𝐞𝐦𝐨 { 𝐩𝐮𝐛𝐥𝐢𝐜 𝐬𝐭𝐚𝐭𝐢𝐜 𝐯𝐨𝐢𝐝 𝐦𝐚𝐢𝐧(𝐒𝐭𝐫𝐢𝐧𝐠[] 𝐚𝐫𝐠𝐬) { 𝐋𝐢𝐬𝐭<𝐈𝐧𝐭𝐞𝐠𝐞𝐫> 𝐥𝐢𝐬𝐭 = 𝐧𝐞𝐰 𝐀𝐫𝐫𝐚𝐲𝐋𝐢𝐬𝐭<>(); 𝐥𝐢𝐬𝐭.𝐚𝐝𝐝(𝟏); 𝐥𝐢𝐬𝐭.𝐚𝐝𝐝(𝟐); 𝐥𝐢𝐬𝐭.𝐚𝐝𝐝(𝟑); 𝐟𝐨𝐫 (𝐈𝐧𝐭𝐞𝐠𝐞𝐫 𝐢 : 𝐥𝐢𝐬𝐭) { 𝐢𝐟 (𝐢 == 𝟐) { 𝐥𝐢𝐬𝐭.𝐫𝐞𝐦𝐨𝐯𝐞(𝐢); // 𝐜𝐚𝐮𝐬𝐞𝐬 𝐞𝐱𝐜𝐞𝐩𝐭𝐢𝐨𝐧 } } } } ⚠️ 𝐖𝐡𝐲 𝐝𝐨𝐞𝐬 𝐭𝐡𝐢𝐬 𝐡𝐚𝐩𝐩𝐞𝐧? Internally, Java collections use an Iterator When we modify the collection directly: ❌ Structure changes ❌ Iterator gets confused Throws ➡️ 𝐂𝐨𝐧𝐜𝐮𝐫𝐫𝐞𝐧𝐭𝐌𝐨𝐝𝐢𝐟𝐢𝐜𝐚𝐭𝐢𝐨𝐧𝐄𝐱𝐜𝐞𝐩𝐭𝐢𝐨𝐧 Ways to Fix ➡️ Use Iterator 𝐈𝐭𝐞𝐫𝐚𝐭𝐨𝐫<𝐈𝐧𝐭𝐞𝐠𝐞𝐫> 𝐢𝐭 = 𝐥𝐢𝐬𝐭.𝐢𝐭𝐞𝐫𝐚𝐭𝐨𝐫(); 𝐰𝐡𝐢𝐥𝐞 (𝐢𝐭.𝐡𝐚𝐬𝐍𝐞𝐱𝐭()) { 𝐢𝐟 (𝐢𝐭.𝐧𝐞𝐱𝐭() == 𝟐) { 𝐢𝐭.𝐫𝐞𝐦𝐨𝐯𝐞(); // 𝐬𝐚𝐟𝐞 } } ➡️ Use removeIf() (Java 8) list.removeIf(i -> i == 2); ▪️Always avoid modifying a collection directly during iteration ▪️Use safe methods provided by Java (use iterator) Have you ever faced this exception in your project? 🤔 How did you fix it? #Java #JavaDeveloper #JavaBackend #Programming #TechJourney #LearnBySharing #JavaConcepts #Collections #InterviewPrep #Developers

📌 Fail-Fast vs Fail-Safe Iterators in Java (A Concept Many Ignore) While working with Java collections, there’s a small concept that many developers overlook: 👉 Fail-Fast vs Fail-Safe Iterators But this concept can save you from real production bugs. 🧠 What is a Fail-Fast Iterator? Fail-Fast iterators immediately throw an exception if the collection is modified during iteration. Example: List<Integer> list = new ArrayList<>(); list.add(1); list.add(2); for (Integer i : list) {   list.add(3);  // ❌ Modification during iteration } 👉 This throws: ConcurrentModificationException 🔎 Why Does This Happen? Fail-Fast iterators track a variable called: 👉 modCount If the collection is modified during iteration, the iterator detects it and throws an exception. Fail-Safe Iterator? Fail-Safe iterators do NOT throw exceptions. Instead, they work on a copy of the collection. Example: CopyOnWriteArrayList<Integer> list = new CopyOnWriteArrayList<>(); list.add(1); list.add(2); for (Integer i : list) {   list.add(3);  // ✅ No exception } 🎯 When Should You Care? - While iterating collections - While modifying lists in loops - While debugging ConcurrentModificationException - While writing multi-threaded code Follow for more Java concepts, interview questions, and system design insights. #Java #Collections #SoftwareEngineering #JavaDeveloper #Programming

Static Block vs Instance Block in Java Static Block: - Runs once per class - Executes when the class is loaded into memory - Used for static initialization Instance Block: - Runs every time an object is created - Executes before the constructor - Used for common object setup Execution Order (IMPORTANT): 1. Static variables 2. Static blocks 3. Instance variables 4. Instance blocks 5. Constructor Example: class A { static { System.out.println("Static Block"); } { System.out.println("Instance Block"); } A() { System.out.println("Constructor"); } public static void main(String[] args) { new A(); new A(); } } Output: Static Block Instance Block Constructor Instance Block Constructor What Interviewers Are Testing: - Not syntax - But understanding of: - Class loading - Object creation lifecycle - Execution flow Connect me - https://lnkd.in/ghA7B-Mr #Java #SDET #InterviewPrep #OOP

equals() and hashCode() Contract Most Java developers override equals(). But many forget about hashCode(). And that tiny mistake breaks one of the most important contracts in Java. This contract is defined in java.lang.Object and it directly affects how collections like HashMap and HashSet behave. Let’s break it down in simple terms: • If two objects are equal according to equals(), they must return the same hashCode(). • If two objects have the same hashCode(), they may or may not be equal. • Different objects can still share the same hash code — this is called a hash collision. Why does this matter? Because hash-based collections work in two steps. • First, the object’s hashCode() decides which bucket it goes into. • Then equals() is used to compare objects inside that bucket. Now imagine this situation. • You override equals(). • But you forget to override hashCode(). • Two objects that are logically equal generate different hash codes. • They get placed in different buckets. • equals() is never even called. The result? Collections start behaving incorrectly. Example: Set<User> users = new HashSet<>(); users.add(new User(1, "Alex")); users.add(new User(1, "Alex")); Expected result: Only one object should exist. Actual result: Both objects are stored. Why? Because the map never realized they were equal. The correct rule is simple: • Override equals() • Override hashCode() • Use the same fields in both methods Good engineers don’t just implement equality. They make sure objects behave correctly inside collections. That small design detail prevents some of the hardest bugs to debug in Java backend systems. #Java #BackendEngineering #JavaDeveloper #InterviewPrep #SoftwareEngineering #TechCareers

Day 12 Today’s Java practice was about solving the Leader Element problem. Instead of using nested loops, I used a single traversal from right to left, which made the solution clean and efficient. A leader element is one that is greater than all the elements to its right. Example: Input: {16,17,5,3,4,2} Leaders: 17, 5, 4, 2 🧠 Approach I used: ->Start traversing from the rightmost element ->Keep track of the maximum element seen so far ->If the current element is greater than the maximum, it becomes a leader ->This is an efficient approach with O(n) time complexity and no extra space. ================================================= // Online Java Compiler // Use this editor to write, compile and run your Java code online class Main {   public static void main(String[] args) {     int a [] ={16,17,5,3,4,2};     int length=a.length;     int maxRight=a[length-1];     System.out.print("Leader elements are :"+maxRight+" ");           for(int i=a[length-2];i>=0;i--)     {       if(a[i]>maxRight)       {         maxRight=a[i];         System.out.print(maxRight+" ");       }     }   } } Output:Leader elements are :2 4 5 17  #AutomationTestEngineer #Selenium #Java #DeveloperJourney #Arrays

Java Puzzle for Today What will be the output of this program? String a = "Java"; String b = "Java"; String c = new String("Java"); System.out.println(a == b); System.out.println(a == c); System.out.println(a.equals(c)); Take a moment and guess before scrolling. Most beginners think the output will be: true true true But the actual output is: true false true Why does this happen? Because Java stores string literals in a special memory area called the String Pool. So when we write: String a = "Java"; String b = "Java"; Both variables point to the same object in the String Pool. But when we write: String c = new String("Java"); Java creates a new object in heap memory, even if the value is the same. That’s why: - "a == b" → true (same object) - "a == c" → false (different objects) - "a.equals(c)" → true (same value) Lesson: Use "equals()" to compare values, not "==". Small Java details like this can save you from real bugs in production. #Java #Programming #JavaPuzzle #Coding #SoftwareDevelopment

Day14 Java Practice: Maximum Product of Three Elements in an Array While practicing Java, I solved an interesting array problem: 👉 Find the maximum product that can be formed using any three elements from the array. Example: Input: {10, 3, 5, 6, -20} At first, it looks like we just need the three largest numbers. But the twist is: negative numbers can change the result! 🧠 Key Idea: The product of two negative numbers becomes positive So we must compare: Product of the three largest numbers Product of two smallest (most negative) numbers and the largest number ================================================= // Online Java Compiler // Use this editor to write, compile and run your Java code online import java.util.*; class Main {   public static void main(String[] args) {     int a [] ={10,3,5,6,-20};     Arrays.sort(a);     int n=a.length;     System.out.println(Arrays.toString(a));     int result1=a[n-1]*a[n-2]*a[n-3];          int result2=a[0]*a[1]*a[n-1];          int result =Math.max(result1,result2);     System.out.println(result);        } } Output:[-20, 3, 5, 6, 10] 300 #JavaDeveloper #Arrays #CodingPractice #QualityEngineering #TechLearning

Day 9 Java Practice: Find the First Non-Repeated Character in a String While practicing Java, I worked on a classic string problem: 👉 Find the first non-repeated character in a given string. For example, in the string "swiss", the first character that does not repeat is 'w'. To solve this, I used a LinkedHashMap to store character counts while preserving insertion order. Then I iterated through the map to find the first character with count = 1. ================================================== // Online Java Compiler // Use this editor to write, compile and run your Java code online import java.util.*; class Main {   public static void main(String[] args) {           String s="swiss";           char[] words=s.toCharArray();           Map<Character,Integer>map=new LinkedHashMap<Character,Integer>();           for(char word:words)     {      map.put(word,map.getOrDefault(word,0)+1);     }           for(Map.Entry<Character,Integer>entry:map.entrySet())     {       if(entry.getValue()==1)       {         System.out.println("First non-repeated character in the string is:"+entry.getKey());         break;       }     }               } } Output:First non-repeated character in the string is:w This was a good exercise to understand: Character frequency counting Importance of insertion order using LinkedHashMap String traversal logic #AutomationTestEngineer #Selenium #Java #CodingPractice #ProblemSolving

🚀 Most Asked Core Java Interview Questions (Part 2) Continuing from Part 1 — more frequently asked questions 👇 🔹 Multithreading Questions Thread vs Process What happens if you call run() instead of start()? What if you don’t override run()? Thread lifecycle Class level lock vs Object level lock Race condition (with example) Deadlock (with example) Runnable vs Callable ThreadLocal wait vs sleep notify vs notifyAll yield, join Why wait/notify/notifyAll present in Object class? 🔹 Concurrency & Advanced Synchronization ReentrantLock Semaphore CyclicBarrier CompletableFuture vs Future ThreadPoolExecutor (internal working) FixedThreadPool vs CachedThreadPool BlockingQueue 🔹 Coding Questions (Threads) Print even/odd using two threads Producer-Consumer problem Print numbers (0–N) using 3 threads (mod 3) Print ABCABC using 3 threads 🔹 Collections ArrayList vs LinkedList HashMap internal working HashSet vs LinkedHashSet ConcurrentHashMap vs HashMap ConcurrentHashMap vs Hashtable TreeMap vs TreeSet Comparable vs Comparator Iterator vs ListIterator vs Enumeration ConcurrentModificationException Default size of ArrayList 🔹 Advanced Collections Immutable Map WeakHashMap vs IdentityHashMap HashSet internal working If a class has ArrayList, how to make it immutable 🔹 Design Singleton class Double locking How to break Singleton 💡 Save this for revision — these are highly repeated interview questions 🔥 #Java #CoreJava #Multithreading #Collections #InterviewPreparation

🚀 Java Collections Framework – From Basics to Deep Understanding (Visual Guide) If you're learning Java or preparing for interviews, this is one topic you simply cannot skip — the Collections Framework. I created this visual to simplify not just the hierarchy, but also the internal behavior and real use-cases of each collection 👇 🔹 Start from the Root Iterable → Enables iteration Collection → Core interface for all collections 🔹 Core Interfaces Explained ✔ List → Ordered, duplicates allowed ✔ Set → Unique elements, no duplicates ✔ Queue → FIFO processing ✔ Map → Key-Value pairs (separate hierarchy) 🔹 Deep Dive into Implementations 💡 ArrayList Dynamic array Fast read (O(1)) Slow insert/delete (shift happens) 💡 LinkedList Doubly linked list Fast insertion/deletion Slow random access 💡 HashSet Uses hashing No duplicates No order 💡 LinkedHashSet Maintains insertion order Combines HashSet + LinkedList 💡 TreeSet Sorted data (Red-Black Tree) O(log n) operations 🔹 Map Internals (Very Important 🔥) 💡 HashMap Key-Value structure Uses hashing Very fast (O(1) average) 💡 LinkedHashMap Maintains insertion order 💡 TreeMap Sorted keys Based on Red-Black Tree 🔹 Queue Implementations ✔ PriorityQueue → Sorted elements ✔ ArrayDeque → Double-ended queue 🔥 Golden Rule 👉 “We don’t create objects of interfaces, we use their implementations.” List<Integer> list = new ArrayList<>(); 💡 Why this matters? Because in interviews, you’ll be asked: Difference between ArrayList vs LinkedList How HashMap works internally When to use Set vs List vs Map 📌 Pro Tip Always choose collection based on: Performance Ordering requirement Duplicate handling 💬 If this helped you, comment “COLLECTIONS” and I’ll share advanced interview questions on this topic. 📌 Save this for revision 🔁 Share with your friends preparing for Java #Java #JavaDeveloper #CollectionsFramework #DSA #CodingInterview #Programming #LearnJava #TechContent Durgesh Tiwari Anshika Singh Rohit Negi