feat(LinkedHashMapDemo3): demonstrate size-limited LinkedHashMap with removeEldestEntry

What
- Added LinkedHashMapDemo3 class.
- Created an anonymous subclass of LinkedHashMap overriding `removeEldestEntry`.
- Enforced automatic eviction of the eldest entry when map size exceeds 7.
- Inserted multiple entries and accessed some keys to show access-order behavior.
- Printed final contents to illustrate automatic removal.

Why
- To demonstrate how LinkedHashMap can be customized to function as a bounded cache (like LRU cache).
- Shows the real-world use case of `removeEldestEntry()` for controlling map size.
- Useful for scenarios where memory needs to be managed automatically (e.g., caching recently used items).

How
- Constructed LinkedHashMap with `accessOrder=true` to maintain order based on recent access.
- Overrode `removeEldestEntry` to return true when `size() > 7`, ensuring eviction policy.
- Added 8 entries, with key `8` triggering removal of the least recently accessed element.
- Accessed keys `2`, `5`, and `1` before inserting `8` to reorder usage.
- Iterated with forEach to display results.

Logic
- Input: put 8 entries into a LinkedHashMap with max size 7.
- Processing: `removeEldestEntry` checks if size > 7 → removes eldest entry automatically.
- Because `accessOrder=true`, "eldest" is defined by least recent access, not oldest insertion.
- Output: final map contains 7 entries (key 8 present, one least accessed entry removed).

Real-life applications
- Implementing **LRU (Least Recently Used) caches** in memory-sensitive apps.
- Bounded-size maps where stale entries should be discarded automatically.
- Frequently used in frameworks like Spring, Hibernate, or custom cache implementations.

Signed-off-by: https://github.com/Someshdiwan <[email protected]>

Author: Someshdiwan

Section25CollectionFramework/src/HashMapDemo/LinkedHashMapDemo/LinkedHashMapFixSize.java renamed to Section 25 Collections Frameworks/Map Interface/Linked HashMap/src/LinkedHashMapDemo3.java

@@ -1,25 +1,19 @@
-package HashMapDemo.LinkedHashMapDemo;
-
 import java.util.LinkedHashMap;
 import java.util.Map;
 
-public class LinkedHashMapFixSize
-{
-    public static void main(String[] args)
-    {
+public class LinkedHashMapDemo3 {
+    public static void main(String[] args) {
         // Create an anonymous subclass of LinkedHashMap that overrides removeEldestEntry
-        LinkedHashMap<Integer, String> LHM = new LinkedHashMap<>(5, 0.75F, true)
-        {
+        LinkedHashMap<Integer, String> LHM = new LinkedHashMap<>(5, 0.75F, true) {
             @Override
-            protected boolean removeEldestEntry(Map.Entry<Integer, String> eldest)
-            {
+            protected boolean removeEldestEntry(Map.Entry<Integer, String> eldest) {
                 // Remove the eldest entry if the size exceeds 7
                 return size() > 7;
             }
         };
 
-        //Suppose you want to limit the size of the Linked-Hash Map then you need to override the method
-        //inside Class and anonymous class must be...protected boolean ....
+        // Suppose you want to limit the size of the Linked-Hash Map then you need to override the method
+        // inside Class and anonymous class must be...protected boolean ....
 
         LHM.put(1,"Hello");
         LHM.put(2,"Bye");
@@ -30,9 +24,10 @@ protected boolean removeEldestEntry(Map.Entry<Integer, String> eldest)
         LHM.put(7,"Just Grind Hard Everyday and night");
 
         String s = LHM.get(2);
+
         s = LHM.get(5);
         s= LHM.get(1);
         LHM.put(8,"Least access element removed and here this is the new element added");
         LHM.forEach((k,v)->System.out.println(k+" "+v));
     }
-}
+}