Java Sliding Window for Longest Substring Without Repeating Characters

Day 85 of #100DaysOfLeetCode 💻✅ Solved #76. Minimum Window Substring problem in Java. Approach: * Used Sliding Window with character frequency array * Tracked required characters to match target string * Expanded window and reduced requirement count * Shrunk window to find minimum valid substring Performance: ✓ Runtime: 2 ms (Beats 99.94% submissions) 🚀 ✓ Memory: 45.51 MB (Beats 80.16% submissions) Key Learning: ✓ Mastered advanced Sliding Window technique ✓ Learned optimal substring minimization strategy ✓ Improved handling of variable window constraints Learning one problem every single day 🚀 #Java #LeetCode #DSA #SlidingWindow #Strings #HashMap #ProblemSolving #CodingJourney #100DaysOfCode

Day 84 of #100DaysOfLeetCode 💻✅ Solved #567. Permutation in String problem in Java. Approach: * Used Sliding Window with frequency array * Decreased count for incoming characters * Adjusted window when count became invalid * Checked window size equal to s1 length Performance: ✓ Runtime: 6 ms (Beats 87.55% submissions) 🚀 ✓ Memory: 43.26 MB (Beats 99.80% submissions) Key Learning: ✓ Strengthened Sliding Window with frequency tracking ✓ Learned efficient permutation checking ✓ Improved handling of dynamic window adjustment Learning one problem every single day 🚀 #Java #LeetCode #DSA #SlidingWindow #Strings #Arrays #ProblemSolving #CodingJourney #100DaysOfCode

🚀 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 

📅 Day 11 – Strings in Java 📚 Topic: String Manipulation (Hashing) Today I worked on finding the first unique character in a string using a frequency-based approach. This problem reinforced how hashing can help efficiently track and analyze character occurrences. ✔ Key Learnings: • Used frequency array for character counting • Applied two-pass traversal for efficient solution • Improved understanding of hashing in strings Consistently improving problem-solving skills with optimized approaches 🚀 #DSA #Strings #Java #ProblemSolving #LearningJourney

🚀 Day 69/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 2103. Rings and Rods Used a 2D boolean array to track presence of colors (R, G, B) on each rod and counted rods containing all three. ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) Strengthening understanding of mapping, indexing, and state tracking techniques. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency

Learn the arithmetic operators in Java and how to use them in real code. In this video, we’ll break down + (addition), - (subtraction), * (multiplication), / (division), and % (modulus) with clear examples, so you can confidently do math in your Java programs. https://lnkd.in/eq-6UkTC

#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 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 47/180 | #180DaysOfCode 📍 LeetCode | 💻 Java Solved: 448. Find All Numbers Disappeared in an Array Used an in-place marking technique by treating indices as a hash map and marking visited numbers as negative to identify missing elements. ⏱️ Time Complexity: O(n) 📦 Space Complexity: O(1) (excluding output list) Strengthening understanding of array manipulation and in-place hashing tricks. 💪 Consistency continues 🚀 #DSA #LeetCode #Java #CodingJourney #Consistency