Day 6: C# testing, Java refactoring, AI prompts, and a blog article

Java Bit Manipulation Practice – Finding the Rightmost Set Bit Today, I wrote a simple Java program to find the position of the rightmost set bit in a number’s binary representation. 🔹 First, the number is converted into binary using a while loop. 🔹 Then, I scan the binary string from right to left to locate the first '1'. 🔹 Finally, the program prints its position (counting starts from 1). Input: 21 Binary: 10101 Output: 1 (rightmost set bit position) It’s a great exercise for understanding bitwise logic and binary representation in Java! 💻🔥 #Java #Coding #BitManipulation #DSA #LearningJourney

🚀Day 99/100 #100DaysOfLeetCode 🔍Problem: Sum of Two Integers✅ 💻Language: Java 💡Approach: Instead of using the ‘+’ or ‘–’ operators, this problem leverages bit manipulation to perform addition. 🔸Use XOR (^) to calculate the sum without carry. 🔸Use AND (&) followed by a left shift (<< 1) to calculate the carry. 🔸Repeat until no carry remains. 📚Key Takeaways: 🔹Reinforced understanding of bitwise operations. 🔹Learned how addition can be simulated using logical operations. 🔹Improved understanding of low-level arithmetic computation. ⚡Performance: ⏱️Runtime: 0 ms (Beats 100.00%) 💾Memory: 40.88 MB (Beats 10.05%) #100DaysOfLeetCode #Java #BitManipulation #CodingChallenge #ProblemSolving #DSA #LeetCode #CodingJourney

🔁 Java DSA Project: Reverse a Linked List#Day5 Built a Java program to demonstrate how to reverse a singly linked list using an iterative approach. This project strengthens understanding of pointers, data structures, and linked list manipulation in Java. ✨ Key Highlights: Custom ListNode class implementation Iterative reversal using prev, curr, and next pointers Simple print function to visualize before & after reversal #Java #DSA #LinkedList #Coding #Algorithms #DataStructures #LearningByCoding

📌 Day 20/100 – Add Binary (LeetCode 67) Today’s challenge was about adding two binary strings and returning the result in binary format — just like simulating manual binary addition with carry logic. 🔹 Problem: Given two binary strings a and b, return their sum as a binary string without converting them into decimal. 🔹 Approach: Start from the end of both strings (like column-wise addition). Use a carry variable to handle overflow (0 or 1). Keep appending the result (sum % 2) to a StringBuilder. Reverse the string at the end since we append from LSB to MSB. 🔹 Key Learnings: StringBuilder is more efficient than string concatenation in Java. Handling indices carefully avoids edge-case bugs. Binary addition logic is similar to decimal addition — just base changes, logic stays. #100DaysOfCode #Day20 #LeetCode #Java #BinaryMath #DSA #ProblemSolving #CodingJourney #KeepLearning

🚀 𝗦𝘁𝗼𝗽 𝗝𝘂𝗴𝗴𝗹𝗶𝗻𝗴 𝗜𝗻𝗱𝗲𝘅𝗲𝘀 — 𝗚𝗶𝘃𝗲 𝗠𝗲𝗮𝗻𝗶𝗻𝗴 𝘁𝗼 𝗬𝗼𝘂𝗿 𝗗𝗮𝘁𝗮 𝘄𝗶𝘁𝗵 𝗝𝗮𝘃𝗮 𝗠𝗮𝗽! Ever wished you could replace confusing index numbers with real names? That’s exactly what 𝗠𝗮𝗽 does in Java! 🔑 After working with 𝗟𝗶𝘀𝘁 and 𝗦𝗲𝘁, it’s time to explore something even more powerful — Map, the collection that connects your data like a phonebook. Instead of numeric indexes, it uses key-value pairs — so every key has a purpose, and every value has context. In my latest YouTube video, I’ve broken down 👇 ✅ What is a Map in Java and why it’s not part of the Collection interface ✅ Difference between List, Set, and Map ✅ How HashMap and Hashtable work internally ✅ Why keys are unique and how to iterate using keySet() ✅ When to use HashMap vs Hashtable (and what “synchronized” actually means) 💡 𝗜𝗳 𝗟𝗶𝘀𝘁 𝗶𝘀 𝗮𝗯𝗼𝘂𝘁 𝗼𝗿𝗱𝗲𝗿, 𝗮𝗻𝗱 𝗦𝗲𝘁 𝗶𝘀 𝗮𝗯𝗼𝘂𝘁 𝘂𝗻𝗶𝗾𝘂𝗲𝗻𝗲𝘀𝘀 — 𝗠𝗮𝗽 𝗶𝘀 𝗮𝗯𝗼𝘂𝘁 𝗿𝗲𝗹𝗮𝘁𝗶𝗼𝗻𝘀𝗵𝗶𝗽𝘀. And once you understand that, working with Java data structures becomes a lot more intuitive. 🎥 Watch the full video here 👉 https://lnkd.in/gPnvzg6B

