Mastering Graphs in Java: A Journey of Understanding

🔥 #100DaysOfDSA — Day 29/100 Topic: Binary Search in Java ⚡ 💡 What I Did Today: Today, I implemented one of the most powerful and efficient searching algorithms — Binary Search 🔍 Instead of checking every element one by one like Linear Search, Binary Search smartly divides the array in half each time — reducing the time complexity drastically! 🧠 Logic Used: Works only on sorted arrays ✅ Find the mid index: mid = (start + end) / 2 If key == numbers[mid] → found the element 🎯 If key > numbers[mid] → search in right half Else → search in left half Continue until the element is found or the range is empty 📊 Example: Input → {4, 5, 6, 10, 18, 61, 122} Key → 61 ✅ Output → index for key is: 5 ⚙️ Time Complexity: O(log n) — super fast compared to O(n) of Linear Search 💨 ✨ Takeaway: Binary Search is a fundamental algorithm that teaches the power of divide and conquer. Mastering this concept builds the foundation for more advanced topics like search trees, sorting, and algorithm optimization 🚀 #100DaysOfCode #Day29 #Java #DSA #BinarySearch #ProblemSolving #CodingJourney #LearnInPublic #DeveloperLife #CodeNewbie

🚀 Jump Search Implementation (Data Structures And Algorithms) This Java code demonstrates the jump search algorithm. It works by jumping ahead by a fixed step and then performing a linear search within that block. The jump size is typically the square root of the array size. Jump search is more efficient than linear search but less efficient than binary search. It's particularly useful when accessing elements is expensive (e.g., reading from a disk). #Algorithms #DataStructures #CodingInterview #ProblemSolving #professional #career #development

💻 DSA – Day 13 : Strings & StringBuilder Today I explored Strings in Java, a core concept used in almost every application — from input handling to algorithms, data processing, and problem-solving. Strings look simple, but there's a lot happening under the hood. 🌈 What I learned today 🔹 ❓ What are Strings? A sequence of characters stored as an object in Java. Strings are immutable, which means once created, they cannot be changed. 🔹 ⌨️ Input & Output Took string inputs using Scanner and printed them with basic operations. 🔹 📏 String Length Used .length() to find the number of characters. 🔹 ➕ String Concatenation Joined strings using +, concat(), and StringBuilder. 🔹 🔡 charAt() Method Accessed characters using index values. 🔹 🔄 Check if a String is Palindrome Compared characters from both ends to verify if the string reads the same backwards. 🔹 🧭 Shortest Path Problem Calculated the shortest path (N/E/W/S directions) using coordinate logic. 🔹 ⚖️ String compare() Compared strings lexicographically using .compareTo(). 🔹 ✂️ substring() Function Extracted specific parts of the string. 🔹 🏆 Print Largest String Compared strings alphabetically to find the largest one. 🔹 🔒 Why Strings Are Immutable? Because they are stored in the String Pool and designed for security, caching, and thread-safety. 🧵 StringBuilder – Faster & Mutable 🔹 Unlike Strings, StringBuilder is mutable 🔹 Perfect for modifying strings repeatedly (loops, concatenation, dynamic strings) ✨ Extra Concepts Learned 🔹 🔤 Convert Letters to Uppercase Converted the first letter of each word to uppercase (title case-style logic). 🔹 📦 String Compression Implemented character frequency compression like: aaabbccc → a3b2c3 🚀 Loving the learning curve Strings are everywhere — mastering them builds a strong foundation for upcoming DSA topics. #DSA #Strings #Java #StringBuilder #CodingJourney #100DaysOfCode #LearningInPublic #ProblemSolving #Day13

🔍 Problem Statement: Given an integer array sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. 🧠 Key Idea: Since the array is already sorted, negative numbers can affect the order after squaring. To handle this efficiently, I used the two-pointer approach — one starting from the beginning and one from the end — comparing squares and filling the result array from the back. ⚙️ Time Complexity: O(n) 🗂️ Space Complexity: O(n) 💬 Code (Java): import java.util.Arrays; class Solution { public int[] sortedSquares(int[] nums) { int n = nums.length; int[] res = new int[n]; int left = 0, right = n - 1, index = n - 1; while (left <= right) { int lsq = nums[left] * nums[left]; int rsq = nums[right] * nums[right]; if (lsq > rsq) { res[index--] = lsq; left++; } else { res[index--] = rsq; right--; } } return res; } } ✨ Learning: Improved my understanding of two-pointer technique. Reinforced the importance of optimizing sorting-related problems. #Java #DSA #Coding #ProblemSolving #StriversSheet #LearningEveryday

