Mastering Java Strings for Efficient Code

🚀 Day 39/100 Today’s problem: Reverse String II 🔹 Worked on reversing characters in a string based on a given value k🔹 Used char[] and two-pointer approach for efficient swapping 💡 What I Learned:✔ How to handle string manipulation using arrays in Java✔ Importance of index control while working with loops✔ How to solve problems step-by-step instead of reversing the whole string directly✔ Improved logic building for partial reversal problems 💡 Key Insight:Instead of reversing the entire string, we reverse only specific parts (every 2k characters), which requires careful indexing. Consistency is slowly turning into confidence 💪 #Day39 #Java #DSA #CodingJourney #LeetCode #ProblemSolving #100DaysOfCode

✨ Day 16 of 90 – Pattern Mastery Journey 🧠 Pattern: Number Triangle Pattern 💡 Approach: ✔ Used nested loops ✔ Outer loop controls the number of rows ✔ Inner loop prints numbers from 1 to current row number ✔ Each row increases the sequence of numbers 🚀 This pattern helped me better understand loop control and how patterns grow step-by-step using nested loops in Java. #PatternMasteryJourney #Java #CodingJourney #ProblemSolving

Day 46 - String Compression Used a two pointer approach to group consecutive characters and write compressed results directly into the input array. If a character repeats, its count is converted to digits and appended sequentially. Time Complexity: O(n) #Day46 #LeetCode #Java #Algorithms #TwoPointers #DSA

🚀 Day 41/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 3427. Sum of Variable Length Subarrays Used a nested loop approach to calculate subarray sums for each index by dynamically determining the starting point using max(0, i - nums[i]). ⏱️ Time Complexity: O(n²) 📦 Space Complexity: O(1) Strengthening understanding of subarray problems and index-based range calculations. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Day 56 – Valid Anagram Worked on a problem to determine whether two strings are anagrams by comparing their character frequencies. Key Learnings: Improved time complexity to O(n)O(n)O(n) by avoiding sorting Strengthened understanding of character-based problem solving #DSA #Java #Strings #HashMap #Arrays #ProblemSolving #CodingPractice

🚀 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

#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

🚀 Day 48/100:-Odd String Difference Not every problem is about writing code — some are about seeing patterns clearly. 🧠 Today, I worked on the "Odd String Difference" problem using Java. 🔍 Instead of comparing strings directly, I learned to: • Convert each string into a difference array • Identify patterns between characters • Detect the one string that breaks the pattern 💡 Key takeaway: Breaking a problem into smaller transformations makes complex logic much easier to handle. ⚡ Result: Efficient solution with strong runtime and memory performance ✅ Step by step, improving not just coding — but the way I think. #Day48 #100DaysOfCode #DSA #Java #ProblemSolving #LeetCode #Consistency #LearningInPublic

Just published a clean and efficient walkthrough of LeetCode 169 – Majority Element using the Boyer–Moore Voting Algorithm in Java. In this breakdown, I explain: 🔹 Why the algorithm works in O(n) time & O(1) space 🔹 How to identify the majority element intuitively 🔹 A clear Java implementation with step‑by‑step reasoning If you're preparing for coding interviews or sharpening your DSA fundamentals, this one’s a must-watch! Watch here: https://lnkd.in/gyB-6DAx Let’s grow together — one problem at a time. 💙💻 #LeetCode #Java #DSA #CodingInterview #ProblemSolving #TechCareer #Algorithms #LearningEveryday

🚀 Day 54/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 1656. Design an Ordered Stream Used an array + pointer approach to store values by index and return consecutive chunks by moving a pointer forward whenever elements are available. ⏱️ Time Complexity: O(n) (amortized across all insert calls) 📦 Space Complexity: O(n) Strengthening understanding of design problems and pointer-based simulation techniques. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency