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