☕ Day 7 – Java 2025: Smart, Stable, and Still the Future 💡 🔹 Topic: ASCII Value in Java 🧩 What is ASCII Value? ASCII stands for American Standard Code for Information Interchange. It is a numerical representation of characters — where every letter, number, or symbol is assigned a specific numeric value between 0 and 127. For example, 'A' → 65, 'a' → 97, '0' → 48. --- ⚙️ How We Can Use ASCII Values in Java In Java, each character (char) has an internal ASCII code. You can easily get this value by type casting a character to an integer. This helps programmers perform character comparisons, sorting, encryption, and pattern logic. --- 🎯 Purpose of ASCII Values 1️⃣ Character Comparison: To check which character comes first or is greater based on ASCII order. Example: 'A' < 'a' because 65 < 97. 2️⃣ Encoding & Data Transmission: When sending text over systems or networks, ASCII ensures characters are universally understood. 3️⃣ Sorting and Logic Building: Used in string sorting algorithms or validation logic (e.g., checking if a character is uppercase, lowercase, or a number). 4️⃣ Mathematical Operations on Characters: You can perform arithmetic operations like converting uppercase to lowercase using ASCII difference. --- 💻 Simple Example char ch = 'A'; int ascii = (int) ch; // Type casting char to int System.out.println("ASCII value of " + ch + " is: " + ascii); Output: ASCII value of A is: 65 --- 🧠 Extra Insight 'A' to 'Z' → 65 to 90 'a' to 'z' → 97 to 122 '0' to '9' → 48 to 57 ASCII makes Java programs language-neutral and machine-readable for text processing tasks. --- ✨ #Day7OfJava #Java2025 #LearnJava #ASCIICode #JavaBasics #JavaCharacters #JavaForBeginners #CodeWithSneha #ProgrammingConcepts #100DaysOfJava #TechLearning #DeveloperJourney

👉 Why should a Functional Interface contain only one abstract method? 📌 Ex - interface Interf { public void m1(int i) } Interf I = i -> System.out.println(i * i); I.m1(10); I.m2(20); 👉 A functional interface must have exactly one abstract method because a lambda expression is meant to represent a single functionality or behavior. When you write a lambda expression, it needs to map to one specific abstract method in the interface. If the interface had multiple abstract methods, the compiler wouldn’t know which method the lambda is referring to — leading to ambiguity. That’s why a functional interface can have only one abstract method, and it is the only type of interface that can be used with lambda expressions in Java. 👉 Why can’t a Functional Interface have two abstract methods? 📌 Ex - interface Interf { public void m1(int i); public void m2(int i); } Interf I = i -> System.out.println(i * i); 💡Compile Time Error - Interf is not a Functional Interface - Multiple non-overriding abstract method in interface Interf 👉 If an interface contains two abstract methods, a lambda expression won’t know which method to map to, because there are multiple choices. That’s why a Functional Interface must contain exactly one abstract method this ensures that the lambda expression can clearly represent that single method. #OOP #Abstraction #CleanCode #LearningJava #Programming #Developers #String #CodingTips #CoreJava #Learning #JavaDeveloper #CodingPractice #Interface #JavaInterviewPreparation #LearnToCode #JavaInterviewPreparation #JavaFresher #Java #Java8 #FunctionalInterface #LambdaExpressions

