Java Arrays: Memory Decisions and Performance

🚀 Day 10 – How Arrays Really Work in Java Today I went beyond basic syntax and understood how arrays actually work internally in Java. 🔎 What I explored: ✔️ How arrays are stored in contiguous memory locations ✔️ How index-based access works (0-based indexing) ✔️ How array size is fixed after creation ✔️ How reference variables point to array objects in memory ✔️ Time complexity of accessing elements – O(1) Understanding the internal working of arrays helped me realize why they are fast for accessing elements but limited when it comes to resizing. This concept is very important before moving to advanced data structures like ArrayList, LinkedList, and more. 🙏 Special thanks to Aditya Tandon Sir for explaining the internal memory concept so clearly. #Day10 #Java #Arrays #DataStructures #LearningJourney #Programming #Coding #JavaDeveloper

🚀 Day 4 — Restarting My Java Journey with Consistency Today, went deeper — beyond syntax — into how computers actually store numbers in memory. One fascinating concept I studied was 2’s complement, the method used to store negative numbers. For example, to store -42: • Write +42 in binary • Invert the bits (1’s complement) • Add 1 → gives the 2’s complement It ensures there is **only one representation of zero** and allows the CPU to perform both addition and subtraction using the same hardware circuitry — making computation simpler and faster. Another fascinating topic was floating-point representation (IEEE 754 format). A float , (double) in Java uses 32 bits , (64bits) divided into: • 1 bit , (1bit) → Sign • 8 bits , (11 bits)→ Exponent • 23 bits, (52 bits)→ Mantissa The value is calculated using the formula: (-1)^sign × (1 + mantissa) × 2^(exponent − bias) Now comes an important question — how is bias calculated and why is it needed? Bias formula: bias = 2^(k−1) − 1 where k = number of exponent bits So, • For float → k = 8 → bias = 2^(8−1) − 1 = 127 • For double → k = 11 → bias = 2^(11−1) − 1 = 1023 Why bias is used: Bias allows the exponent to represent both positive and negative powers while storing only positive binary values. This makes comparison and hardware implementation simpler and more efficient. This also answered an interesting question: Why does printing float a = 0.7f not always give the exact value? Because many decimal numbers cannot be represented exactly in binary, so the computer stores the closest possible approximation. Learning daily with Coder Army and Aditya Tandon Bhaiya and Rohit Negi Bhaiya #Day3 #Java #Consistency #BackendDevelopment #LearningJourney #SoftwareEngineering #CoderArmy #AdityaTandon

Day-10 Understanding Arrays in Java – 3D & Jagged Arrays 🔹 Exploring the concepts of Three-Dimensional Arrays and Jagged Arrays in Java with clear structure and visualization. 📌 In this post, I covered: ✔️ Structure of 3D arrays (blocks, rows, columns) ✔️ How memory is organized internally ✔️ Difference between regular and jagged arrays ✔️ Variable column lengths in jagged arrays ✔️ Practical Java implementation with nested loops Understanding multidimensional arrays is essential for handling complex data structures efficiently in Java. Always learning. Always building. 💻✨ #Java #Programming #DataStructures #LearningJourney #ComputerScience #Coding

Day 42 of #100DaysOfLeetCode 💻✅ Solved #704. Binary Search problem in Java. Approach: • Since the array is already sorted, applied the Binary Search algorithm • Initialized two pointers: left at the start and right at the end of the array • Calculated the middle index using (left + right) / 2 • If the middle element equals the target, returned the index • If the middle element is smaller than the target, moved the left pointer to mid + 1 • If the middle element is greater than the target, moved the right pointer to mid - 1 • Continued until the target was found or the search space became empty Performance: ✓ Runtime: 0 ms (Beats 100% submissions) 🚀 ✓ Memory: 48.32 MB (Beats 68.26% submissions) Key Learning: ✓ Practiced Binary Search with O(log n) time complexity ✓ Learned how pointer adjustments reduce the search space efficiently ✓ Strengthened understanding of searching algorithms in sorted arrays Learning one problem every single day 🚀 #Java #LeetCode #DSA #BinarySearch #ProblemSolving #CodingJourney #100DaysOfCode

💡 Understanding the Diamond Problem in Multiple Inheritance In Object-Oriented Programming, multiple inheritance allows a class to inherit from more than one parent class. But this can introduce a serious problem called the Diamond Problem. Imagine this inheritance structure: Class A / \ Class B Class C \ / Class D Both Class B and Class C inherit from Class A and override the same method show(). Example: class B extends A { void show() { System.out.println("B"); } } class C extends A { void show() { System.out.println("C"); } } Now when Class D inherits from both: D obj = new D(); obj.show(); Which method should run? B.show() C.show() This creates ambiguity because the compiler cannot determine which method implementation to use. To avoid this confusion, Java does NOT support multiple inheritance with classes. Instead, Java allows multiple inheritance through interfaces, where the implementing class explicitly defines the behavior. Understanding these design decisions helps us appreciate why Java prioritizes clarity, simplicity, and maintainability. #Java #ObjectOrientedProgramming #OOP #JavaDeveloper #SoftwareEngineering #ProgrammingConcepts #Coding #ComputerScience #LearnToCode #TechEducation:

Learning 2D Arrays & Jagged Arrays in Java Recently explored the concepts of 2D arrays and jagged arrays in Java and focused on understanding how they actually work in memory. Key takeaways: • Each row is stored separately in memory • Jagged arrays allow different row sizes • Better understanding of references and dynamic allocation Visualizing the internal structure helped me strengthen my logical thinking and clarity in handling multidimensional data. Building strong fundamentals step by step with Harshit T at TAP Academy #Java #DataStructures #Arrays #JaggedArrays #ProgrammingFundamentals #LearningJourney #DeveloperGrowth

Stop choosing between Speed and Portability. 🛑 Most people think a language is either Compiled (like C++) or Interpreted (like Python). Java said: "Why not both?" 🤝 The "Execution Duo" is exactly why Java has stayed relevant for 30 years: The Compiler (javac) is your pre-game coach. It scans everything, catches your syntax errors, and builds the strategy (Bytecode). The Interpreter (JVM) is the star player. It executes line-by-line, allowing your code to run on a toaster or a supercomputer without changing a line. The result? Write once, run anywhere, and optimize performance. Is Java still the king of the backend ? Let’s settle it in the comments. 👇 #Java #SoftwareEngineering #Coding #Programming #Backend #TechTrends #SoftwareDevelopment #JVM #DeveloperLife

👌 🚀 Day 17 / 180 – DSA with Java 🚀 📘 Topic Covered: Arrays & Reversal Algorithm 🧩 Problem Solved: Rotate Array Problem: Rotate an array to the right by k steps, modifying it in-place without using extra space. Approach: Used the reversal algorithm: 1️⃣ Reversed the entire array 2️⃣ Reversed the first k elements 3️⃣ Reversed the remaining elements This efficiently achieved rotation in O(n) time with O(1) extra space. Key Learning: ✔️ Using reversal technique for array manipulation ✔️ Breaking complex operations into smaller steps ✔️ Writing optimized in-place solutions If you’re also preparing for DSA, let’s connect and learn together 🤝 #DSA #Java #180DaysOfCode #LearningInPublic #Arrays #ProblemSolving #Consistency 

🚀 Day 3/30 – Java DSA Challenge 🔎 Problem 22: 118. Pascal's Triangle (LeetCode – Easy) Today’s problem was about pattern logic + mathematical formula building 🔥 🧠 Problem Statement Given an integer numRows, return the first numRows of Pascal’s Triangle. In Pascal’s Triangle: ✔ First and last element of every row is 1 ✔ Every other element is the sum of the two elements directly above it Example (numRows = 5): [1] [1,1] [1,2,1] [1,3,3,1] [1,4,6,4,1] 💡 Approach Used – Binomial Coefficient Logic Instead of calculating each value using previous row storage, I used the mathematical formula: [ C(n, k) = C(n, k-1) * (n-k+1) / k ] ✔ Start each row with 1 ✔ Use formula to calculate next element ✔ Store each row inside List<List<Integer>> This avoids extra computations and keeps logic clean. ⏱ Time Complexity: O(n²) 📦 Space Complexity: O(n²) – Storing triangle 📌 Key Learning Understood combinatorics in coding Learned optimized way to generate Pascal’s Triangle Strengthened nested loop + mathematical logic 22 Problems Completed 🔥 Day 3 building strong fundamentals 💪🚀 #Day3 #30DaysOfCode #Java #DSA #LeetCode #PascalTriangle #ProblemSolving #CodingJourney #Consistency