Saurav S Mehta @sauravsmehta143

Day 57 🌟 hashmaps & sets felt like magic today ✨ learned get, remove, containsKey, keySet, isEmpty + linked & tree versions 🌳 solved 🔥 problems: majority element, anagram, distinct count, union/intersection, itinerary for tickets DSA is getting cooler every day.

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 56 of my DSA journey 🚀 🔹 Learned iteration in HashMap 🔹 Explored put() implementation with pre-built method 🔹 Understood rehashing & load factor 🔹 Lambda & O(1) average case lookup 🔹 Bucket index calculation @ApnacollegeX @ShradhaKhapra_

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 55 of my #DSA journey: Revised heaps ✅ Started hashing 🔑 Learned #HashMap & explored its operations. Feeling more confident with key-value concepts 💻✨

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 54 of my #DSAJourney ✅ Today I tackled Heap & Priority Queue problems: K’th Largest Element in a Stream Minimum Time to Fill N Slots Path with Minimum Effort Minimum Operations to Halve Array Sum Merge K Sorted Linked Lists 🚀 @ApnacollegeX @ShradhaKhapra_

keyboard_arrow_left Previous keyboard_arrow_right Next

Had to pause my DSA journey midway because of midterms 📚✍️ But exams are done ✅ and I’m back on track from today. Excited to continue learning and grinding! 🚀 #DSA #100DaysOfCode

🚀 Day 53 of my DSA journey! Today I conquered: Heap Sort Nearby Cars Connect N Ropes (Min Cost) Weakest Soldiers Sliding Window Maximum Learning heaps & optimization one problem at a time! @ApnacollegeX @ShradhaKhapra_

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 52 of my DSA journey 🚀 Today I dived into Heap → learned about Priority Queue, Heap Implementation, Complete Binary Tree (CBT), Insertion, Peek, and Removal in Heap 🔥 #DSA #100DaysOfCode #CodingJourney

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 51 of my DSA journey 🌳 Solved 5 BST problems today: ✔️ Max Sum BST in Binary Tree ✔️ Greater Sum Tree ✔️ Kth Smallest Element ✔️ Range Sum in BST ✔️ Closest Element in BST Feeling stronger with trees 💪🔥 #DSA #100DaysOfCode @ApnacollegeX @ShradhaKhapra_

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 50 of my DSA Journey: Today I learned Red-Black Tree insertion & deletion 🌳⚫🔴 The balancing with rotations + recoloring is so interesting — keeps the tree efficient and height balanced! Really enjoyed this concept 🔥 #DSA #Coding

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 49 of my DSA journey 🚀 Today I learned AVL Tree node deletion – maintaining balance after removing nodes isn’t easy, but rotations keep the tree in shape 🌳⚖️ @ShradhaKhapra_ @ApnacollegeX

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 48 of my DSA journey 🚀 Today I learned about AVL Balanced Trees 🌳 — explored the 4 cases (LL, RR, LR, RL) and how rotations help maintain balance during creation. ⚖️🔄 @ApnacollegeX @ShradhaKhapra_

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 47 of my DSA Journey 🚀 ✅ Learned how to merge two BSTs into a balanced BST 🌳 ✅ Solved problem on finding the size of the largest BST in a Binary Tree 🔍 @ShradhaKhapra_ @ApnacollegeX #DSA #100DaysOfCode #BinaryTree #BST

keyboard_arrow_left Previous keyboard_arrow_right Next

🚀 Day 46 of my DSA Journey ✨ Learned how to convert a sorted array into a Balanced BST 🌲 🔄 Practiced converting an existing BST into a Balanced BST for optimal height & efficiency ⚡ #DSA #100DaysOfCode #CodingJourney

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 45 of my #DSA journey 🌳 ✅ Learned print in range in BST ✅ Explored root-to-leaf paths ✅ Checked if a tree is a valid BST ✅ Created mirror of a BST Slowly mastering Binary Search Trees 🚀 #100DaysOfCode #DSA

keyboard_arrow_left Previous keyboard_arrow_right Next

📌 Day 44 of my DSA Journey Learned Delete Node in BST 🌳 Cases covered: ✅ Node with no child (leaf deletion) ✅ Node with one child ✅ Node with two children (replace with inorder successor/predecessor) #100DaysOfCode #DSA #BST

keyboard_arrow_left Previous keyboard_arrow_right Next

📌 Day 43 of my DSA Journey Solved Find All Duplicate Subtrees 🌳 Cracked Maximum Path Sum in Binary Tree 💡 Moved to Binary Search Tree: learned how to build a BST and search elements 🔎 #100DaysOfCode #DSA #BinaryTree #BST

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 42 of my #DSAJourney: Today I explored binary trees deeply Learned how to: Find minimum distance between two nodes Determine the kth ancestor of a node Transform a tree into a sumtree Check if a tree is univalued Find the mirror of a binary tree #100DaysOfDSA #BinaryTree

keyboard_arrow_left Previous keyboard_arrow_right Next

🌳 Day 41 of my #DSA journey! Today I explored: Printing nodes at the Kth level in a Binary Tree Finding the Lowest Common Ancestor (LCA) in a Binary Tree @ApnacollegeX @ShradhaKhapra_ #100DaysOfCode #DSA #BinaryTree

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 40 of my DSA journey 🚀 Today I explored Binary Trees in depth 🌳 ✅ Diameter of a Tree (2 approaches) ✅ Subtree of another tree + code ✅ Top View of a Tree (basics, approach & code) #DSA #100DaysOfCode #BinaryTree

keyboard_arrow_left Previous keyboard_arrow_right Next

Day 39 of my DSA Journey 🌳 Today I jumped into Binary Trees and learned: Building tree (preorder) Preorder, Inorder & Postorder traversal Level order traversal Height of tree Count of nodes Sum of nodes @ApnacollegeX @ShradhaKhapra_ Excited to go deeper! 🔥 #DSA #100DaysOfCode

keyboard_arrow_left Previous keyboard_arrow_right Next