sauravsmehta143's profile picture. Student on a mission to turn dreams into reality | Explorer of knowledge & new ideas | Learning from every book, experience, and person

Saurav S Mehta

@sauravsmehta143

Student on a mission to turn dreams into reality | Explorer of knowledge & new ideas | Learning from every book, experience, and person

Day 69 of #100DaysOfDSA 🚀 Today I solved a question on Cheapest Price Path with K Stops ✈️💰 Learned how to apply modified Dijkstra’s algorithm / BFS with constraints to find the minimum cost within limited stops. #DSA #CodingJourney #GraphAlgorithms

sauravsmehta143's tweet image. Day 69 of #100DaysOfDSA 🚀
Today I solved a question on Cheapest Price Path with K Stops ✈️💰
Learned how to apply modified Dijkstra’s algorithm / BFS with constraints to find the minimum cost within limited stops.
#DSA #CodingJourney #GraphAlgorithms
sauravsmehta143's tweet image. Day 69 of #100DaysOfDSA 🚀
Today I solved a question on Cheapest Price Path with K Stops ✈️💰
Learned how to apply modified Dijkstra’s algorithm / BFS with constraints to find the minimum cost within limited stops.
#DSA #CodingJourney #GraphAlgorithms
sauravsmehta143's tweet image. Day 69 of #100DaysOfDSA 🚀
Today I solved a question on Cheapest Price Path with K Stops ✈️💰
Learned how to apply modified Dijkstra’s algorithm / BFS with constraints to find the minimum cost within limited stops.
#DSA #CodingJourney #GraphAlgorithms
sauravsmehta143's tweet image. Day 69 of #100DaysOfDSA 🚀
Today I solved a question on Cheapest Price Path with K Stops ✈️💰
Learned how to apply modified Dijkstra’s algorithm / BFS with constraints to find the minimum cost within limited stops.
#DSA #CodingJourney #GraphAlgorithms

Day 68 of my #100DaysOfDSA 🚀 Today I learned about the Bellman-Ford Algorithm (handling negative weights 💡) and Minimum Spanning Trees (MST) — understanding Kruskal’s and Prim’s approach to building efficient networks 🌐 #DSA #CodingJourney #GraphAlgorithms

sauravsmehta143's tweet image. Day 68 of my #100DaysOfDSA 🚀
Today I learned about the Bellman-Ford Algorithm (handling negative weights 💡) and Minimum Spanning Trees (MST) — understanding Kruskal’s and Prim’s approach to building efficient networks 🌐
#DSA #CodingJourney #GraphAlgorithms
sauravsmehta143's tweet image. Day 68 of my #100DaysOfDSA 🚀
Today I learned about the Bellman-Ford Algorithm (handling negative weights 💡) and Minimum Spanning Trees (MST) — understanding Kruskal’s and Prim’s approach to building efficient networks 🌐
#DSA #CodingJourney #GraphAlgorithms

In the last 7 days, I dived deep into Graph Algorithms: BFS & DFS Connected Components Topological Sort & Kahn’s Algorithm Bipartite Graphs Cycle detection (Directed & Undirected) Dijkstra’s Algorithm Weighted & Unweighted Graphs Solved multiple graph problems #100DaysOfCode


DAY 64 GRAPHS detecting cycle in directed and undirected graphs

sauravsmehta143's tweet image. DAY 64
GRAPHS

detecting cycle in directed and undirected graphs
sauravsmehta143's tweet image. DAY 64
GRAPHS

detecting cycle in directed and undirected graphs

Missed posting the last few days, but I’m still going strong with my #100DaysOfCode journey 💻🔥 Back on track — this is Day 68! Let’s keep pushing 🚀


🚀 Day 60 of my DSA journey! Today I revised the concepts of HashMap, HashSet & Tries 🔑📚 HashMap ➝ Key-Value magic 🗝 HashSet ➝ Unique elements only ✨ Tries ➝ Fast prefix-based lookups 🌲 Consistency is compounding 💯 #100DaysOfCode #DSA


🚀 Day 59 of my #DSA journey! Dived into Trie problems today: ✅ startsWith ✅ Unique Substring ✅ Word Break (prefix-based) ✅ Largest String with all its prefixes Tries are 🔑 for mastering string problems & prefix-based queries. Onward to Day 60! #100DaysOfCode #DSA

