Mayank Singh

🧠 Day 45 - #SDESheetChallenge takeUforward 45 days. One challenge completed. ✅ Today's problems: 🟠 Distinct Numbers in Each Subarray 🟠 K-th Largest Element in an Unsorted Array 🟠 Flood Fill Algorithm This challenge wasn't just about solving 100+ DSA problems. It taught me to stay consistent, recognize patterns, and enjoy the process of problem-solving. A huge thanks to takeUforward and Raj Vikramaditya for creating such an amazing roadmap. It made DSA practice structured and pushed me to show up every single day. This may be the end of the challenge... but it's definitely not the end of the journey. On to more LeetCode, more projects, and more learning. 😊 https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #ProblemSolving #LearningInPublic #SoftwareEngineering

🧠 Day 44 - #SDESheetChallenge takeUforward Just one more day left in the challenge. It's interesting how problems that once felt intimidating now feel familiar because the underlying patterns keep repeating. Today's problems: 🟠 Binary Tree to Doubly Linked List 🟠 Find Median in a Stream 🟠 Kth Largest Element in a Stream of Running Integers 💡 Today's takeaway: The more patterns you learn, the less every new problem feels like a completely new problem. Day 44 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #Algorithms #ProblemSolving #LearningInPublic

🧠 Day 43 - #SDESheetChallenge takeUforward Today's BST problems brought together almost everything I've learned about trees. 🟠 Two Sum in BST Used two BST iterators to simulate the two-pointer technique without converting the tree into an array. 🟠 BST Iterator Implemented an iterator using a stack to return the next smallest element in O(1) amortized time. 🟠 Size of the Largest BST in a Binary Tree Used a bottom-up DFS where each subtree returned its min, max, and size to identify the largest valid BST. 🟠 Serialize & Deserialize Binary Tree Converted a tree into a string and reconstructed it back using Level Order Traversal. 💡 Today's takeaway: Hard tree problems aren't about learning new algorithms. They're about combining familiar ideas in the right way. Day 43 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BST #BinaryTree #Algorithms #ProblemSolving

🧠 Day 42 - #SDESheetChallenge takeUforward Today's BST problems showed how much you can achieve just by using the tree's ordering. 🟠 Floor in a BST Traversed the tree to find the greatest value less than or equal to the target. 🟠 Ceil in a BST Found the smallest value greater than or equal to the target using the same BST property. 🟠 Find K-th Smallest Element in BST Performed an inorder traversal since BST nodes are visited in sorted order. 🟠 K-th Smallest & Largest Element in BST Extended the inorder idea to efficiently retrieve both extremes. 💡 Today's takeaway: The more I practice BSTs, the more I realize that inorder traversal is one of the most powerful tools in the toolkit. Day 42 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BST #BinarySearchTree #Algorithms #ProblemSolving

🧠 Day 41 - #SDESheetChallenge takeUforward Today's BST problems reinforced one thing: The BST property itself solves half the problem. 🟠 Construct a BST from Preorder Traversal Built the tree by maintaining valid value ranges instead of searching for split points. 🟠 Check if a Tree is a BST Validated every node using lower and upper bounds during DFS. 🟠 LCA in BST Used the BST property to move left or right until both nodes diverged. 🟠 Inorder Successor & Predecessor in BST Traversed the tree while keeping track of the closest larger and smaller values. 💡 Today's takeaway: Once you trust the BST property, many "hard" problems become straightforward. Day 41 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BST #BinarySearchTree #Algorithms #ProblemSolving

🧠 Day 40 - #SDESheetChallenge takeUforward Today marked the beginning of Binary Search Trees. 🌳 🟠 Populating Next Right Pointers in Each Node Connected nodes level by level using their next pointers for efficient traversal. 🟠 Search in BST Leveraged the BST property to search in O(h) by deciding whether to move left or right. 🟠 Construct BST from Given Keys Built the BST by inserting keys while maintaining the BST property at every step. 💡 Today's takeaway: A Binary Search Tree isn't just a tree. Its ordering property turns many operations from O(n) into O(h). Day 40 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BinarySearchTree #BST #Algorithms #ProblemSolving

🧠 Day 39 - #SDESheetChallenge takeUforward Today's problems were all about transforming and validating Binary Trees. 🟠 Symmetric Binary Tree Compared the left and right subtrees recursively to check if they mirror each other. 🟠 Flatten Binary Tree to Linked List Rearranged the tree into a preorder linked list using pointer manipulation without creating new nodes. 🟠 Check for Symmetrical BTs Applied the same mirror comparison approach to verify whether two subtrees are symmetric. 🟠 Children Sum Property Modified the tree so every parent node equals the sum of its children using DFS. 💡 Today's takeaway: Many Binary Tree problems become easier once you stop looking at nodes individually and start thinking in terms of recursive relationships. Day 39 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BinaryTree #Algorithms #ProblemSolving

🤖 AI Agents are shaping the next generation of software, and now there's a great opportunity to learn how to build them for free. GeeksforGeeks, in collaboration with Snowflake, has launched a free program on Building AI Agents with Snowflake Cortex AI. If you're interested in: 🧠 AI & LLMs 🤖 AI Agents 💻 Software Development 📈 Building industry-relevant skills this is a great place to start. I've explored the program, and it offers a practical introduction to building AI-powered applications using Snowflake Cortex AI. 🎓 Completely Free 🚀 Beginner-friendly 📜 Certificate on completion 🔗 Register using my link:https://gfgcdn.com/tu/w0X/ If you're planning to explore AI this year, this opportunity is definitely worth checking out. What AI project are you planning to build next? Let me know in the comments! 👇 #GeeksforGeeks #Snowflake #AIAgents #CortexAI #ArtificialIntelligence #MachineLearning #GenerativeAI #Students #Learning #CareerGrowth

🧠 Day 38 - #SDESheetChallenge takeUforward Today's Binary Tree problems were all about rebuilding and evaluating trees. 🟠 Maximum Path Sum Used DFS to compute the maximum gain from each subtree while maintaining the overall maximum path sum. 🟠 Construct Binary Tree from Preorder & Inorder Used preorder to identify the root and inorder to split the left and right subtrees recursively. 🟠 Construct Binary Tree from Postorder & Inorder Similar approach, but this time postorder gives the root after partitioning the inorder array. 💡 Today's takeaway: Tree construction problems may look different, but they all become easier once you understand how traversals reveal a tree's structure. Day 38 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BinaryTree #Algorithms #ProblemSolving

🧠 Day 37 - #SDESheetChallenge takeUforward Today's Binary Tree problems were all about seeing the tree from different perspectives. 🟠 LCA in Binary Tree Found the Lowest Common Ancestor using DFS by returning the node where both paths meet. 🟠 Check if Two Trees are Identical Compared both trees recursively, checking structure and node values together. 🟠 Zig Zag (Spiral) Traversal Used Level Order Traversal while alternating the direction at each level. 🟠 Boundary Traversal Traversed the left boundary, leaf nodes, and right boundary separately to print the complete boundary. 💡 Today's takeaway: Tree problems often use the same DFS or BFS. The real difference is what information you collect during the traversal. Day 37 completed. ✅ Thanks takeUforward and Raj Vikramaditya for the amazing SDE Sheet. https://lnkd.in/gjwXUgEY #SDESheetChallenge #LeetCode #DSA #BinaryTree #Algorithms #ProblemSolving