🚀 Day 79 of My #100DaysOfCoding Challenge Problem: Find the Duplicate Number 🔹 Platform: LeetCode (#287) 🔹 Difficulty: Medium 🔹 Language: Java 💡 Problem Statement: Given an array of n + 1 integers where each integer is between 1 and n (inclusive), find the single duplicate number. You must solve the problem without modifying the array and using constant extra space. 🧠 Approach: I explored two methods for this problem: 1️⃣ Sorting Approach (Simple but not optimal): Sort the array and check for consecutive duplicate elements. Time complexity: O(n log n) 2️⃣ Floyd’s Cycle Detection Algorithm (Optimal): Think of the array as a linked list where each number points to the next index. The duplicate number causes a cycle. Using slow and fast pointers, we detect the meeting point and then find the cycle’s start — that’s our duplicate! 🧩 Java Code (Optimal Solution): class Solution { public int findDuplicate(int[] nums) { int slow = nums[0]; int fast = nums[0]; // Detect cycle do { slow = nums[slow]; fast = nums[nums[fast]]; } while (slow != fast); // Find entrance to the cycle fast = nums[0]; while (slow != fast) { slow = nums[slow]; fast = nums[fast]; } return slow; } } 🔍 Key Takeaways: Great example of applying cycle detection in array problems. Strengthened understanding of two-pointer techniques. Learned how mathematical logic can make problems space-efficient! #100DaysOfCoding #Day79 #LeetCode #Java #DSA #ProblemSolving #CodingJourney #LearningEveryday #FloydsAlgorithm

🚀 Understanding Immutable vs Mutable Strings — Made Simple! Today, I was revising how Strings actually work in Java — and it hit me how interesting the difference between immutable and mutable strings really is! Here’s what I learned (in simple terms 👇): 🔹 Immutable Strings (String) Once created, they cannot be changed. Any modification (like s = s + "World") actually creates a new String in memory. Example: String s = "Hello"; s = s + " World"; // Creates a new object "Hello World" This is why Strings are safe, thread-friendly, and perfect for constants — but they can be slower if used in loops or heavy text operations. 🔹 Mutable Strings (StringBuilder / StringBuffer) These can be changed directly without creating new objects. Internally, they use a modifiable char array, so operations like append() just update the same memory. StringBuilder sb = new StringBuilder("Hello"); sb.append(" World"); // Changes the same object Great for performance and memory efficiency, especially in loops or dynamic text building. 🧠 Simple way to remember: Immutable = Ice cube 🧊 (can’t reshape it once frozen) Mutable = Water 💧 (you can move and reshape it anytime) Learning how strings are stored and managed internally really helps you write cleaner and faster Java code. Sometimes, understanding the why behind these small things makes a big difference. 🚀 💬 Curious to hear — did you also find this concept confusing when you first learned about it? #Java #Programming #Learning #String #SoftwareDevelopment #Coding #Developers #Tech

LINEAR SEARCH IN JAVA 🌟 1. What is Linear Search? Linear Search (also called Sequential Search) is the simplest searching algorithm. It checks each element one by one until the desired element (called the key or target) is found — or until the list ends. ✅ Key Idea: “Start from the first element and compare each element with the target until you find it.” 2. Example Suppose you have this array: arr = [5, 9, 2, 8, 1, 3] target = 8 Step-by-step search: Step Element Comparison Result 1 5 5 == 8 ? ❌ Continue 2 9 9 == 8 ? ❌ Continue 3 2 2 == 8 ? ❌ Continue 4 8 8 == 8 ? ✅ Found at index 3 👉 Output: Element found at index 3 (0-based indexing).  3. Algorithm (Step-by-Step) Start from index 0. Compare arr[i] with the key. If arr[i] == key, return the index. If not, move to the next element. If the end of the array is reached → element not found. 4. Dry Run (Trace) i arr[i] key arr[i]==key? Action 0 5 8 ❌ Continue 1 9 8 ❌ Continue 2 2 8 ❌ Continue 3 8 8 ✅ Found → Break 4. Characteristics ✅ Simple and easy to implement ✅ Works on unsorted or sorted arrays ❌ Inefficient for large datasets ❌ Slow compared to Binary Search (which works only on sorted arrays) 5.. When to Use Linear Search? Use Linear Search when: The data is small or unsorted. You don’t want to sort before searching. Simplicity is preferred over speed. Avoid it when: The dataset is large (use Binary Search instead).  6.Real-World Example Searching for a specific name in a small contact list on a phone. Finding a book by title in an unsorted bookshelf. Checking a student roll number in a small class record. #Java #JavaFullStack #Programming #LinearSearch #Codegnan Anand Kumar Buddarapu Saketh Kallepu Uppugundla Sairam