DSA Day 5: Binary Search 🔍 ✅ Intuition: The "Dictionary Strategy" ✅ Implementation: O(\log n) efficiency ✅ Variations: First/Last occurrence & Search Insert ✅ Mountain Array: Finding the peak in O(\log n) #100DaysOfCode #Java #DSA #LeetCodeI

Day 67 | DSA Problem: House Robber • Rob houses in a row without robbing adjacent ones • DP: max = max(curr + rob1, rob2) • rob1 → prev prev max, rob2 → prev max • Return max money robbed • Time: O(n), Space: O(1) #Java #Leetcode #DynamicProgramming

Shifting from Sorting to Searching in Java today! After tackling complex O(n log n) sorts, I went back to the absolute basics: Linear Search. The logic is simple: • Start at index 0 • Check every element • O(n) time complexity #DSA #Java #LinearSearch

🚀 Day 54 of DSA – Find the String with LCP 💡 Idea: lcp[i][j] > 0 ⇒ word[i] == word[j] Greedily assign smallest chars Rebuild LCP using DP If mismatch → invalid 🧠 Build + Verify problem ⏱ O(n²) 💾 O(n²) #LeetCode #DSA #Java #Algorithms #DynamicProgramm0YLO

Solved LeetCode 653 – Two Sum IV (BST).Used DFS + HashSet to find if two nodes sum to target.Key Learnings: • Applying Two Sum on trees • DFS traversal • Fast lookup using HashSetTime Complexity: O(N) #LeetCode #Coding #Java #100DaysOfCode #ProblemSolving

Day 8 of DSA 🚀 Find All Duplicates in an Array (LC 442) Used Cyclic Sort pattern💡 Placed elements at correct index, then found mismatches Learned: Index-based patterns = powerful optimization 🔥 Time: O(n), Space: O(1) #DSA #Day8 #Java #LeetCode #CyclicSort #KunalKushwaqoi

Day 43/60 of #geekstreak60! ✅ Cracked the "Chocolates Pickup" HARD problem on @geeksforgeeks Logic: 3D DP (dp[i][j1][j2]) Complexity: O(N . M^2) Pushing through the "Hard" tags to change my life in 2026! 💻�� #Java #DSA #BuildInPublic #Coding #NPCI #Hyderaba@d @NPCI_NPCI

📝 Java 26: HTTP/3, concorrência estruturada e o que muda no JDK O JDK 26 chega com 10 JEPs, suporte nativo a HTTP/3, melhorias de até 15% no G1 GC e APIs de concorrência que preparam o terreno para o Project Valhalla. l.codigosintetico.com.br/a7K9Agu0 #java

Day 66 | DSA • Problem: Climb n stairs (1 or 2 steps) • DP: dp[i] = dp[i-1] + dp[i-2] • Base: dp[0]=1, dp[1]=1 • Count ways to reach top • Time: O(n), Space: O(n) #Java #Leetcode #DynamicProgramming

Day 86✅ DFS (right-first) 💡 First node at each level = answer Time: O(n), Space: O(n) Clean tree traversal problem �� #100DaysOfCode #DSA #JavlY

Solved LeetCode 1123 – LCA of Deepest Leaves.Used DFS to compute depth and find LCA in a single traversal.Key Learnings: • Combining depth + LCA • Recursive optimization • DFS on treesTime Complexity: O(N) #LeetCode #Coding #Java #100DaysOfCode #ProblemSolving

Day 38/60 of #geekstreak60 🚀 Solved Chocolates Pickup 🍫 (Hard) → 3D DP (i, j1, j2) → 9 transitions per step → Space optimized to O(m²) Multi-agent DP is �@� @geeksforgeek@s @NPCI_NPCI #DSA #Java #CodibYx

DSA Day 4:Time Complexity ✅ Asymptotic Notations: •Dropping constants and ignoring lower-order terms.•Complexity Patterns: From Constant O(1) to Logarithmic O(\log n) and Quadratic O(n^2). Insight: A loop that halves or doubles every step is O(\log n).#100DaysOfCode #DSA #Java

Day 85✅ Binary Tree level order traversal queue (BFS) maintain queue of nodes process lvl by lvl loop size = curr lvl count add left + right child store each lvl separately each node visited once Time: O(n), Space: O(n) #Java #100DaysOfCode

Today, I just learned Quick Sort. Moving to a "Divide & Conquer" approach is amazing. Seeing the efficiency jump from O(n²) to O(n log n) is a game-changer. 3 key phases: • Pick a pivot • Partition the array • Recursively sort both sides #DSA #Java #QuickSort

Day 6 of DSA 🚀 Remove Duplicates from Sorted Array (LC 26) Used Two Pointer approach💡 i tracks unique elements, j scans array In-place update without extra space 🔥 Learned: Space optimization + pointer logic Time: O(n), Space: O(1) #DSA #Day6 #Java #LeetCod #KunalKushwaWLt

Day 65 | DSA Problem: Swim in Rising Water Find minimum time to reach bottom-right in a grid with rising water levels. • Binary search on time + DFS to check path. Time: O(N² log N²) | Space: O(N²) #Leetcode #Java #Graphs

#Minecraft #Java #お銀ワールド おはーよ❣️✨️ここからの景色好き(*^ω^*)元廃村アカシア村だったなんて／(^o^)＼信じられる？( *´艸`)ちょっぴり嬉しい(#^.^#)

🚀 Day 10 of DSA Journey ✔️ Time Complexity → O(log n) ✔️ Overflow case handled (mid = low + (high - low)/2) ✔️ Lower Bound & Upper Bound concepts Understanding why Binary Search works > just coding it. #DSA #BinarySearch #Java #LeetCode #CodingJourneye

🚀 Day 53 of DSA Equal Sum Grid Partition I Check if one horizontal/vertical cut gives equal sum. 💡 Total even + prefix sums ⏱ O(m × n) 💾 O(m + n) #LeetCode #DSA #Java #100DaysOfCoPYk