🚀 Day 25/100 — LeetCode Challenge Today's problem: Find Minimum in Rotated Sorted Array 🧠 Concept: Binary Search on Rotated Array 💡 Key Idea: The minimum element represents the pivot point of rotation. By comparing mid with the rightmost element, we can efficiently narrow down the search space. ⚡ Time Complexity: O(log n) 📂 Solutions Repository https://lnkd.in/gkFh2mPZ Continuing to explore how binary search can be adapted for different problem variations. #100DaysOfLeetCode #DSA #LeetCode #CodingChallenge #SoftwareEngineering

Day 30 of #100DaysOfCode 💻 Today’s focus: Permutation Problem Worked on generating all permutations of an array using recursion + backtracking. This problem really tested my understanding of decision trees and tracking visited elements. What stood out today: Every choice creates a new path — and managing those choices efficiently is the key. It’s interesting how a problem that looks simple at first quickly turns into a deep exercise in logic building and control over recursion. Slowly getting more comfortable with backtracking patterns 🚀 #DSA #Backtracking #Recursion #CodingJourney #LeetCode #Consistency #Day30

PROBLEM #18 💥 , a new topic BINARY SEARCH from #leetcode, by using three pointers low, high and mid to shrink the search space. #dsa #leetcode #geeksforgeeks #computerscience #problemsolving #binarysearch

🚀 Day 7 of My LeetCode Journey Today’s problem: Search in Rotated Sorted Array At first glance, it looks like a normal search problem… but the rotation makes it interesting 🤯 💡 Key Insight: Used Binary Search by identifying which half of the array is sorted at each step. This helps decide where to continue the search efficiently. ⚡ Optimized Approach: Check which half is sorted Decide if target lies in that half Narrow down search space ⏱️ Time Complexity: O(log n) ⚡ Performance: 0 ms (Beats 100%) 🧠 What I Learned: Binary Search is all about pattern recognition Even “unsorted-looking” arrays can have structure Thinking logically > brute force #LeetCode #DSA #CodingJourney #BinarySearch #ProblemSolving

🚀 LeetCode 438 — Find All Anagrams in a String | Solved ✅ Solved a Medium-level problem using Sliding Window + Hashing. 🔍 Approach: Maintained a dynamic window and tracked character frequencies to efficiently detect anagrams without re-sorting. ⚡ Complexity: Time: O(n) Space: O(1) (optimized using fixed-size array) 💡 Key Learning: Optimizing from hashmap → array significantly improves performance in character-based problems. Step by step, getting better at pattern recognition 🧠 #LeetCode #DSA #SlidingWindow #CodingJourney #ProblemSolving

Day 70/100 LeetCode Challenge 🚀 Solved Search in Rotated Sorted Array II using modified binary search. 🔍 Key Learnings: Handling duplicates in rotated arrays is tricky When nums[low] == nums[mid] == nums[high], shrink search space Maintain O(log n) average, but worst case O(n) ⚡ Result: Runtime: 0 ms (Beats 100%) All test cases passed ✅ Consistency > Motivation 💯 #Day70 #LeetCode #BinarySearch #DSA #CodingJourney

🚀 Day 30/100 — LeetCode Challenge Today's problem: Median of Two Sorted Arrays 🧠 Concept: Binary Search on Partition 💡 Key Idea: Instead of merging arrays, use binary search to partition them such that the left half contains smaller elements and the right half contains larger elements. ⚡ Time Complexity: O(log(min(m, n))) 📂 Solutions Repository https://lnkd.in/gkFh2mPZ One of the most challenging and insightful problems so far. A great exercise in advanced binary search thinking. #100DaysOfLeetCode #DSA #LeetCode #CodingChallenge #SoftwareEngineering

🚀 Day 24/100 — LeetCode Challenge Today's problem: Search in Rotated Sorted Array 🧠 Concept: Modified Binary Search 💡 Key Idea: Even in a rotated array, at least one half is always sorted. Identify the sorted half and decide the search direction accordingly. ⚡ Time Complexity: O(log n) 📂 Solutions Repository https://lnkd.in/gkFh2mPZ A very common interview problem that tests understanding of binary search beyond sorted arrays. #100DaysOfLeetCode #DSA #LeetCode #CodingChallenge #SoftwareEngineering

🚀 Day 24/100 — LeetCode Challenge Today's problem: Search in Rotated Sorted Array 🧠 Concept: Modified Binary Search 💡 Key Idea: Even in a rotated array, at least one half is always sorted. Identify the sorted half and decide the search direction accordingly. ⚡ Time Complexity: O(log n) 📂 Solutions Repository https://lnkd.in/gkFh2mPZ A very common interview problem that tests understanding of binary search beyond sorted arrays. #100DaysOfLeetCode #DSA #LeetCode #CodingChallenge #SoftwareEngineering

🚀 Day 23/100 — LeetCode Challenge Today's problem: Find Peak Element 🧠 Concept: Binary Search on Unsorted Data 💡 Key Idea: Even without a sorted array, binary search can be applied by analyzing the slope between elements and reducing the search space. ⚡ Time Complexity: O(log n) 📂 Solutions Repository https://lnkd.in/gkFh2mPZ A great example of how binary search is more about reducing the search space than just working on sorted arrays. #100DaysOfLeetCode #DSA #LeetCode #CodingChallenge #SoftwareEngineering