Java String Coding Challenges

#Day88 of #100DaysOfCode Continued working on string manipulation in Java with a focus on problem-solving. Practiced: - Checking anagrams - Finding first non-repeating character - Implementing toggle case logic Focused on improving string handling and writing efficient solutions using loops and conditions. #Java #Strings #100DaysOfCode

->A simple Java concept that’s easy to overlook 👇 Immutable Strings 🔒 String str = "hello"; str.concat(" world"); System.out.println(str); // still "hello" Strings don’t change after creation. Operations like concat() create a new object instead ♻️ str=str.concat(" world"); System.out.println(str); // "hello world" Small detail ⚡ But important while writing logic 🧠 #Java #BackendDevelopment #Programming

Day :02 #Java #Coding #Anagram #Strings 👉 Question: Write a program to check whether two given strings are anagrams of each other. ✅ Example 1: Input: s1 = "RACE", s2 = "CARE" Output: This Is Anagram ❌ Example 2: Input: s1 = "hello", s2 = "world" Output: This Is Not Anagram ✅ Example 3: Input: s1 = "listen", s2 = "silent" Output: This Is Anagram

Day 64 - Intersection of Two Linked Lists Solved by using a two-pointer technique to find the intersection node of two linked lists. Instead of calculating lengths, both pointers traverse both lists to align automatically. Time Complexity: O(n + m) Space Complexity: O(1) #Day64 #LeetCode #Java #LinkedList #DSA #ProblemSolving #CodingJourney

🚀 Day 57/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 242. Valid Anagram Used a HashMap frequency counting approach (Unicode-safe using code points) to compare character frequencies of both strings. ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(n) Strengthening understanding of string frequency analysis and Unicode handling. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency 

Dependency Injection is not just one thing. It usually shows up in a few common forms: constructor injection, setter injection, and field injection. Each one works a little differently, but the idea behind all of them is the same: write code that is cleaner, easier to manage, and simpler to test. The more you understand these types, the easier it becomes to build applications that are flexible and easier to maintain. #SoftwareEngineering #Java #SpringBoot #DependencyInjection #CleanCode

🚀 Day 52/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 3174. Clear Digits Used a stack-like approach with StringBuilder to remove the closest non-digit character whenever a digit is encountered. ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(n) Strengthening understanding of string processing and stack-based logic simulation. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Checked vs Unchecked Exceptions - Know the Difference ⚠️ 🔹 Checked Exceptions ▸ Checked at compile time ▸ Must be handled (try-catch or throws) ▸ Not handled → code won’t compile ▸ Examples: IOException, SQLException, FileNotFoundException 🔹 Unchecked Exceptions ▸ Occur at runtime ▸ No need to handle (but recommended) ▸ Extend RuntimeException ▸ Examples: NullPointerException, ArrayIndexOutOfBoundsException 💡 Simple Way to Remember → Checked = Compiler forces handling → Unchecked = Runtime errors 🚀 Best Practice ▸ Use Checked → for recoverable scenarios (e.g., file not found → retry) ▸ Use Unchecked → for programming bugs (e.g., null → fix the code) #Java #SpringBoot #ExceptionHandling #JavaDeveloper #BackendDeveloper

🚀 𝐃𝐚𝐲 94/100  ✅ 𝐏𝐫𝐨𝐛𝐥𝐞𝐦: 𝐑𝐞𝐩𝐞𝐚𝐭𝐞𝐝 𝐒𝐮𝐛𝐬𝐭𝐫𝐢𝐧𝐠 𝐏𝐚𝐭𝐭𝐞𝐫𝐧 Today’s problem was about checking whether a string can be formed by repeating one of its substrings multiple times. 💡 𝐊𝐞𝐲 𝐋𝐞𝐚𝐫𝐧𝐢𝐧𝐠𝐬: Try all possible substring lengths up to n/2 Only consider lengths that divide the string completely Build and compare repeated string with original Time Complexity: O(n²) in worst case  𝐀𝐩𝐩𝐫𝐨𝐚𝐜𝐡: Iterate over possible substring sizes If length divides string → repeat substring Compare with original string If match found → return true #Day94 #100DaysOfCode #LeetCode #Java #DSA #CodingJourney #ProblemSolving