Day 38 of #DSAWithPython 🔁 Revised Dynamic Programming fundamentals ✔ Fibonacci (Recursion → Memo → Tab → Space Optimized) ✔ Climbing Stairs ✔ Core DP concepts reinforced Strong foundations > Rushing topics. #dsa #python

Day 33 of #DSAwithPython Today I implemented: 🌳 Minimum Spanning Tree ⚡ Kruskal’s Algorithm 🔗 Union-Find (Path Compression + Union by Rank) Time Complexity: O(E log E) Graphs are becoming powerful now 💪🔥 #100DaysOfCode #Python #DSA #Graphs

Day 32 of #DSAWithPython 🚀 Implemented Dijkstra’s Algorithm for shortest path in weighted graphs. 🔹 Min Heap (Priority Queue) 🔹 Edge Relaxation 🔹 O((V + E) log V) complexity 🔹 Understood why negative weights break it #100DaysOfCode #Python #Graphs #CodingJourney

Day 27 of #DSAWithPython 🚀 Today I chose depth over speed. Revisited Graph basics: • BFS (Queue, level-wise traversal) • DFS (Recursion, depth-wise traversal) • Visited array intuition • Disconnected graphs

Day 26 of #DSAWithPython ✅ 📌 Graph Basics 🔹 BFS Traversal (Queue) 🔹 DFS Traversal (Recursion) Built strong foundations before jumping into graph problems 🚀 #100DaysOfCode #Python #DSA #Graphs

Thinking of becoming a strong programmer? 👉 Register Now: t.ly/DSAWPY-4F 👨‍🏫 Trainer: Mr. Nasir Basha 📅 Date: 4th Feb 2026 ⏰ Time: 6:00 PM (IST) #DSAWithPython #NareshIT #DSA #PythonProgramming #DataStructures

Recursion – Sum of Array Elements Final task of the day: Find sum of elements in an array using recursion. Pattern: sum(arr) = arr[0] + sum(arr[1:]) Base case: empty array = 0 Thinking in terms of base + subproblem #DSAwithPython #Recursion #LearningInPublic