Deepantika Jain

Deepantika Jain | Aspiring Software Engineer | DSA | Sharing my learning journey and projects

[Deepantika Jain @DeepantikaJ]

Looking forward to connecting with developers, students, tech enthusiasts, and builders who are learning in public.

If you share content about coding, tech, AI, data, or your own journey, let's connect and grow together 🤝
#LearnInPublic #BuildInPublic #WomenInTech

[Deepantika Jain @DeepantikaJ]

Nice to see how Search Insert Position is basically a direct application of Lower Bound.

[Deepantika Jain @DeepantikaJ]

#Day26 of my #100DaysOfDSA

Solved GFG Lower Bound, GFG Upper Bound, and LC #35 (Search Insert Position).

🔹 Lower Bound → O(log n)
🔹 Upper Bound → O(log n)
🔹 Search Insert Position → O(log n)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

Today's takeaway: Even calculating "mid" has an important overflow edge case.

[Deepantika Jain @DeepantikaJ]

#Day25 of my #100DaysOfDSA

Quickly revised arrays and started Binary Search with LC #704.

🔹 Iterative Binary Search → O(log n)
🔹 Recursive Binary Search → O(log n)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

#Day24 of my #100DaysOfDSA 🚀

Solved LC #152 (Maximum Product Subarray).

🔹 Brute: Check all subarrays → O(n²) 🔹 Optimal: Track max & min products → O(n)

Negative numbers made this problem much trickier than it first looked.

#DSA #Java #100DaysOfCode #LearnInPublic

[Deepantika Jain @DeepantikaJ]

#Day23 of my #100DaysOfDSA

Solved LC hard #493 (Reverse Pairs)

🔹 Brute: Check every pair → O(n²)
🔹 Optimal: Modified Merge Sort → O(n log n)

Interesting to see Merge Sort being used for much more than just sorting.

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

#Day22 of my #100DaysOfDSA

Solved GFG's Count Inversions.

🔹 Brute: Check every pair → O(n²)
🔹 Optimal: Modified Merge Sort → O(n log n)

Interesting to see how Merge Sort can be used for much more than just sorting.

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

One of the most interesting problems I've solved so far. Amazing how simple math can replace extra data structures entirely.

[Deepantika Jain @DeepantikaJ]

#Day21 of my #100DaysOfDSA 🚀

Solved LC #645 (Set Mismatch).

🔹 Brute: Frequency count → O(n²)
🔹 Better: Hashing → O(n)
🔹 Optimal: Mathematical equations → O(n), O(1)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

Big takeaway: Sometimes the best solution comes from traversing in the opposite direction.

[Deepantika Jain @DeepantikaJ]

#Day20 of my #100DaysOfDSA

Solved LC #88 (Merge Sorted Array).

🔹 Brute: Extra array + sort → O((m+n)log(m+n))
🔹 Better: Merge using extra array → O(m+n)
🔹 Optimal: Traverse from the end → O(m+n), O(1)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

Today's takeaway: Sometimes sorting is all it takes to turn a messy problem into a clean one.

[Deepantika Jain @DeepantikaJ]

#Day19 of my #100DaysOfDSA

Solved LC #56 (Merge Intervals).

🔹 Brute: Repeatedly check overlaps → O(n²)
🔹 Optimal: Sort + Single Traversal → O(n log n)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

Today's takeaway: The intuition was harder than the implementation.

[Deepantika Jain @DeepantikaJ]

#Day18 of my #100DaysOfDSA

Solved GFG's Count Subarrays with Given XOR.

🔹 Brute: Generate all subarrays → O(n³)
🔹 Better: Running XOR → O(n²)
🔹 Optimal: Prefix XOR + HashMap → O(n)

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

Interesting how the same Prefix Sum pattern keeps showing up in different subarray problems.

#DSA #Java #100DaysOfCode #LearnInPublic #BuildInPublic

[Deepantika Jain @DeepantikaJ]

#Day17 of my #100DaysOfDSA

Solved LC #18 (4Sum) and GFG's Largest Subarray with 0 Sum.

🔹 4Sum
• Brute → O(n⁴)
• Better → Hashing O(n³)
• Optimal → Sort + Two Pointers O(n³)

🔹 Largest Subarray with 0 Sum
• Brute → O(n²)
• Optimal → Prefix Sum + HashMap O(n)

[Deepantika Jain @DeepantikaJ]

@Yash_Saini10 @rohit_negi9 @adityatandon02 @CoderArmy All the best!

[Deepantika Jain @DeepantikaJ]

@Kavya_learns @X Hi kavya

[Deepantika Jain @DeepantikaJ]

@dark_coderz True !!