Tamilpriya G’s Post

🚀 Day 4 of My DSA with Java Journey 📘 Problem: Square of a Sorted Array 🧩 Topic: Two Pointers 💻 Language: Java ⚙️ Approach: Two Pointer Technique (O(n)) 🔍 What I Learned: Handling both negative and positive numbers while keeping the array sorted after squaring — optimized using two pointers instead of sorting after squaring. ✨ Key Takeaway: Think in terms of pointers and comparisons, not just brute force — that’s how optimization begins. #Java #DSA #LeetCode #TwoPointers #CodingJourney #100DaysOfCode #PlacementPrep #LearnInPublic #CodingCommunity #JavaDeveloper

🔍 Java Insight of the Day -18: Method Overloading Today I explored Method Overloading, a key concept in Java that enables compile-time polymorphism. It allows multiple methods with the same name but different parameters—making code more readable and flexible. 💡 The Java compiler decides which method to invoke based on: • Method name • Number and type of parameters • Implicit type casting (type promotion) Also discovered that even the main() method can be overloaded—though only the standard signature is executed at runtime. #Java #MethodOverloading #OOP #CompileTimePolymorphism #TechLearning #WomenWhoCode #TapAcademy #100DaysOfCode #JavaDeveloper #CodingJourney #LinkedInLearning

🚀 Java Hack: Jagged Arrays Made Simple! Did you know 2D arrays in Java don’t have to be rectangular? 🤯 Each row can have a different number of elements – that’s called a jagged ✨ Why Jagged Arrays? 1.Flexible row sizes 2.Memory efficient when rows vary 3.Perfect for irregular data structures #Java #CodingTips #Programming #LearnJava #JaggedArray #TechInsightss

Memory Safety: Where Rust Goes Further Rust eliminates entire classes of memory errors — without a Garbage Collector. Some key differences 👇 ❌ Java: NullPointerException is always possible. ✅ Rust: uses Option<T> — absence must be handled explicitly. ❌ Java: needs synchronized to prevent data races. ✅ Rust: the borrow checker forbids conflicting mutable access at compile time. ❌ Java: avoids use-after-free through GC at runtime. ✅ Rust: makes that scenario impossible to compile. ❌ Java: can leak via static caches or circular references. ✅ Rust: leaks only if you explicitly choose to (Box::leak). Rust doesn’t collect garbage —it prevents garbage from existing. 🚀 #RustLang #Java #MemorySafety #Backend #SystemsProgramming #ProgrammingLanguages

*"Happy to share that I’ve learned about *Polymorphism in Java*! 🎉 Polymorphism allows *one interface to be used for multiple forms*, making code flexible and reusable. There are *two types*: 1. *Compile-time Polymorphism (Method Overloading)* – Same method name, different parameters. 2. *Runtime Polymorphism (Method Overriding)* – Subclass provides a specific implementation of a method defined in parent class. Excited to implement these concepts in real Java projects! 💻✨ #Java #OOP #Polymorphism #LearningJourney"*

Day 7 of #50DaysOfCode – Java Today I practiced arrays and conditional statements by writing a program to find the smallest number from five user inputs. 💻 What I did: Took 5 numbers from the user Stored them in an array Used a loop and if condition to find the smallest number 🧠 Concepts learned: Arrays (int[]) Loops (for) Conditional statements (if) Input/output using Scanner Step by step, getting stronger with Java! 💪 #Java #CodingJourney #LearnInPublic #Programming #50DaysOfCode

Day(15/30) Today I practiced a simple yet logical Java problem: Find the largest word in a sentence. Here’s the logic in simple steps 1 Split the sentence into words using split(" ") 2 Loop through each word using index-based for loop 3 Compare each word’s length 4 Keep updating the longest word String sentence = "Java is a powerful programming language"; String[] words = sentence.split(" "); String largestWord = ""; int maxLength = 0; for (int i = 0; i < words.length; i++) { String word = words[i]; if (word.length() > maxLength) { maxLength = word.length(); largestWord = word; } } System.out.println("Largest Word: " + largestWord); This small exercise helped me understand string traversal and comparison in Java better. Sometimes, even simple problems teach powerful concepts like loops, arrays, and string handling. #Java #Programming #BCA #LearningInPublic #90DaysOfCode #CodingJourney

🚀 Exploring Jagged Arrays in Java! In Java, arrays don’t always have to be perfectly rectangular — they can have different lengths for each row. That’s what we call a Jagged Array! 🧩 Here’s a simple example where each row of the array has a different size. Using nested loops and user input, we can dynamically store and display values in this structure. This concept is super useful when working with data that’s irregular in shape — like seating charts, triangle matrices, or multi-level data sets. 💡 Key Takeaway: Jagged arrays give flexibility to your program by saving memory and adapting to real-world uneven data. #Java #Programming #Learning #Coding #Developers #OOP #JavaBasics #ProblemSolving

🚀 Day 68 – Java Collections Deep Dive (ArrayList with Custom Objects) Today, I worked on an interesting concept in Java: Using ArrayList to store and filter custom objects (Student class). Here’s what I implemented: 🔵 Created a Student class with fields → ID, Name, Age, Marks 🔵 Stored multiple Student objects inside an ArrayList 🔵 Printed all records using an enhanced for-each loop 🔵 Used removeIf() with Lambda Expressions to filter data based on dynamic conditions     • 🔵 Remove students with marks < 85     • 🔵 Remove students with age < 25     • 🔵 Remove students with name length < 3 ✨ Key Takeaway: Modern Java features like Lambdas + Collection API make filtering and processing object lists extremely clean, readable, and powerful. Feeling great progressing one step at a time! More concepts loading… 🔥 10000 Coders Gurugubelli Vijaya Kumar #Day68 #Java #Collections #ArrayList #LambdaExpressions #CodingJourney #LearningInPublic #JavaDeveloper

💻 Java Practice Update I wrote a program to check if brackets in a string are balanced using the Stack data structure in Java. It ensures that every opening bracket (, {, [ has a proper closing pair ), }, ] in the correct order. 🔍 Methods Used: push() → Adds an element (opening bracket) to the stack. pop() → Removes the top element when a matching closing bracket is found. peek() → Checks the top element without removing it, to verify if it matches the closing bracket. isEmpty() → Ensures that all brackets are properly closed by the end of the string. 🧩 Example: Input → {()} Output → true ✅ This exercise helped me understand how stack operations work behind the scenes and how useful they are in solving real-world problems like expression validation and syntax checking. #Java #CodingPractice #Stack #ProblemSolving #Programming #LearningEveryday #DataStructures 10000 Coders karunakar pusuluri Usha Sri