Asif Hashmi

Learning Web-Dev(MERN) || c++ || learning Data-Structure

[Asif Hashmi @BitDeveloper01]

🚀Excited about my dynamic programming journey:
▶️started with Fibonacci (easy!), then

▶️House Robber (not so easy), and Painting Fence (not easy at all).

Learning one challenge at a time! #DynamicProgramming 🚀💡🎨

[Asif Hashmi @BitDeveloper01]

Day --> 34 of #100xdsa

Question solved --> 3

1️⃣ Merge k Sorted Arrays (Medium)
2️⃣ 23. Merge k Sorted Lists (Hard)
3️⃣ 632. Smallest Range Covering Elements from K Lists (Hard)

#365daysofcode #365daychallenge #dsa #dsachallenge #leetcode #leetcodechallenge #programmingcommunity

[Asif Hashmi @BitDeveloper01]

@Mahnoorgondal77 Daily🥲

[Asif Hashmi @BitDeveloper01]

Day --> 33 of #100xdsa

Question solved --> 4

1️⃣Predecessor and Successor of BST (Medium)
2️⃣1008. Construct Binary Search Tree from Preorder Traversal (Medium)
3️⃣Brothers From Different Roots (easy)
4️⃣Median of BST (easy)

#365daysofcode #365daychallenge #dsa #dsachallenge

[Asif Hashmi @BitDeveloper01]

Day --> 32 of #100xdsa

Question solved --> 2

109. Convert Sorted List to Binary Search Tree (Medium)
Largest BST (Medium)

#365daysofcode #365daychallenge #dsa #dsachallenge #leetcode #leetcodechallenge #programmingcommunity #codingchallenge #codingjourney

[Asif Hashmi @BitDeveloper01]

🚀 Day 32 of #100xDsa 💻
Solved @GeeksforGeeks problem:Largest BST in a binary tree.

#approach
〉Recursively validate each subtree, updating maximum valid BST size encountered. Efficiently finds largest BST.

#BinaryTree #BinarySearchTree #Validation #GeeksForGeeks #Algorithm

[Asif Hashmi @BitDeveloper01]

@Abhishe41552952 If you also want to go with Competative Programming then go for C++, else Java
Because both languages has ample amount of resources.

[Asif Hashmi @BitDeveloper01]

🚀 Day 31 of #100xDsa 💻
Solved @GeeksforGeeks problem: Binary Tree to Doubly LinkedList

#approach
〉Recursively traverse tree in inorder, attaching right subtree to DLL head. Efficient conversion maintaining order

#BinaryTree #InorderTraversal #DoublyLinkedList #GeeksForGeeks

[Asif Hashmi @BitDeveloper01]

🚀 Day 30 of #100xDsa 💻
Solved @LeetCode 653: Two Sum IV - Input is a BST.

#approach :
〉Inorder traversal yields sorted elements. Use two-pointer technique to find target sum. Efficient solution.

#BinarySearchTree #TwoPointerTechnique #LeetCode #Algorithm #DataStructures 🌳

[Asif Hashmi @BitDeveloper01]

🚀 Day 30 of #100xDsa 💻
Solved @LeetCode 230: Kth Smallest Element in a BST

#approach :
〉Utilize BST property. Perform inorder traversal. Decrement k. Return kth element. Efficient solution

#BinarySearchTree #LeetCode #Algorithm #LearnInPublic #DataStructures #Programming 🌿

[Asif Hashmi @BitDeveloper01]

🚀 Day 30 of #100xDsa 💻
Solved @LeetCode 235: Lowest Common Ancestor of a Binary Search Tree.

#approach :
〉Recursive. Traverse BST comparing node values. Find LCA iteratively. Efficient solution for LCA.

#BinarySearchTree #Recursion #LeetCode #Algorithm #DataStructures 🌳

[Asif Hashmi @BitDeveloper01]

🚀 Day 30 of #100xDsa 💻
Solved @LeetCode 98: Validate Binary Search Tree.

#approach :
〉DFS traversal, maintain lower and upper bounds to validate BST property. Return true/false accordingly.

#BinaryTree #DFS #LeetCode #Algorithm #LearnInPublic #DataStructures #Programming 🌳

[Asif Hashmi @BitDeveloper01]

🚀 Day 29 of #100xDsa 💻
Solved @geeksforgeeks problem:Maximum sum of Non-adjacent nodes.

#approach :
〉DFS traversal, track inclusive and exclusive maximum sums. Return maximum sum.

#BinaryTree #DFS #GeeksForGeeks #Algorithm #DataStructures #Programming #100DaysOfCode🌲

[Asif Hashmi @BitDeveloper01]

🚀 Day 29 of #100xDsa 💻
Solved @GeeksforGeeks problem: Sum of nodes on longest root-to-leaf path.

#approach :
〉DFS traversal to find longest path, track sum. Return sum of longest path.

#BinaryTree #DFS #GeeksForGeeks #algorithm #100DaysOfCode #leetcode

[Asif Hashmi @BitDeveloper01]

🚀 Day 29 of #100xDsa 💻
Solved GeeksforGeeks Burning Tree problem.

#approach :
🔍Find target node using BFS, track parent-child. 🔥Burn tree with BFS,⏳track burn time. Return minimum time.

#BinaryTree #BFS #GeeksForGeeks #algorithm #LearnInPublic #100DaysOfCode

[Asif Hashmi @BitDeveloper01]

🚀 Day 28 of #100xDsa 💻
Solved @LeetCode 652:Find Duplicate Subtrees.

#approach
〉Encode subtrees uniquely, track duplicates with map.
Return roots of duplicate subtrees.

#DataStructures #Algorithm #LeetCode #LearnInPublic #100daysofcodechallenge

[Asif Hashmi @BitDeveloper01]

@SwiftUIvan bool tweetReply = true;

first we write Data-Type : bool
then, we write a variable name : tweetReply
then, assign the value whatever you want : true;

[Asif Hashmi @BitDeveloper01]

🚀 Day 27 of #100xDsa 💻
Solved @LeetCode 94: Binary Tree Inorder Traversal

#approach :
〉Morris Traversal for efficient space usage. Visit leftmost, connect predecessor, move to right.

#DataStructures #Algorithm #LeetCode #LearnInPublic #100DaysOfCode #leetcode

[Asif Hashmi @BitDeveloper01]

🚀 Day 27 of #100DaysOfDSA 💻
Solved @LeetCode 114: Flatten Binary Tree to Linked List.

#approach :
〉Initialize curr pointer, iterate to connect nodes. Update until all nodes processed.

#DataStructures #Algorithm #CodingChallenge #100DaysOfCode #leetcode #LearnInPublic

[Asif Hashmi @BitDeveloper01]

@yashveer_2024 @LeetCode @Leetcoders @geeksforgeeks @yashveer_2024 thanks brother 🤗

[Asif Hashmi @BitDeveloper01]

🚀 Day 26 of #100xDsa 💻
Solved @LeetCode 437: Path Sum III

#approach :
〉Initialize ans, recursive pathFromOneNode, count paths. Call pathFromOneNode for each node. Return final count.

#100dayofcode #leetcode #binarytree