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 78 of my DSA Journey Wrapped up Segment Trees today — and that officially marks the end of my core DSA grind! 🎯 Next step: diving into LeetCode problems to put everything into practice 💪 #100DaysOfCode #DSA #LeetCode #CodingJourney
🚀 Day 77 of my #100DaysOfDSA Today I practiced: ✅ Balanced Parentheses combinations 🧩 ✅ Minimum Partitioning 🔢 ✅ Minimum Partitioning (Zero Difference) ⚖️ ✅ Tribonacci Series 🔺 Slowly mastering DP one problem at a time 💪 #DynamicProgramming #CodingJourney #DSA
Day 76 of my DSA journey 💻 Learned dynamic programming problems: 🔹 Longest Common Substring 🔹 Longest Increasing Subsequence 🔹 Wildcard Matching 🔹 String Conversion 🔹 Edit Distance Each problem deepened my DP understanding! #100DaysOfCode #DSA #DynamicProgramming
🧩 Day 75 of #100DaysOfCode Today I learned LCS (Longest Common Subsequence) in Dynamic Programming 💪 Explored all three approaches: 🔹 Recursion 🔹 Memoization 🔹 Tabulation Feeling great to see how DP simplifies complex problems step-by-step! 🚀 #DP #LCS #DSA #CodingJourney
🚀 Day 74 of my DSA journey! Dived into Dynamic Programming today — it’s super interesting! 💡 Learned about DP basics, Memoization, Tabulation, and solved: 🔹 Fibonacci 🔹 0/1 Knapsack 🔹 Unbounded Knapsack 🔹 Climbing Stairs 🔹 Target Sum #100DaysOfCode #DSA #DynamicProgramming
🚀 Day 73 Today I explored Tarjan’s Algorithm — a powerful DFS-based approach to find Bridges 🌉 and Articulation Points 🔗 in a graph. It’s amazing how discovery & low times reveal critical connections in networks! 💡 #100DaysOfCode #GraphAlgorithms #Tarjan #DSA #CodingJourney
🚀 Participated in a hackathon with my team — Prajwal, Mayank & Karan! We built DSA Visualized, a tool to visualize searching, sorting, trees & graph algorithms. 🔗 Deployed: [saurav-s-mehta-07.github.io/DSA-Visualizer/ ] | 💻 GitHub: [github.com/Saurav-S-Mehta…] #Hackathon #DSA #WebDev
![sauravsmehta143's tweet image. 🚀 Participated in a hackathon with my team — Prajwal, Mayank & Karan!
We built DSA Visualized, a tool to visualize searching, sorting, trees & graph algorithms.
🔗 Deployed: [saurav-s-mehta-07.github.io/DSA-Visualizer/ ] | 💻 GitHub: [github.com/Saurav-S-Mehta…]
#Hackathon #DSA #WebDev](https://pbs.twimg.com/media/G4BA5RQWYAAN2ro.jpg)
![sauravsmehta143's tweet image. 🚀 Participated in a hackathon with my team — Prajwal, Mayank & Karan!
We built DSA Visualized, a tool to visualize searching, sorting, trees & graph algorithms.
🔗 Deployed: [saurav-s-mehta-07.github.io/DSA-Visualizer/ ] | 💻 GitHub: [github.com/Saurav-S-Mehta…]
#Hackathon #DSA #WebDev](https://pbs.twimg.com/media/G4BAcYlXoAAhiLZ.png)
![sauravsmehta143's tweet image. 🚀 Participated in a hackathon with my team — Prajwal, Mayank & Karan!
We built DSA Visualized, a tool to visualize searching, sorting, trees & graph algorithms.
🔗 Deployed: [saurav-s-mehta-07.github.io/DSA-Visualizer/ ] | 💻 GitHub: [github.com/Saurav-S-Mehta…]
#Hackathon #DSA #WebDev](https://pbs.twimg.com/media/G4BAZnXWQAA_NHh.jpg)
![sauravsmehta143's tweet image. 🚀 Participated in a hackathon with my team — Prajwal, Mayank & Karan!
We built DSA Visualized, a tool to visualize searching, sorting, trees & graph algorithms.
🔗 Deployed: [saurav-s-mehta-07.github.io/DSA-Visualizer/ ] | 💻 GitHub: [github.com/Saurav-S-Mehta…]
#Hackathon #DSA #WebDev](https://pbs.twimg.com/media/G4BAcY2XsAApEnL.jpg)
Day 72 of my DSA Journey 🚀 Solved graph problems today: Mother Vertex in Directed Graph Cycle Detection using Union-Find Alien Dictionary (Topological Sort) Closed Islands (DFS) Graphs getting clearer day by day! 💪
Day 71 of my DSA journey 💻 Today I learned and implemented Kruskal’s Algorithm 🕸️ for finding the Minimum Spanning Tree and solved the Flood Fill problem 🎨 to understand recursion and DFS better. Every day, one step closer to mastery! 🚀 #100DaysOfCode #DSA #Java
Day 70 of my #100DaysOfDSA 🚀 Today I learned about Connecting Cities with Minimum Cost using Minimum Spanning Tree (MST) concepts 🌆 Also explored Disjoint Set (Union-Find) — powerful for detecting cycles and optimizing MST algorithms like Kruskal’s ⚡ #DSA #Java #Algorithms
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
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
United States Trends
- 1. Jets 117K posts
- 2. Sauce 82.5K posts
- 3. Courtois 41.8K posts
- 4. Colts 56.4K posts
- 5. Breece Hall 10.9K posts
- 6. Garrett Wilson 5,227 posts
- 7. $JFB N/A
- 8. Liverpool 222K posts
- 9. Cheney 237K posts
- 10. Beane 5,328 posts
- 11. Luis Diaz 32.3K posts
- 12. Veach 5,749 posts
- 13. Shaheed 17.5K posts
- 14. Penning 3,020 posts
- 15. Hakimi 31.1K posts
- 16. Bayern 115K posts
- 17. Brad Holmes 1,225 posts
- 18. AD Mitchell 6,708 posts
- 19. Real Madrid 181K posts
- 20. Mazi Smith 6,123 posts
Something went wrong.
Something went wrong.