How to Find the Rightmost Set Bit in Java

🔁 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 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

Day 6: C#: Continued with unit testing and learned a bit more about coverage evaluation using .Net, I used extension methods few times which a cool feature in C#, advantage it let is you add method to a class without modifying the base implementation and without dealing with inheritance. Java: I will play with stream API more and look at my previous notes to continue refactor. AI: I tried to test few ways of doing prompts, used one shot prompt with copilot which can give better result when using agent mode. I plan to work on one blog article per week to share my learning/ review notes. #100DaysOfCode #CSharp #Java #GenAI #ContinuousLearning

Day 5:- Today, I explored one of the most powerful parts of Java, Looping and Jump Statements! 🔁✨ Here’s what I learned 👇 => Looping Statements 1. for loop :-Best for fixed number of iterations 2. while loop :-Runs until the condition becomes false 3. do-while loop :- Executes at least once before checking the condition => Jump Statements 4. break :-Exits the loop immediately 5. continue :-Skips the current iteration and moves to the next 6. return :-Exits from the current method What I realized: Loops make code efficient by reducing repetition, and jump statements give us control inside loops! Excited to move toward the next Java concepts! #Java #LearningJourney #Programming #day5 #CodeNewbie

🧠 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

I had this post on my wall today and actually, while really basic, this topic is weirdly interesting. The post mentioned that "a+b is promoted to int" which is not exactly what happens. Actually the operants are converted to "int" before the operation is performed. This is actually the same (and in fact specified) for several languages like Java, C#, C, C++ and for multiple reasons - which are partially decisions made around historic constraints. Newer languages like Rust, Go, Zig, Kotlin, ... don't mirror this and keep the type as specified in the parameters. Back to the example: Java (and also C#) won't do the implicit narrowing to "byte" for strictness and safety reasons, thus the compiler will complain. In C or C++ the implicit narrowing cast is actually done, so the first example compiles just fine "uint8_t c = a + b;". But handling this strictly raises a problem for C# and Java with compount operators. Here the parameters still are promoted to "int" but the specification explicitely states that the behaviour is identical to "E1 = (T)((E1) op (E2))", so a cast is performed. Pretty much solely to support compount operators as syntactic sugar. #Java #CSharp #CPlusPlus #Codingtrivia

#Day-69) LeetCode 2536: Increment Submatrices by One using a 2D difference array technique in Java — a powerful approach for handling multiple range updates efficiently. 🔧 Instead of brute-force iteration over each query, I used a prefix sum strategy to apply all updates in constant time per query, followed by a cumulative pass to build the final matrix. 🧠 Highlights: Efficient submatrix updates using difference matrix Prefix sum accumulation for final values Clean, scalable Java implementation 📌 This kind of problem is a great reminder: smart preprocessing beats brute force. Let’s connect if you’ve explored similar matrix tricks or want to brainstorm more Java optimizations! #Java #LeetCode #DSA #MatrixOptimization #CodingInPublic #ProblemSolving #TechJourney #LinkedInTech

🚀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

🚀 Day 137/160 – Maximize Partitions in a String Learned how to split a string into the maximum number of substrings such that no two parts share a common character. ✨ Key Concepts: Greedy Algorithm, Character Tracking, String Partitioning 💻 Language: Java #GeeksforGeeks #DSA #Java #ProblemSolving #CodingChallenge #KeepLearning #160DaysOfDSA

🚀 Day 23 of 100 Days of LeetCode 📘 Problem: Reverse Integer 💻 Language: Java ✅ Status: Accepted (Runtime: 1 ms ⚡ — Beats 81.9%) Today’s challenge focused on reversing digits of an integer while handling overflow cases carefully. It was a great reminder that even simple-looking problems test your precision and edge-case thinking. ✨ Key Takeaways: Integer limits can silently cause overflow errors 🧮 Learned how to handle Integer.MIN_VALUE and MAX_VALUE properly Small logic tweaks can make or break your runtime Every accepted submission adds a new layer of understanding 💪 #Day23 #100DaysOfCode #LeetCode #Java #ProblemSolving #CodingJourney #SoftwareDevelopment #DSA #KeepLearning #CodeEveryday