//Unlearn & Relearn “Can _ and $ be used as variable names?” 🔹 _ cannot be used as an identifier in Java 8 and above. It became a reserved keyword to avoid confusion and to support future language features. ex: int _ = 10; // Not allowed in modern Java 🔹 $ can still be used as an identifier, but it’s strongly discouraged: int $ = 100; // Valid but not recommended The $ symbol is commonly used by the compiler for things like inner classes and generated code, so using it in real projects reduces clarity. Remember: $ → Allowed, but avoid using it _ → Not allowed as a standalone identifier (Java 8+)

💥 “𝘛𝘩𝘪𝘯𝘬 𝘊𝘰𝘭𝘭𝘦𝘤𝘵𝘪𝘰𝘯𝘴.𝘴𝘰𝘳𝘵() 𝘪𝘴 𝘢𝘭𝘭 𝘺𝘰𝘶 𝘯𝘦𝘦𝘥? 𝘞𝘢𝘪𝘵 𝘵𝘪𝘭𝘭 𝘺𝘰𝘶 𝘮𝘦𝘦𝘵 𝘊𝘰𝘮𝘱𝘢𝘳𝘢𝘵𝘰𝘳 𝘢𝘯𝘥 𝘊𝘰𝘮𝘱𝘢𝘳𝘢𝘣𝘭𝘦!” Sorting in Java gets really fun when you start adding your own logic. In my latest video, I’ve explained how to sort not just integers — but your custom objects (like students, names, anything!) — using Comparator, Comparable, and Lambda expressions. 📺 Watch the full breakdown here: https://lnkd.in/gkvb2VxY #Java #Programming #Coding #Comparator #Comparable #LearnJava #SoftwareDevelopment

🚀Day 96/100 #100DaysOfLeetCode 🧩Problem: Reverse Linked List II✅ 💻Language: Java 💡 Approach: 1️⃣ First, use a dummy node to handle edge cases where reversal starts at the head. 2️⃣ Traverse to the node just before the left position — call it prev. 3️⃣ Reverse the sublist between left and right using standard pointer manipulation. 4️⃣ Reconnect the reversed portion back into the original list. 🔑Key Takeaways: 🔹Dummy nodes simplify linked list edge cases. 🔹In-place reversal reduces memory overhead. 🔹Careful pointer tracking ensures list integrity. ⚙️Performance: ⏱️Runtime: 0 ms(beats 100.00%) 💾Memory: 41.29 MB(beats 70.37%) #100DaysOfLeetCode #Java #LinkedList #CodingJourney #ProblemSolving #DSA #LeetCode #CodingChallenge

🧠 Daily LeetCode Grind — Java Edition Today’s challenge: ✅ Palindrome Number (#9 - Easy) 📌 Goal: Check whether an integer reads the same backward as forward without converting it to a string. 📌 Approach: 🔹 Handle negatives and numbers ending in 0 (except 0 itself). 🔹 Reverse only half of the digits using modulo and division. 🔹 Compare the original and reversed halves for equality. 🧩 Test Cases: Input: 121 → Output: true Input: -121 → Output: false Input: 10 → Output: false 💡 Key Takeaways: 🔹 Strengthened arithmetic-based problem-solving (no string ops). 🔹 Learned efficient O(1) space reversal logic. 🔹 Improved understanding of numeric pattern recognition. 💻 Language: Java 🧠 Complexity: O(log₁₀ n) — reverse digits only once. #LeetCode #Java #CodingPractice #ProblemSolving #DSA #PalindromeNumber #DeveloperLife #AcceptedSolution #CybernautEdTech

Week 8 || Day 2💡 Reversing words in Java — step by step! Today I practiced reversing each word in a sentence using two different approaches: 🔹 Approach 1 — With .reverse() method: Split the sentence using split(" ") to separate words. Used StringBuffer for each word and applied .reverse() directly. Joined the reversed words back with spaces. 🔹 Approach 2 — Without using .reverse(): Again split the string into words. For each word, used a for loop running from the last character to the first. Appended each character manually into a new StringBuffer. Combined the reversed words carefully, avoiding extra spaces.⚡ #Java #StringBuffer #ProgrammingLogic #JavaFullStack