• Completed Binary Tree problems — built strong fundamentals • Solved Binary Search Tree problems up to medium level after identifying common patterns • Learned Heaps (array-based implementation) and understood bottom-up heapify for efficient heap construction 🔥 • Practiced priority queue–based problems like Task Scheduler and Hand of Straights • Currently revising core topics and moving into Greedy Algorithms 🚀

Learning Progress 🚀Spent time revising core recursion and binary tree concepts today, along with practicing some new variations. Also continued learning web development by working on responsive layouts and a starting landing page using Bootstrap. Staying consistent and focusing on fundamentals.