sauravsmehta143's tweet image. 🚀 Day 59 of my #DSA journey!
Dived into Trie problems today:
✅ startsWith

✅ Unique Substring

✅ Word Break (prefix-based)

✅ Largest String with all its prefixes

Tries are 🔑 for mastering string problems & prefix-based queries.
Onward to Day 60! #100DaysOfCode #DSA
sauravsmehta143's tweet image. 🚀 Day 59 of my #DSA journey!
Dived into Trie problems today:
✅ startsWith

✅ Unique Substring

✅ Word Break (prefix-based)

✅ Largest String with all its prefixes

Tries are 🔑 for mastering string problems & prefix-based queries.
Onward to Day 60! #100DaysOfCode #DSA
sauravsmehta143's tweet image. 🚀 Day 59 of my #DSA journey!
Dived into Trie problems today:
✅ startsWith

✅ Unique Substring

✅ Word Break (prefix-based)

✅ Largest String with all its prefixes

Tries are 🔑 for mastering string problems & prefix-based queries.
Onward to Day 60! #100DaysOfCode #DSA
sauravsmehta143's tweet image. 🚀 Day 59 of my #DSA journey!
Dived into Trie problems today:
✅ startsWith

✅ Unique Substring

✅ Word Break (prefix-based)

✅ Largest String with all its prefixes

Tries are 🔑 for mastering string problems & prefix-based queries.
Onward to Day 60! #100DaysOfCode #DSA

📅 Day 58 of my #DSA journey ✨ Solved: Top & Bottom View (Binary Tree), Two Sum, LRU, Highest Freq String (using HashMap) 🌱 Started with Trie DS → learned how to build & search in it Feeling excited to dive deeper into Trie applications 🚀

sauravsmehta143's tweet image. 📅 Day 58 of my #DSA journey
✨ Solved: Top & Bottom View (Binary Tree), Two Sum, LRU, Highest Freq String (using HashMap)
🌱 Started with Trie DS → learned how to build & search in it
Feeling excited to dive deeper into Trie applications 🚀
sauravsmehta143's tweet image. 📅 Day 58 of my #DSA journey
✨ Solved: Top & Bottom View (Binary Tree), Two Sum, LRU, Highest Freq String (using HashMap)
🌱 Started with Trie DS → learned how to build & search in it
Feeling excited to dive deeper into Trie applications 🚀
sauravsmehta143's tweet image. 📅 Day 58 of my #DSA journey
✨ Solved: Top & Bottom View (Binary Tree), Two Sum, LRU, Highest Freq String (using HashMap)
🌱 Started with Trie DS → learned how to build & search in it
Feeling excited to dive deeper into Trie applications 🚀
sauravsmehta143's tweet image. 📅 Day 58 of my #DSA journey
✨ Solved: Top & Bottom View (Binary Tree), Two Sum, LRU, Highest Freq String (using HashMap)
🌱 Started with Trie DS → learned how to build & search in it
Feeling excited to dive deeper into Trie applications 🚀

Day 57 🌟 hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets DSA is getting cooler every day.

sauravsmehta143's tweet image. Day 57 🌟
hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 
solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets 
DSA is getting cooler every day.
sauravsmehta143's tweet image. Day 57 🌟
hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 
solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets 
DSA is getting cooler every day.
sauravsmehta143's tweet image. Day 57 🌟
hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 
solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets 
DSA is getting cooler every day.
sauravsmehta143's tweet image. Day 57 🌟
hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 
solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets 
DSA is getting cooler every day.

Day 56 of my DSA journey 🚀 🔹 Learned iteration in HashMap 🔹 Explored put() implementation with pre-built method 🔹 Understood rehashing & load factor 🔹 Lambda & O(1) average case lookup 🔹 Bucket index calculation @ApnacollegeX @ShradhaKhapra_

