Day 38 of 100DaysOfDSA: Trie Practice and Problem Solving

🚀 Day 32 of #100DaysOfDSA (Java) Today was more about practice and strengthening concepts rather than learning new topics. I attended a live session with my mentor where I: 🔹 Solved multiple Binary Search Tree (BST) problems 🔹 Worked through assignment questions 🔹 Improved my problem-solving approach with guided feedback Key takeaway: Solving problems with guidance helped me understand where I make mistakes and how to think more efficiently. Real learning happens when you struggle, solve, and refine your approach — not just when you learn new concepts. Day 32 ✅ Focused on consistency, practice, and improving problem-solving skills. #DSA #Java #BST #ProblemSolving #100DaysOfCode #DeveloperJourney #LearningInPublic #Consistency

🚀 Day 21 of #128DaysOfCode 🔍 Key Learnings: Efficient searching in O(log n) Using low & high to narrow the range Finding correct position even if target is absent 🧠 Approach: Compare mid with target → move left/right → return index or insert position Consistency is key 🔥 #DSA #Java #CodingJourney #PlacementPreparation

🎉🎉 Day-41 of #60DaysOfDSA 🎉🎉 Problem: Word with Maximum Frequency 👉 Problem Statement: Given a sentence, find the word with the highest frequency. ✔️ If multiple words have same frequency → return the one that appears first 👉 Approach Used (HashMap + Traversal): ✔️ Split string into words ✔️ Store frequency using HashMap ✔️ Find maximum frequency ✔️ Traverse original order → pick first word with max frequency 👉 Time Complexity: O(n) #dsa #java #geekstreak60 #problemsolving

Day 66 — LeetCode Progress (Java) Problem: Find the Difference of Two Arrays Required: Given two integer arrays, return: Elements present in nums1 but not in nums2 Elements present in nums2 but not in nums1 Idea: Use sets to remove duplicates and quickly check membership. Approach: Convert both arrays into sets Iterate over nums1 set: Add elements not present in nums2 set to result1 Iterate over nums2 set: Add elements not present in nums1 set to result2 Return both lists Time Complexity: O(n + m) Space Complexity: O(n + m) #LeetCode #DSA #Java #HashSet #Arrays #ProblemSolving #CodingJourney

Day 42 of consistency 💻🔥 Solved Add Two Numbers using linked lists — a classic problem that really tests understanding of pointers, carry handling, and edge cases. Key takeaways: Handling carry efficiently is crucial Dummy nodes make list problems much cleaner Iterative approach keeps space optimal Not the fastest runtime yet, but improvement is a process — optimizing step by step. Consistency > Perfection. #Day42 #LeetCode #DSA #Java #CodingJourney #ProblemSolving #100DaysOfCode

Day: 95/365 📌 LeetCode POTD: Minimum Distance Between Three Equal Elements II Medium Key takeaways/Learnings from this problem: 1. This one highlights how tracking indices smartly is more important than checking all triplets brute-force. 2. Using previous occurrences helps you narrow down valid triples quickly instead of re-scanning the array. 3. Big takeaway: problems with “equal elements” often reduce to index management + pattern observation. 4. Also a good reminder that optimizing from O(n³) thinking to near O(n) comes down to storing the right info while iterating. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

Day 60 - Remove Duplicates from Sorted List Worked on removing duplicate elements from a sorted linked list. Approach: • Traverse the list once • Compare current node with next node • Skip duplicate nodes by adjusting pointers Time Complexity: O(n) Space Complexity: O(1) #Day60 #LeetCode #Java #LinkedList #CodingPractice #DSA #TechJourney

Most people solve this problem by checking every possible pair. It works… but it doesn’t scale. The key insight is simple: The container is always limited by the shorter line. Once you understand that, you don’t need to check everything. You can eliminate unnecessary pairs and reach an optimal solution in O(n). This is where the Two Pointer approach becomes powerful. Small shift in thinking → big improvement in efficiency. Swipe to see how it works → #DSA #CodingInterview #Java #TwoPointers #ProblemSolving #SoftwareEngineering #LeetCode

Day: 94/365 📌 LeetCode POTD: Minimum Distance Between Three Equal Elements I Easy Key takeaways/Learnings from this problem: 1. This problem is a nice reminder that tracking indices smartly is often more important than the values themselves. 2. Keeping the last few occurrences of each element helps you quickly check valid triplets without brute force. 3. It shows how a simple hashmap or array tracking can turn an O(n³) idea into something efficient. #POTD #365DaysOfCode #DSA #Java #ProblemSolving #LearningInPublic #Consistency 🥷

🎉🎉 Day-42 of #60DaysOfDSA 🎉🎉 Problem: Implement ATOI 👉 Problem Statement: Convert a string into a 32-bit signed integer without using built-in functions. 👉 Rules to Follow: ✔️ Ignore leading whitespaces ✔️ Handle optional '+' or '-' sign ✔️ Read digits until non-digit appears ✔️ Handle overflow properly 👉 Approach Used: ✔️ Skip spaces ✔️ Detect sign ✔️ Convert digit by digit ✔️ Use long to handle overflow check ✔️ Clamp result within integer range 👉 Time Complexity: O(n) #dsa #java #geekstreak60 #problemsolving