Most Java beginners think a variable is "just a box that stores data." But there's SO much more happening under the hood. 🧵 --- When you run a Java program, the JVM carves out a region in RAM called the JRE — divided into 4 segments: 📦 Code Segment → your bytecode lives here 🔵 Static Segment → static variables 🟢 Heap Segment → objects & instance variables 🟡 Stack Segment → local variables & method calls Every variable you declare lands in one of these. Knowing WHERE matters. --- There are 2 types of variables in Java: 🔷 INSTANCE VARIABLES → Declared inside a class, outside any method → Memory allocated in the HEAP → JVM auto-assigns default values (0, false, null) → Each object gets its own copy → Lives as long as the object lives 🔶 LOCAL VARIABLES → Declared inside a method → Memory allocated in the STACK → NO default values — must initialize before use → Temporary — dies when the method exits One rule that catches every beginner: Local variables have NO default values. Use without initializing = compiler error. Every time. --- Now the concept that separates beginners from intermediate devs 👇 PASS BY VALUE vs PASS BY REFERENCE 📋 Pass by Value: When you do b = a → Java COPIES the value. Change b later? a is untouched. Always. int a = 1000; b = a; b = 2000; → a is still 1000. 🔗 Pass by Reference: When you assign objects → Java copies the ADDRESS (reference). Both variables now point to the SAME object in memory. Change via b? a sees it too. Same object. Same heap address. Car a = new Car(); // address: 1000 Car b = a; // b also points to 1000 b.name = "KIA"; // a.name is now "KIA" too 🤯 This is why Java strings and arrays behave "unexpectedly" for beginners. --- Quick Reference: Feature → Local vs Instance Definition → inside method vs inside class Scope → method only vs entire class Initialization → manual vs JVM default Memory → Stack vs Heap Lifetime → method ends vs object exists --- The moment you understand Stack vs Heap + Pass by Value vs Reference — Java starts making sense at a deeper level. Save this. Revisit it when debugging weird variable behavior. 🔖 #Java #Programming #LearnToCode #JavaDeveloper #OOP #CodingTips #ComputerScience #Upskill #Tech #SoftwareEngineering
Varun Paladugula’s Post
More Relevant Posts
-
💡 Java Internals: How HashMap Actually Works Many developers use HashMap every day, but very few understand what actually happens internally. Here is the complete flow in 5 core concepts: 0️⃣ Implementation of HashMap HashMap is one of the main implementations of the Map interface. public class HashMap<K,V> extends AbstractMap<K,V> implements Map<K,V>, Cloneable, Serializable Key facts: • Stores key–value pairs • Allows 1 null key and multiple null values • Not thread-safe 1️⃣ Internal Structure (Nodes & Buckets) Internally HashMap stores entries as Nodes. Each Node contains four components: • Key → identifier used to retrieve value • Value → actual stored data • Hash → hash value derived from key • Next pointer → link to the next node in case of collision All nodes are stored in an array called the bucket table Node<K,V>[] table Each index in this array is called a bucket 2️⃣ How Data is Stored in HashMap Insertion happens in three steps: Step 1 - Hashing the key hash = key.hashCode() Java improves distribution internally: hash = h^(h>>>16) Step 2 — Calculating the index index = (n - 1)&hash where n = array size. HashMap keeps capacity as a power of 2 to make this fast. Step 3 — Store in bucket If bucket is empty → entry stored directly. If not → collision occurs 3️⃣ Collision Handling A collision happens when multiple keys map to the same bucket index. Example: map.put("apple",50) map.put("orange",80) Both may land in the same bucket. Handling differs by Java version. Before Java 8 Bucket → Linked List Worst-case search: O(n) After Java 8,If bucket size exceeds 8 entries: Linked List → Red Black Tree New complexity:O(log n) This process is called Treeification,happens only when table size ≥ 64 4️⃣ HashMap Resizing (Rehashing) HashMap automatically resizes to maintain efficiency. Default values: Initial Capacity = 16 Load Factor = 0.75 Resize condition: size > capacity × loadFactor Example: 16×0.75 = 12 The 13th insertion triggers resizing 5️⃣ What Happens During Resizing 🌟 Array size doubles 16 → 32 → 64 → 128 🌟 All existing entries are rehash redistributed 🌟 Each entry moves to its new bucket position Performance Summary Average case: get() → O(1) put() → O(1) Worst case: Before Java 8 → O(n) After Java 8 → O(log n) Interesting HashMap Facts 🔹 HashMap capacity is always a power of 2 so (n - 1) & hash can replace slower modulo operations. 🔹 Treeification occurs only when bucket size ≥ 8 AND table size ≥ 64 🔹 During resizing, entries do not require full rehash computation Because the capacity doubles, each entry either: stays in the same index or moves to index + oldCapacity This clever optimization makes resizing much faster than expected. HashMap is a great example of how arrays, hashing, linked lists, and trees combine to build a highly efficient data structure. #Java #HashMap #JavaCollections #SoftwareEngineering #BackendDevelopment #JavaInterview #InterviewPreparation
To view or add a comment, sign in
-
🚀 Java Collections Deep Dive: Mastering the ArrayList ✔️ If you are working with data in Java, the ArrayList is likely your most-used tool. But knowing the methods is only half the battle—you also need to know how to handle them safely! 📦 1. Essential ArrayList Methods ✔️ The ArrayList is a dynamic array that provides a massive range of built-in functionality: 🔸 add(element): Add a single element. 🔸 get(index): Retrieves the element at a specific position. 🔸set(index, element): Replaces the element at a specific index. 🔸 remove(index/object): Deletes a specific element or an element at a certain index. 🔸 contains(element): Checks if a single element exists in the list. 🔸 containsAll(collection): Checks if the list contains a group of elements. 🔸 indexOf(element): Finds the first occurrence of an item. 🔸 lastIndexOf(element): Finds the last occurrence of an item. 🔸 size(): Returns the number of elements. 🔸 addAll(collection): Merges another collection into your list. 🔸 clear(): Wipes the entire list clean. 🔸 isEmpty(): A quick boolean check to see if the list is empty. 🛡️ 2. The Role of Generics <T> ✔️ Before Generics, lists could hold any object, which often led to runtime crashes. ✔️By using Generics, we enforce Type Safety. ✔️ Example: ArrayList<String> ensures that only Strings can be added. The compiler checks this for you, so you don't have to worry about ClassCastException later. ⚠️ 3. The ConcurrentModificationException Trap ➡️ Have you ever tried to remove an element while looping through a list using a for-each loop? ❌ CRASH! You’ll get a ConcurrentModificationException. This happens because Java doesn't allow the list's structure to change while it is being traversed by a standard loop. 🔄 4. The Solution: Using an Iterator ✔️ To overcome the crash above, we use an Iterator. It is an object that allows us to traverse the list and modify it safely. 🔹 hasNext(): Checks if there is a next element. 🔹 next(): Returns the next element. 🔹remove(): Safely removes the current element from the list. 💻 The "Interview Special" ➡️ import java.util.*; public class ArrayListMastery { public static void main(String[] args) { ArrayList<String> skills = new ArrayList<>(); skills.add("Java"); skills.add("Spring Boot"); skills.add("Microservices"); skills.add("Java"); System.out.println("Get Index 1: " + skills.get(1)); System.out.println("Contains Java? " + skills.contains("Java")); System.out.println("Last Index: " + skills.lastIndexOf("Java")); //The Interview "Trick": Safe Removal using Iterator // Overcomes ConcurrentModificationException Iterator<String> it = skills.iterator(); while (it.hasNext()) { if (it.next().equals("Java")) { it.remove(); } } System.out.println("Final List: " + skills); } } #Java #CodingInterview #SoftwareEngineering #JavaCollections
To view or add a comment, sign in
-
Standard Signature of main() Method in Java In every programming language there must be an entry point of execution from where program execution begins. In C/C++, the entry point is the main() function, which is invoked by the Operating System. OS expects 0 as exit status indicating successful program execution so the return type of main is commonly int. In Java, the entry point is also the main() method, but it is invoked by the Java Virtual Machine (JVM) instead of the OS. Since the JVM handles execution internally, there is no need to return a status code, therefore the return type of the main method is always void. In Java, every method belongs to a class, so the main method must be defined inside a class. Example: class Main { void main() { // code } } However, this method cannot be executed by the JVM because it is not accessible outside the class. To allow the JVM to access it, the method must be declared public. class Main { public void main() { // code } } In Java, methods normally belong to objects and are invoked using an object reference. If the main method were not static, the JVM would have to create an object of the class before calling it. Since main is the entry point of every program, this would add unnecessary overhead. To allow the JVM to invoke the method without creating an object, the main method is declared static. class Main { public static void main() { // code } } But this method still cannot receive data from the command line arguments. To accept input from the command line during program execution, the main method takes a parameter which is an array of strings. Each element of this array represents one argument passed from the command line. Final standard signature of the main method: class Main { public static void main(String[] args) { // code } } Here: public → allows the JVM to access the method static → allows the JVM to call the method without creating an object void → no return value required String[] args → receives command line arguments However, for a beginner writing "public static void main(String[] args)" is overwhelming. So Java developer decided to introduce simplified syntax for new comer to maintain language acceptance and popularity among all. In newer Java versions, we can write a simpler program like: void main() { System.out.println("Hello"); } Introduced in JDK 21 and finally accepted in JDK 25 (2025). The compiler automatically wraps this into a class behind the scenes. However, this feature is mainly designed for learning and small scripts, while the traditional main method remains the standard approach used in real applications. Grateful to my mentor Syed Zabi Ulla for explaining these concepts so clearly and helping me build a strong foundation in programming. #OOP #Java #Programming #ComputerScience #LearningJourney #SoftwareDevelopment
To view or add a comment, sign in
-
𝗗𝗔𝗬 𝟯 – 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲 𝗼𝗳 𝗮 𝗝𝗮𝘃𝗮 𝗣𝗿𝗼𝗴𝗿𝗮𝗺 + 𝗝𝗮𝘃𝗮 𝗧𝗼𝗸𝗲𝗻𝘀 𝗜𝗻 𝘁𝗵𝗲 𝗹𝗮𝘀𝘁 𝘁𝘄𝗼 𝗽𝗼𝘀𝘁𝘀 𝘄𝗲 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗼𝗼𝗱: • Why Java is Platform Independent • How JDK, JRE, and JVM work together to run a Java program Now it's time to move from 𝘁𝗵𝗲𝗼𝗿𝘆 → 𝗮𝗰𝘁𝘂𝗮𝗹 𝗰𝗼𝗱𝗲. 𝗟𝗲𝘁’𝘀 𝘄𝗿𝗶𝘁𝗲 𝗮 𝘀𝗶𝗺𝗽𝗹𝗲 𝗝𝗮𝘃𝗮 𝗽𝗿𝗼𝗴𝗿𝗮𝗺. ``` 𝚙𝚞𝚋𝚕𝚒𝚌 𝚌𝚕𝚊𝚜𝚜 𝙷𝚎𝚕𝚕𝚘𝚆𝚘𝚛𝚕𝚍 { 𝚙𝚞𝚋𝚕𝚒𝚌 𝚜𝚝𝚊𝚝𝚒𝚌 𝚟𝚘𝚒𝚍 𝚖𝚊𝚒𝚗(𝚂𝚝𝚛𝚒𝚗𝚐[] 𝚊𝚛𝚐𝚜) { 𝚂𝚢𝚜𝚝𝚎𝚖.𝚘𝚞𝚝.𝚙𝚛𝚒𝚗𝚝𝚕𝚗("𝙷𝚎𝚕𝚕𝚘 𝚆𝚘𝚛𝚕𝚍"); } } ``` At first glance this may look confusing. But if we break it down, the structure becomes very simple. 𝗦𝘁𝗿𝘂𝗰𝘁𝘂𝗿𝗲 𝗼𝗳 𝗮 𝗝𝗮𝘃𝗮 𝗣𝗿𝗼𝗴𝗿𝗮𝗺 Every Java program generally contains: 1️⃣ 𝗖𝗹𝗮𝘀𝘀 𝗗𝗲𝗰𝗹𝗮𝗿𝗮𝘁𝗶𝗼𝗻 𝚙𝚞𝚋𝚕𝚒𝚌 𝚌𝚕𝚊𝚜𝚜 𝙷𝚎𝚕𝚕𝚘𝚆𝚘𝚛𝚕𝚍 In Java, everything starts with a class. The filename must match the class name. Example: 𝙷𝚎𝚕𝚕𝚘𝚆𝚘𝚛𝚕𝚍.𝚓𝚊𝚟𝚊 2️⃣ 𝗠𝗮𝗶𝗻 𝗠𝗲𝘁𝗵𝗼𝗱 𝚙𝚞𝚋𝚕𝚒𝚌 𝚜𝚝𝚊𝚝𝚒𝚌 𝚟𝚘𝚒𝚍 𝚖𝚊𝚒𝚗(𝚂𝚝𝚛𝚒𝚗𝚐[] 𝚊𝚛𝚐𝚜) This is the entry point of every Java program. When we run a program, the JVM starts execution from the 𝗺𝗮𝗶𝗻() 𝗺𝗲𝘁𝗵𝗼𝗱. 3️⃣ 𝗦𝘁𝗮𝘁𝗲𝗺𝗲𝗻𝘁𝘀 𝚂𝚢𝚜𝚝𝚎𝚖.𝚘𝚞𝚝.𝚙𝚛𝚒𝚗𝚝𝚕𝚗("𝙷𝚎𝚕𝚕𝚘 𝚆𝚘𝚛𝚕𝚍"); This statement simply prints output on the console. 𝗡𝗼𝘄 𝗹𝗲𝘁’𝘀 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱 𝘀𝗼𝗺𝗲𝘁𝗵𝗶𝗻𝗴 𝘃𝗲𝗿𝘆 𝗶𝗺𝗽𝗼𝗿𝘁𝗮𝗻𝘁 𝗶𝗻 𝗝𝗮𝘃𝗮. 𝗝𝗮𝘃𝗮 𝗧𝗼𝗸𝗲𝗻𝘀 Tokens are the smallest building blocks of a Java program. Java programs are basically made up of tokens. 𝗧𝗵𝗲𝗿𝗲 𝗮𝗿𝗲 𝗺𝗮𝗶𝗻𝗹𝘆 𝟱 𝘁𝘆𝗽𝗲𝘀: • 𝗞𝗲𝘆𝘄𝗼𝗿𝗱𝘀 → public, class, static, void • 𝗜𝗱𝗲𝗻𝘁𝗶𝗳𝗶𝗲𝗿𝘀 → names of variables, classes, methods • 𝗟𝗶𝘁𝗲𝗿𝗮𝗹𝘀 → actual values (10, "Hello", true) • 𝗦𝗲𝗽𝗮𝗿𝗮𝘁𝗼𝗿𝘀 → { } ( ) [ ] ; , • 𝗢𝗽𝗲𝗿𝗮𝘁𝗼𝗿𝘀 → + - * / = == Example identifier rules: ✔ Cannot start with a number ✔ Cannot use Java keywords ✔ No spaces allowed ✔ Can use letters, numbers, _ and $ Once you understand structure + tokens, reading Java code becomes much easier. If you look at the Java program again, you’ll now notice: It is simply a combination of tokens working together. Once you understand tokens and structure, reading Java code becomes much easier. 𝗧𝗼𝗺𝗼𝗿𝗿𝗼𝘄 (𝗗𝗮𝘆 𝟰) 𝗪𝗲’𝗹𝗹 𝗴𝗼 𝗱𝗲𝗲𝗽𝗲𝗿 𝗶𝗻𝘁𝗼 𝗼𝗻𝗲 𝗼𝗳 𝘁𝗵𝗲 𝗺𝗼𝘀𝘁 𝗶𝗺𝗽𝗼𝗿𝘁𝗮𝗻𝘁 𝘁𝗼𝗽𝗶𝗰𝘀 𝗶𝗻 𝗝𝗮𝘃𝗮: • Data Types • Variables • Primitive vs Non-Primitive types • Memory basics behind variables Because before writing real programs, understanding how Java stores data is critical. 𝗦𝗲𝗲 𝘆𝗼𝘂 𝗶𝗻 𝗗𝗮𝘆 𝟰. #Java #BackendDevelopment #Programming #LearnInPublic #Day3
To view or add a comment, sign in
-
🚀 Mastering Java Stream API – Write Cleaner, Smarter Code If you're still writing verbose loops in Java, it's time to rethink your approach. The Stream API (introduced in Java 8) is not just a feature—it’s a paradigm shift toward functional-style programming in Java. It allows you to process collections of data in a declarative, concise, and efficient way. 🔍 What is Stream API? A Stream is a sequence of elements that supports various operations to perform computations. Unlike collections, streams: Don’t store data Are immutable (operations don’t modify the source) Support lazy evaluation Enable parallel processing effortlessly ⚙️ Core Concepts 1. Stream Creation List<String> names = Arrays.asList("John", "Jane", "Jack"); Stream<String> stream = names.stream(); 2. Intermediate Operations (Lazy) filter() map() sorted() These return another stream and are not executed until a terminal operation is invoked. names.stream() .filter(name -> name.startsWith("J")) .map(String::toUpperCase); 3. Terminal Operations (Trigger Execution) forEach() collect() count() List<String> result = names.stream() .filter(name -> name.length() > 3) .collect(Collectors.toList()); 💡 Why Use Stream API? ✅ Readable & Declarative Code Focus on what to do, not how to do it ✅ Less Boilerplate Goodbye nested loops ✅ Parallel Processing names.parallelStream().forEach(System.out::println); ✅ Functional Programming Power Lambdas + Streams = Clean pipelines 🔥 Real-World Example Traditional Approach List<String> filtered = new ArrayList<>(); for (String name : names) { if (name.length() > 3) { filtered.add(name.toUpperCase()); } } Stream API Approach List<String> filtered = names.stream() .filter(name -> name.length() > 3) .map(String::toUpperCase) .collect(Collectors.toList()); 👉 Less code. More clarity. Better maintainability. ⚠️ Common Pitfalls Overusing streams can hurt readability Avoid complex nested streams Be cautious with parallel streams (thread-safety matters) 🧠 Pro Tip Think of streams as a data pipeline: Source → Intermediate Operations → Terminal Operation 📌 Final Thoughts The Stream API is a must-have skill for modern Java developers. It helps you write clean, scalable, and expressive code, especially in microservices and data-heavy applications. If you're building backend systems with Java, mastering streams is not optional—it's essential. 💬 How often do you use Stream API in your projects? Any advanced patterns you rely on? #Java #StreamAPI #BackendDevelopment #Java8 #CleanCode #FunctionalProgramming #SoftwareEngineering
To view or add a comment, sign in
-
📌 Java 8 Functional Interfaces — Explained with Use Cases Java provides built-in functional interfaces to support lambda expressions and functional programming. Here are the most important ones every Java developer should know: --- 1️⃣ Runnable @FunctionalInterface public interface Runnable { void run(); } ✔ Takes: No input ✔ Returns: Nothing Use Case: • Multithreading tasks Example: Runnable r = () -> System.out.println("Task running"); --- 2️⃣ Callable @FunctionalInterface public interface Callable<V> { V call() throws Exception; } ✔ Takes: No input ✔ Returns: Result Use Case: • Tasks that return values (ExecutorService) Example: Callable<Integer> c = () -> 10; --- 3️⃣ Comparator @FunctionalInterface public interface Comparator<T> { int compare(T o1, T o2); } ✔ Takes: Two inputs ✔ Returns: int Use Case: • Sorting collections Example: list.sort((a, b) -> a - b); --- 4️⃣ Function<T, R> ✔ Takes: One input ✔ Returns: One output Use Case: • Transforming data Example: Function<String, Integer> f = s -> s.length(); --- 5️⃣ Predicate<T> ✔ Takes: One input ✔ Returns: boolean Use Case: • Filtering conditions Example: Predicate<Integer> p = x -> x > 10; --- 6️⃣ Consumer<T> ✔ Takes: One input ✔ Returns: Nothing Use Case: • Performing actions (printing, logging) Example: Consumer<String> c = s -> System.out.println(s); --- 7️⃣ Supplier<T> ✔ Takes: No input ✔ Returns: Value Use Case: • Lazy value generation Example: Supplier<Double> s = () -> Math.random(); --- 🧠 Quick Summary Runnable → No input, no output Callable → No input, returns output Function → Input → Output Predicate → Input → boolean Consumer → Input → action Supplier → No input → output --- 💡 Key Takeaway These interfaces form the backbone of Java 8 features like Streams and Lambdas. Mastering them helps write clean, functional, and expressive code. #Java #Java8 #FunctionalInterfaces #Lambda #BackendDevelopment
To view or add a comment, sign in
-
🚀 Java Evolution: From Java 8 to Java 25 (LTS) – Don’t Call It “Old” Yet! 👀 Think Java is just a relic of the past? Think again. It’s quietly become one of the most modern, scalable, and developer-friendly languages out there. Let’s take a whirlwind tour of its transformation. Buckle up! 🔍 🔹 Java 8 – The Revolution Begins (2014) This is where Java stopped being “that verbose enterprise thing” and started flexing. ✅ Lambdas & Functional Programming: Say hello to cleaner, expressive code. ✅ Stream API: Data processing got a functional makeover. ✅ Date & Time API: Finally, no more Calendar class nightmares. 🔹 Java 11 – Polished & Production-Ready (2018) Java shed some baggage and became a smoother ride. ✅ Standard HTTP Client: Networking without the third-party hassle. ✅ String & API Enhancements: Small tweaks, big quality-of-life wins. ✅ Developer Experience: Less friction, more focus. 🔹 Java 17 (LTS) – The Modern Backbone (2021) The go-to for most companies today. It’s stable, modern, and packed with goodies. ✅ Records: Boilerplate? What boilerplate? Data classes made easy. ✅ Sealed Classes: Control your inheritance like a pro. ✅ Pattern Matching for instanceof: Cleaner, smarter type checks. 🔹 Java 21 (LTS) – Concurrency King (2023) This is where Java redefined scalability. Mind-blowing stuff. ✅ Virtual Threads (Project Loom): Handle thousands of threads without breaking a sweat. ✅ Pattern Matching for switch: Logic so clean, it’s almost poetic. ✅ Sequenced Collections: Ordered data structures, done right. 🔹 Java 22 – Refining the Craft (2024) Java keeps trimming the fat, making life easier for devs. ✅ Unnamed Variables & Patterns: Less typing, more doing. ✅ Stream API Enhancements: Even more power for data wrangling. ✅ String Templates (Preview): Formatting strings without the mess. 🔹 Java 25 (LTS) – Future-Proofed & Ready (2025) The next frontier (based on current roadmaps and speculation). ✅ Advanced Pattern Matching: Code that reads like plain English. ✅ Performance & Garbage Collection Boosts: Faster, leaner, meaner. ✅ Virtual Thread Ecosystem: Concurrency on steroids. ✅ Expressive Syntax: Java, but somehow even prettier. 💡 Key Takeaway from This Journey: Java isn’t just about “write once, run anywhere” anymore. It’s a powerhouse of performance, scalability, and developer productivity. Ignore the memes – this language is thriving. 📌 If You’re Learning Java Today: Master Java 17 for a solid foundation (it’s the current LTS sweet spot). Get comfy with Java 21 for cutting-edge features like Virtual Threads. Keep an eye on Java 25 – it’s where the future is heading. 👇 Drop a Comment: Which Java version are you rocking right now? Are you hyped for Java 25, or sticking with the tried-and-true? Let’s chat! #Java #SoftwareEngineering #BackendDevelopment #JavaDeveloper #Programming #Coding #Tech #Developers #Learning #CareerGrowth
To view or add a comment, sign in
-
-
Day 49 – Java 2026: Smart, Stable & Still the Future Difference Between Static and Non-Static Initializers in Java In Java, initializer blocks are used to initialize variables during the class loading or object creation phase. There are two types: Static Initializer Non-Static (Instance) Initializer Understanding their difference helps in learning how JVM memory management and class loading work. 1. Static Initializer A static initializer block is used to initialize static variables of a class. It executes only once when the class is loaded into memory by the ClassLoader. class Example { static int a; static { a = 10; System.out.println("Static initializer executed"); } public static void main(String[] args) { System.out.println(a); } } Key idea: It runs once during class loading. 2. Non-Static Initializer A non-static initializer block is used to initialize instance variables. It executes every time an object is created. class Example { int b; { b = 20; System.out.println("Non-static initializer executed"); } Example() { System.out.println("Constructor executed"); } public static void main(String[] args) { new Example(); new Example(); } } Key idea: It runs every time an object is created. 3. Key Differences FeatureStatic InitializerNon-Static InitializerKeywordUses staticNo keywordExecution timeWhen class loadsWhen object is createdRuns how many timesOnce per classEvery object creationVariables initializedStatic variablesInstance variablesMemory areaMethod AreaHeapExecution orderBefore main()Before constructor4. Execution Flow in JVM When a Java program runs: ClassLoader loads the class Static initializer executes main() method starts Object is created Non-static initializer executes Constructor executes Flow: Program Start ↓ Class Loaded ↓ Static Initializer ↓ Main Method ↓ Object Creation ↓ Non-Static Initializer ↓ Constructor Key Insight Static initializer → class-level initialization (runs once) Non-static initializer → object-level initialization (runs every object creation) Understanding these concepts helps developers clearly see how JVM manages class loading, memory, and object initialization. #Java #JavaDeveloper #JVM #OOP #Programming #BackendDevelopment
To view or add a comment, sign in
-
🚀 Java Collections Framework – Explained Simply Today I want to explain one of the most important concepts in Java: Collections. When working with Java applications, we often need to store and manage groups of objects. Instead of using arrays with fixed sizes, Java provides the Collections Framework, which allows us to store, manage, and manipulate data dynamically. 🔹 What is a Collection in Java? A Collection is a framework that provides an architecture to store and manipulate a group of objects. With collections we can easily: • Add elements • Remove elements • Search elements • Sort data • Traverse through elements All collection classes are available in the java.util package. ⸻ 📌 Main Interfaces in the Collection Framework The Java Collections Framework mainly includes: 1️⃣ List 2️⃣ Set 3️⃣ Queue 4️⃣ Map (part of the framework but not a subtype of Collection) ⸻ 📍 List Interface A List is an ordered collection that allows duplicate elements. Key features: • Maintains insertion order • Allows duplicates • Supports index-based access Common implementations: ArrayList, LinkedList, Vector, Stack Example: List list = new ArrayList<>(); list.add(“Java”); list.add(“Python”); list.add(“Java”); ⸻ 📍 Set Interface A Set is a collection that does not allow duplicate elements. Key features: • Stores unique elements • Useful when duplicates are not allowed Common implementations: HashSet, LinkedHashSet, TreeSet Example: Set set = new HashSet<>(); set.add(10); set.add(20); set.add(10); ⸻ 📍 Queue Interface A Queue follows the FIFO principle (First In First Out). The first element inserted will be the first element removed. Common implementations: PriorityQueue, ArrayDeque, LinkedList Example: Queue queue = new LinkedList<>(); queue.add(1); queue.add(2); queue.poll(); ⸻ 📍 Map Interface A Map stores data in key-value pairs. Key features: • Keys must be unique • Values can be duplicated • Provides fast data retrieval Common implementations: HashMap, LinkedHashMap, TreeMap, Hashtable Example: Map<Integer, String> map = new HashMap<>(); map.put(1, “Java”); map.put(2, “Python”); ⸻ 💡 Why Collections are Important Collections help developers to: ✔ Handle dynamic data ✔ Reduce code complexity ✔ Improve performance ✔ Use built-in algorithms like sorting and searching ⸻ ✨ Final Thought Mastering the Java Collections Framework is essential for every Java developer because it is widely used in real-world applications and technical interviews. 💬 What Java collection do you use most in your projects? #Java #JavaCollections #Programming #SoftwareDevelopment #Coding #JavaDeveloper
To view or add a comment, sign in
-
Java 26 just dropped! But most developers have not even adopted Java 21 features yet. Here are 5 modern Java features you should be using every single day. —— 1. Switch Expressions: clean and exhaustive (Java 14+) // Before: verbose, fall-through prone String label; switch (status) { case ACTIVE: label = "Active"; break; case PENDING: label = "Pending"; break; default: label = "Unknown"; } // After: String label = switch (status) { case ACTIVE -> "Active"; case PENDING -> "Pending"; default -> "Unknown"; }; No fall-through bugs. Compiler ensures all cases are handled. —— 2. Text Blocks: readable multiline strings (Java 15+) // Before: String json = "{\n \"name\": \"Alice\",\n \"role\": \"admin\"\n}"; // After: String json = """ { "name": "Alice", "role": "admin" } """; Clean SQL, JSON, HTML — no escape characters. Just readable strings. —— 3. Optional: use it properly (Java 8+, daily practice) // Bad: Optional user = userRepo.findById(id); if (user.isPresent()) { return user.get(); } return null; // Good: return userRepo.findById(id) .orElseThrow(() -> new UserNotFoundException("User not found: " + id)); Optional exists to eliminate null checks — not to wrap them. Never use .get() alone. Always orElseThrow() or orElse(). —— 4. Pattern Matching for Switch: Java 21 flagship (Java 21) // Before: fragile instanceof chain if (obj instanceof Integer i) return "int: " + i; if (obj instanceof String s) return "str: " + s; // After: clean, compiler-verified return switch (obj) { case Integer i -> "int: " + i; case String s -> "str: " + s; default -> "unknown"; }; // Even better with guards: return switch (order) { case Order o when o.isPaid() -> "Paid"; case Order o when o.isPending() -> "Pending"; default -> "Unknown"; }; Replaces entire if-instanceof chains. Safe, readable, exhaustive. —— 5. New String methods: small but mighty (Java 11–17) input.strip(); // Unicode-aware trim() input.isBlank(); // true if empty or whitespace input.repeat(3); // repeats string N times "line1\nline2".lines(); // Stream by line "hello %s".formatted("world"); // cleaner than String.format() No libraries needed. Used constantly. Zero excuses not to. ---------------------------------------------------------------- Java is not the verbose language it used to be. Pick one feature. Use it in your next PR. Then the next one. Java 26 post coming next. Stay tuned! Which one are you already using daily? Drop a number below.. #Java #Java17 #Java21 #BackendDevelopment #SpringBoot #SoftwareEngineering #CleanCode
To view or add a comment, sign in
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development