sauravsmehta143's tweet image. Day 56 of my DSA journey 🚀
🔹 Learned iteration in HashMap
🔹 Explored put() implementation with pre-built method
🔹 Understood rehashing & load factor
🔹 Lambda & O(1) average case lookup
🔹 Bucket index calculation 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. Day 56 of my DSA journey 🚀
🔹 Learned iteration in HashMap
🔹 Explored put() implementation with pre-built method
🔹 Understood rehashing & load factor
🔹 Lambda & O(1) average case lookup
🔹 Bucket index calculation 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. Day 56 of my DSA journey 🚀
🔹 Learned iteration in HashMap
🔹 Explored put() implementation with pre-built method
🔹 Understood rehashing & load factor
🔹 Lambda & O(1) average case lookup
🔹 Bucket index calculation 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. Day 56 of my DSA journey 🚀
🔹 Learned iteration in HashMap
🔹 Explored put() implementation with pre-built method
🔹 Understood rehashing & load factor
🔹 Lambda & O(1) average case lookup
🔹 Bucket index calculation 
@ApnacollegeX @ShradhaKhapra_

Day 55 of my #DSA journey: Revised heaps ✅ Started hashing 🔑 Learned #HashMap & explored its operations. Feeling more confident with key-value concepts 💻✨

sauravsmehta143's tweet image. Day 55 of my #DSA journey: Revised heaps ✅ Started hashing 🔑 Learned #HashMap & explored its operations. Feeling more confident with key-value concepts 💻✨
sauravsmehta143's tweet image. Day 55 of my #DSA journey: Revised heaps ✅ Started hashing 🔑 Learned #HashMap & explored its operations. Feeling more confident with key-value concepts 💻✨

Day 54 of my #DSAJourney ✅ Today I tackled Heap & Priority Queue problems: K’th Largest Element in a Stream Minimum Time to Fill N Slots Path with Minimum Effort Minimum Operations to Halve Array Sum Merge K Sorted Linked Lists 🚀 @ApnacollegeX @ShradhaKhapra_

sauravsmehta143's tweet image. Day 54 of my #DSAJourney ✅ Today I tackled Heap & Priority Queue problems:

K’th Largest Element in a Stream

Minimum Time to Fill N Slots

Path with Minimum Effort

Minimum Operations to Halve Array Sum

Merge K Sorted Linked Lists 🚀

@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. Day 54 of my #DSAJourney ✅ Today I tackled Heap & Priority Queue problems:

K’th Largest Element in a Stream

Minimum Time to Fill N Slots

Path with Minimum Effort

Minimum Operations to Halve Array Sum

Merge K Sorted Linked Lists 🚀

@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. Day 54 of my #DSAJourney ✅ Today I tackled Heap & Priority Queue problems:

K’th Largest Element in a Stream

Minimum Time to Fill N Slots

Path with Minimum Effort

Minimum Operations to Halve Array Sum

Merge K Sorted Linked Lists 🚀

@ApnacollegeX @ShradhaKhapra_

Had to pause my DSA journey midway because of midterms 📚✍️ But exams are done ✅ and I’m back on track from today. Excited to continue learning and grinding! 🚀 #DSA #100DaysOfCode


🚀 Day 53 of my DSA journey! Today I conquered: Heap Sort Nearby Cars Connect N Ropes (Min Cost) Weakest Soldiers Sliding Window Maximum Learning heaps & optimization one problem at a time! @ApnacollegeX @ShradhaKhapra_

sauravsmehta143's tweet image. 🚀 Day 53 of my DSA journey! Today I conquered:

Heap Sort

Nearby Cars

Connect N Ropes (Min Cost)

Weakest Soldiers

Sliding Window Maximum

Learning heaps & optimization one problem at a time! 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. 🚀 Day 53 of my DSA journey! Today I conquered:

Heap Sort

Nearby Cars

Connect N Ropes (Min Cost)

Weakest Soldiers

Sliding Window Maximum

Learning heaps & optimization one problem at a time! 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. 🚀 Day 53 of my DSA journey! Today I conquered:

Heap Sort

Nearby Cars

Connect N Ropes (Min Cost)

Weakest Soldiers

Sliding Window Maximum

Learning heaps & optimization one problem at a time! 
@ApnacollegeX @ShradhaKhapra_
sauravsmehta143's tweet image. 🚀 Day 53 of my DSA journey! Today I conquered:

Heap Sort

Nearby Cars

Connect N Ropes (Min Cost)

Weakest Soldiers

Sliding Window Maximum

Learning heaps & optimization one problem at a time! 
@ApnacollegeX @ShradhaKhapra_

United States الاتجاهات

Loading...

Something went wrong.


Something went wrong.