Kalpit Goyal

Day 3/100 #100DaysOfCode Crushed 3 Sliding Window problems! Used the "At Most K" trick for exact subarray counts—a total game changer. Solved: • Character Replacement • Binary Subarrays With Sum • Count Nice Subarrays Key: Exact(K) = AtMost(K) - AtMost(K-1) #DSA #Coding

Day 2/100 #100DaysOfCode Solved Fruit Into Baskets! 🍎 Used a Sliding Window and Hash Map to find the longest subarray with max 2 distinct integers. Learned and practiced: • Sliding Window logic • Hash Map frequency tracking • $O(N)$ optimization #DSA #Coding #BuildInPublic

Day 1/100 #100DaysOfCode Kicking off with Max Consecutive Ones III! 🚀 Solved using an efficient sliding window to find the longest subarray with at most K zeros. Learned and practiced: • Sliding Window technique • Zero-count tracking • $O(N)$ efficiency #DSA #LeetCode

Day 1/100 #100DaysOfCode Starting my journey to master Data Structures and Algorithms! Committed to consistent learning, problem-solving, and pushing my limits for the next 100 days. Goals: • Master complex structures • Optimize logic • Build a solid foundation #BuildInPublic

Longest Substring Without Repeating Characters 🧠 Nailed the sliding window! Used a hash map to jump the 'left' pointer instantly when a repeat appears. Optimized $O(N)$ efficiency. Sliding Window + Hashing Instant pointer jumps Max length tracking #100DaysOfCode #DSA #Coding

Tackled a constrained XOR problem! Sorted the data to process it "offline"—only inserting into the Trie when values hit the range. ->Sort by limit ->Range-based insertion ->Greedy XOR hunt #100DaysOfCode #DSA #Trie #Coding

Maximum XOR of Two Numbers ✅ Solved using a Bitwise Trie. By storing numbers as binary paths, I can greedily pick the opposite bit at each level to maximize the XOR sum. Insert bits from MSB to LSB Greedy path selection for max XOR #DSA #100DaysOfCode

Bit Manipulation Basics ✅ Brushing up on bitwise fundamentals for advanced Trie applications. XOR: n ^ m for bitwise difference. Check Bit: (b & (1 << (a-1))) to verify if a bit is set. Set Bit: (d | (1 << c)) to turn a specific bit on. #100DaysOfCode #DSA #Coding #BuildInPublic

Distinct Substrings (Trie) ✅ Unique substrings are just prefixes of all possible suffixes. By inserting every suffix into a Trie, each new node represents a unique substring. Count nodes created Total = Count + 1 (empty string) #100DaysOfCode #DSA #Coding #Trie #BuildInPublic

Longest Complete String ✅ Used a Trie to find the longest string where every prefix also exists in the input. Logic: Insert all strings into a Trie. Return the longest (or lexicographically smallest) valid string. #DSA #Coding #Trie #BuildInPublic

Implemented a version that handles word frequencies and deletions. Key logic: countWordsEqualTo: Tracks exact occurrences. countWordsStartingWith: Tracks prefix counts. erase: Decrements counters to "remove" words. More functional for dynamic datasets. #DSA #Coding #X

Trie (Prefix Tree) Implemented a structure for fast string lookups. Used nodes to share common prefixes and a boolean flag to mark word endings. Much more efficient for prefix matching than a standard HashMap. One more down. #DSA #BuildInPublic #Coding