Java For Loop Basics: Initialization, Condition, Update

📌 Arrays and Jagged Arrays in Java Hi Connections 👋 Understanding arrays is one of the first steps in learning Java properly. 🔹 What is an Array in Java? An array is a collection of elements of the same data type stored in continuous memory locations. ✔ Fixed size ✔ Same data type ✔ Access using index (starts from 0) 🔹 What is a 2D Array? >>A 2D array is like a table (rows and columns). >>Each row has the same number of columns. 🔹 What is a Jagged Array? >>A jagged array is a 2D array where each row can have a different number of columns. >>So the size of each row is different. 💡 Why use Jagged Arrays? Saves memory Useful when data is not uniform Common in real-world problems #Java #Arrays #JaggedArray #Programming #CodingJourney #LearnJava

After finishing Arrays & ArrayLists, I revisited some core Java basics that I had already used everywhere — but hadn’t fully thought through. This revision focused on literals, operators, comments, and increment/decrement behavior. What became clearer this time: - literals are the actual constant values stored in memory, not just numbers in code - underscores in numeric literals exist for readability, not logic - operators don’t just “do operations” — they define how expressions are evaluated - the number of operands changes how an operator behaves - comments improve readability but are completely ignored by the compiler - pre-increment and post-increment can change program flow in subtle ways - a small change in expression order can change the final output Revisiting increment and decrement operators especially made me realize how easy it is to assume behavior instead of tracing execution step by step. This felt less like learning something new and more like removing hidden confusion from things I was already using daily. Sometimes going back to basics after solving harder problems makes everything cleaner. #Java #CoreConcepts #LearningInPublic #Programming #CodingJourney #JavaDeveloper #ProblemSolving

Started learning Strings in Java today. After working with arrays and matrices, this felt like moving into how real programs actually handle text and user input. The focus was on understanding how strings are created, how input is taken, and how basic built-in methods like charAt() and length() work internally. String s = "Pratim"; System.out.println(s.charAt(0));  // Output : P System.out.println(s.length());  // Output : 6 What became clear today: - Strings are not primitive values; they behave like objects with built-in functionality - Accessing characters requires methods like charAt() instead of direct indexing - length() is a method call, not a property like in arrays - Even simple text handling introduces a different way of thinking compared to numbers This felt like the starting point of working with real-world data, where most problems involve text rather than just numbers. Beginning the Strings module today. #Java #DSA #Strings #LearningInPublic #ProblemSolving #CodingJourney #Programming #JavaDeveloper #DeveloperJourney

A variable is a container used to store data that can change during the execution of a program. In Java, every variable must have a data type, which defines what kind of data it can store (like int, double, String, etc.). 🔸 Types of Variables in Java 1️⃣ Local Variable A local variable is declared inside a method, constructor, or block. ✔️ Scope: Accessible only within that method/block ✔️ Lifetime: Exists only while the method is executing ✔️ Must be initialized before use 2️⃣ Instance Variable An instance variable is declared inside a class but outside any method. ✔️ Scope: Accessible throughout the class ✔️ Lifetime: Exists as long as the object exists ✔️ Each object has its own copy 🔎 Quick Difference 🔹 Local Variable → Belongs to a method 🔹 Instance Variable → Belongs to an object #Java #Programming #SoftwareDevelopment #Coding #LearningJourney #100DaysOfCode

💡 Priority Queue Implementation using Array in Java Today I implemented a Priority Queue in Java using arrays, where elements are removed based on their priority (smallest value first) instead of FIFO order. I used a simple approach: • Insert elements using enqueue() • Find the highest priority element using loop • Remove it using dequeue() This helped me understand how priority queues work internally and how they are useful in task scheduling, operating systems, and real-time applications. Step by step, building strong fundamentals in Data Structures. 🚀 #Java #DataStructures #PriorityQueue #Programming #LearningByDoing

Week 3 : Collection framework in java Day 11 : Collection framework : A Collection represent a group of object java collections provide classes and interfaces. Why need do we need Collections : We need collections for efficient storage and better manipulation of data in java. 1) Resize of an array. 2) Insert an element in between. 3) Delete and element in between. 4) Apply certain operations to change the array. Collection : The root interface for all the other collection types. 1) List : An ordered Collection that can contain duplicate elements . Example : arraylist, Linkedlist etc. 2) Set : A collection that cannot contains duplicate elements. Example : Hashset, Treeset. 3) Queue : A collection designed for holding elements prior to processing. 4) Deque : A double ended queue that allows insertion and removal at both ends. 5) Map : An interface that represents a collection of key value pairs . #java #backend #programming #collectionframeworks #learning #advancedjava EchoBrains

🚀 Day 4/30 – Java DSA Challenge 🔎 Problem 35: Longest Subarray with At Most K Odd Numbers (Sliding Window – Variable Size) Continuing the “At Most K” Sliding Window Pattern 🔥 🧠 Problem Statement Given: int arr[] = {1,2,1,3,1,1,3,5,1}; int k = 2; Find the length of the longest subarray containing at most k odd numbers. 💡 Key Insight This is a direct application of the At Most K constraint. ✔ Expand window using r ✔ Count odd numbers ✔ If odd count exceeds k, shrink window from left ✔ Track maximum window size Condition to check odd: arr[r] % 2 != 0 This pattern is very important for: At most K distinct elements At most K zeros At most K odd/even elements Longest valid substring problems ⏱ Time Complexity O(n) → Each element enters and exits window once 📦 Space Complexity O(1) → Only counters used 📌 Key Learning “At Most K” problems follow the same structure Identify what to count (odd, distinct, zero, etc.) Sliding window becomes powerful once pattern is mastered 35 Problems Completed 🔥 Day 4 = Heavy Sliding Window Practice 💪🚀 #Day4 #30DaysOfCode #Java #DSA #SlidingWindow #Arrays #ProblemSolving #CodingJourney #Consistency

🚀 Day 31 of Importance of Static block, Static variables and Static methods Today, I explored one of the most important concepts in Java – Static Keyword 🔥 🔹 Static Variables Belong to the class, not to objects. Only one copy is created and shared among all instances. Memory is allocated only once when the class is loaded. Accessed using the class name. 🔹 Static Methods Belong to the class rather than an object. Can be called without creating an object. Mostly used for utility methods. Cannot directly access non-static instance variables. 🔹 Static Block Executes when the class is loaded into memory. Used to initialize static variables. Runs before constructors. Executes only once. Static members are shared resources of a class. They improve memory efficiency and are perfect for common data or utility logic. Understanding how static works also helped me visualize JVM memory concepts like Class Area, Stack, and Heap. #Day31 #Java #LearningJourney #StaticKeyword #Programming #BackendDevelopment

🚀 Day 4/30 – Java DSA Challenge 🔎 Problem 34: Longest Subarray with At Most K Occurrences of 1 (Sliding Window – Variable Size) Today’s pattern: At Most K condition using Sliding Window 🔥 🧠 Problem Statement Given: int arr[] = {0,1,2,1,3,1,1,0,3,5,1}; int k = 2; Find the length of the longest subarray containing at most k occurrences of 1. 💡 Key Insight This is a classic variable-size sliding window problem with a constraint. ✔ Expand window using r ✔ Count occurrences of 1 ✔ If count exceeds k, shrink from left ✔ Maintain maximum window length This pattern is commonly used in: At most K distinct elements At most K zeros / ones Longest valid substring problems ⏱ Time Complexity O(n) → Each element processed at most twice 📦 Space Complexity O(1) → Only counters used 📌 Key Learning “At Most K” → Use sliding window + shrink when condition breaks Always think in terms of expanding and contracting window Most medium-level string/array problems follow this template 34 Problems Completed 🔥 Day 4 Becoming a Sliding Window Master 💪🚀 #Day4 #30DaysOfCode #Java #DSA #SlidingWindow #Arrays #ProblemSolving #CodingJourney #Consistency

🚀 Implemented Toggle Bits Logic in Java As part of my Java practice, I developed a program to understand how bit manipulation works, specifically focusing on toggling bits of a number. 🔹 What is Toggle Bits? Toggle bits means changing every binary digit of a number: 0 becomes 1 1 becomes 0 In simple terms, it performs a binary complement of a number. 🔹 What I Implemented: ✔ Converted a decimal number into binary form logically ✔ Reversed each bit (0 → 1, 1 → 0) ✔ Reconstructed the new decimal value from the toggled binary ✔ Handled edge cases like input 0 Bit manipulation is powerful because it works directly at the binary level, making programs faster and more memory-efficient. Excited to explore more concepts in Java and improve my problem-solving skills! 💻✨ #Java #BitManipulation #Programming #CodingJourney #Learning #Developer