Day 32 of 100DaysOfDSA: Practicing BST and Problem Solving

🚀 Day 38 of #100DaysOfDSA (Java) Today was focused on practice and strengthening Trie concepts. I attended a live session with my mentor where I: 🔹 Solved assignment questions on Tries 🔹 Practiced insert, search, and prefix-based problems 🔹 Improved my approach to string-based problem solving Key takeaway: Working through problems with guidance helped me understand how to apply Tries effectively, especially in prefix and dictionary-related problems. Consistent practice is helping me move from understanding concepts to actually solving problems confidently. Day 38 ✅ Focused on practice, consistency, and improving problem-solving skills. #DSA #Java #Trie #DataStructures #ProblemSolving #100DaysOfCode #DeveloperJourney #LearningInPublic #Consistency

🚀 Day 28/100 – #100DaysOfCode Today’s problem: Reverse Linked List (LeetCode 206) 💡 What I learned: How to reverse a singly linked list using an iterative approach Managing pointers efficiently (prev, curr, next) Understanding how links change direction step by step 🧠 Key Idea: Instead of creating a new list, we reverse the links in-place: Store next node Reverse current pointer Move forward 📊 Complexity: Time: O(n) Space: O(1) Staying consistent, one problem at a time... #Day28 #100DaysOfCode #LeetCode #DSA #LinkedList #Java #CodingJourney #ProblemSolving #TechSkills

🚀 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 2 of #LeetCodeDailyChallenge Showing up again — because consistency builds confidence. Today’s problem: Add Two Numbers 📌 Topic: Linked List ⚡ Difficulty: Medium What I focused on today: Traversing two linked lists together step-by-step Managing carry without breaking the flow Creating a result list dynamically while iterating Handling tricky edge cases (unequal lengths & leftover carry) This problem really helped me understand how small details (like carry) can impact the overall logic. Every day isn’t about solving something big — sometimes it's about understanding something better than yesterday. #DSA #LeetCode #Java #LinkedList #ProblemSolving #Consistency #LearningInPublic

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

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: 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 🥷

Best Time to Buy & Sell Stock — classic problem. Key idea is to track the minimum price so far and calculate profit dynamically. Interesting how a simple approach leads to an optimal solution without extra space. Time Complexity: O(n) Continuing to strengthen problem-solving fundamentals 🚀 #Java #DSA #ProblemSolving #BackendDeveloper #Learning

Day 33 of my #50DaysOfDSA Today’s problem was Palindrome Linked List on LeetCode. At first, it feels like a simple check, is the list the same forward and backward? But the constraint makes it interesting: do it efficiently, without extra space. The approach that clicked for me: • Find the middle using slow and fast pointers • Reverse the second half of the list • Compare both halves node by node What I liked about this problem is how it combines multiple small ideas into one clean solution. Nothing too complex individually, but together they form something elegant. #50DaysOfDSA #LeetCode #DSA #LinkedList #Java #WomenInTech #SoftwareDevelopment

🚀 Day 34 of #100DaysOfDSA (Java) Today was focused on practice and strengthening Heap concepts. I attended a live session with my mentor where I: 🔹 Solved assignment questions based on Heap 🔹 Practiced problems like priority-based selection 🔹 Improved understanding of when to use Heap in real scenarios Key takeaway: Learning a concept is just the first step — real improvement comes from solving problems and refining your approach with feedback. Today helped me gain more confidence in applying Heap to different problem types. Day 34 ✅ Consistency and practice over everything. #DSA #Java #Heap #PriorityQueue #ProblemSolving #100DaysOfCode #DeveloperJourney #LearningInPublic #Consistency