Deepantika Jain

Sometimes the best progress comes from strengthening what you've already learned.

#Day41 of my #100DaysOfDSA No new problems today—just a thorough revision of Binary Search patterns, approaches, and edge cases. #DSA #Java #100DaysOfCode #WomenInTech #LearnInPublic #BuildInPublic #BinarySearch

@iamcurious_13 @X Sure!

@DeepantikaJ @X Let's connect

Hey @X I started posting here about a month ago and have been enjoying the journey. Looking to connect with like-minded people passionate about DSA, software development, AI, and learning in public. Let's learn, build, and grow together! #LearnInPublic #BuildInPublic

It's fascinating how small, simple solutions come together to solve much bigger problems. #BuildInPublic #BinarySearch #LeetCode #GeeksforGeeks

#Day40 of my #100DaysOfDSA Wrapped up Binary Search on 2D Arrays today. • LC #1901 – Find a Peak Element II • O(N log M) | O(1) • GFG – Median in a Row-wise Sorted Matrix • O(log(max−min) × N × log M) | O(1) #DSA #Java #100DaysOfCode #WomenInTech #LearnInPublic

Today's takeaway: similar-looking matrix problems can require completely different approaches depending on the matrix properties.

#Day39 of my #100DaysOfDSA Continued Binary Search on 2D Arrays. - Search a 2D Matrix • O(log(N×M)) | O(1) - Search a 2D Matrix II • O(N+M) | O(1) #DSA #Java #LeetCode #100DaysOfCode

Used Lower Bound on each row to efficiently count 1s and find the required row. Nice to see older concepts being reused in new patterns.

#Day38 of my #100DaysOfDSA Revised previous Binary Search concepts and started Binary Search on 2D Arrays. •Row with Max 1s in a Row-wise Sorted Matrix - O(N log M) | O(1) #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

It was satisfying to see the same idea solve both the median and the k-th element problems.

#Day37 of my #100DaysOfDSA Solved: 1. LC #4 – Median of Two Sorted Arrays • O(log(min(N,M))) | O(1) 2. K-th Element of Two Sorted Arrays • O(log(min(N,M))) | O(1) The partition (cut) intuition finally clicked today. #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

Learned a new Binary Search pattern: **max(min)** vs **min(max)**.Surprisingly, even though the last three problems had nearly identical approaches, understanding *why* they worked was the real learning.

#Day36 of my #100DaysOfDSA Solved: - Aggressive Cows — O(N log M), O(1) - LC #410 Split Array Largest Sum — O(N log S), O(1) - Painter's Partition — O(N log S), O(1) - Allocate Minimum Pages — O(N log S), O(1) #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

Surprisingly, the optimal Binary Search approach is now clicking faster than brute force as these patterns become more familiar.

#Day35 of my #100DaysOfDSA Solved: - LC #1011 – Capacity to Ship Packages Within D Days • O(N log M) | O(1) - LC #1539 – Kth Missing Positive Number • O(log N) | O(1) #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

Continued practicing Binary Search on Answers by searching the answer space and validating each candidate with a feasibility check.

#Day34 of my #100DaysOfDSA Solved: • LC #1283 — Find the Smallest Divisor Given a Threshold • LC #1482 — Minimum Number of Days to Make m Bouquets #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

Also solved the Nth Root of a Number problem and got more comfortable with searching on the answer space.

#Day34 of my #100DaysOfDSA Started Binary Search on Answers today. • Square Root of a Number • LC #875 Koko Eating Bananas — O(n log M) #DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic