💻 Morning Grind
Solved LeetCode 973 – K Closest Points to Origin 📍
Used a Max Heap to efficiently find the K closest points.
✅ Heap Practice
✅ Optimization Thinking
✅ New Pattern Learned
#LeetCode#DSA#CPP#Coding#Heap#MorningGrind 🚀
Completed the Microsoft Powered: Architecting Agentic AI Business Solutions program 🎓🚀
Learned about Agentic AI, AI workflows, and real-world AI business solutions 🔥
Certificate:
https://t.co/gE6pXS5If9
#AI#AgenticAI#Microsoft#Tech#Learning
Day 100 💻🔥🎉
Completed my #100DaysOfCode journey ❤️
Solved 101+ problems and learned that consistency beats motivation.
Finished with:
🌳 Flatten Binary Tree to Linked List ✔️
⚡ 0 ms runtime
This is just the beginning 🚀
#DSA#LeetCode#CPP#Coding
Day 99 💻🔥
Solved Trim a Binary Search Tree🌳✔️
Used recursion + BST pruning logic to remove nodes outside the given range while maintaining BST structure
Accepted with 0 ms runtime ⚡
One step away from completing #100DaysOfCode🚀#DSA#LeetCode#CPP#Coding#BinarySearchTree
Day 97 💻🔥
Solved “Construct Binary Search Tree from Preorder Traversal” 🌳✔️
Built a BST step-by-step using preorder traversal + recursive insertion logic.
Great practice for recursion, BST properties, and tree construction in C++
#100DaysOfCode#DSA#LeetCode#CPP#Coding
Day 96 of solving DSA problems 🚀
Solved “Search in a Binary Search Tree” using recursion in C++
Learned
How BST searching works
Recursive traversal logic
Why BST gives efficient search operations
Accepted on LeetCode with 0 ms runtime ✅
#cpp#dsa#leetcode#binarysearchtree
Day 95 💻🔥
Convert Sorted Array to BST ✔️
Used recursion + middle element approach
Learned how balanced BST is built 🌳
#100DaysOfCode#DSA#LeetCode#CPP#Coding
Day 92 🚀
Solved “Insert into a Binary Search Tree” using recursion in C++ 🌳
Accepted with 0 ms runtime ⚡
Learning BST traversal and insertion logic step by step 💯
#leetcode#dsa#cpp#coding#bst#programming#100DaysOfCode
🚀 Day 91
Solved Construct Binary Tree from Preorder and Inorder Traversal 🌳
Used recursion to rebuild the entire binary tree from traversal arrays.
Really helped me understand how preorder identifies roots and inorder splits subtrees
#LeetCode#DSA#100DaysOfCode#programming
🚀 Day 90
Solved Path Sum III 🌳
Used DFS + recursion to count all paths with target sum (not just root paths).
Trees getting clearer day by day 🔥
#LeetCode#DSA#100DaysOfCode#programming
🚀 Day 89
Solved Path Sum II 🌳 on LeetCode
Used Recursion + Backtracking to find all valid root-to-leaf paths with target sum.
Learning trees deeper every day 🔥
#LeetCode#DSA#100DaysOfCode#programming
🚀 Day 88
Solved Binary Tree Right Side View 🌳
Used preorder + level tracking to capture rightmost nodes 👀
Learning trees deeper every day 🔥
#LeetCode#DSA#100DaysOfCode#programming
🚀 Day 87
Solved Binary Tree Level Order Traversal on LeetCode 🌳
Learned level-wise traversal using recursion (DFS style) instead of BFS 💡
Consistency paying off 🔥
#LeetCode#DSA#100DaysOfCode#programming