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 Tendencias
- 1. Josh Allen 38.2K posts
- 2. Texans 58.8K posts
- 3. Bills 149K posts
- 4. Joe Brady 5,218 posts
- 5. #MissUniverse 436K posts
- 6. #MissUniverse 436K posts
- 7. Anderson 27.8K posts
- 8. Troy 12.3K posts
- 9. McDermott 4,604 posts
- 10. #StrayKids_DO_IT_OutNow 49.6K posts
- 11. Beane 2,812 posts
- 12. #TNFonPrime 3,843 posts
- 13. Maxey 13.6K posts
- 14. Cooper Campbell N/A
- 15. Al Michaels N/A
- 16. Stroud 3,696 posts
- 17. #htownmade 3,955 posts
- 18. Shakir 5,669 posts
- 19. Costa de Marfil 25.4K posts
- 20. Fátima 193K posts
Something went wrong.
Something went wrong.