Can't believe I was consistent for almost 25 days in a month since I started posting.I might not have reached great amount of people and gained a lot a of followers but I learnt more in past 25 days than I have in whole year. Discipline truly pays off.
#Consistency#LearnInPublic
@Rushu_Tushu Just missed a single day from the year start to now. And it was because I ran the POTD solution but forgot to press the submit button π₯²
@DevCoderX I made the same fucking mistake. 3rd was pretty easy and all three could be solved under 25 minutes most probably but I made the mistake of going on 4th first which destroyed an hour
@Divyansh91565 Amazing bro I too started with graphs day before yesterday. I am too trying to push rating on lc but it will take time to give enough contests.
Striver DSA Sheet @takeUforward_
Covered graph concepts yesterday & solved probs based on DFS/BFS today
-01 Matrix
-Surrounded Regions
-Number of Enclave
-Number of Island
-Word Ladder I/II
Problems used multisource bfs & some required dfs with additional logic
#TUFWinterArc#DSA
Leetcode POTD 1266
It was a easy geometry question. I tried brute force first then moved onto using optimal.
But question got me thinking what if points need not be traversed in the order given and could be traversed in any order such time is minimized.
#LeetCode#leetcodepotd
Striver DSA Sheet @takeUforward_
Practiced 4 more questions from BST. Code part was easy but intuition felt a bit tricky. Tried out all possible diff methods
- Kth smallest/largest
- check for valid BST
- LCA
- Construct BST using preorder
#TUFWinterArc#DSA#LearningInPublic
Striver DSA Sheet @takeUforward_
Started with BST. Covered some fundamental concepts and questions
Covered following topics today
- Property of BST
- Searching in BST
- Min/Max in BST
- Ceil/Floor in BST
- Insertion in BST
- Deletion in BST
#DSA#TUFWinterArc#LearnInPublic
Leetcode POTD
First calculated total sum of BT. After that implemented postorder DFS traversal to calculate subtree sum at each node. Using that found maximum product by subtreeSum*(totalSum-subtreeSum). Time Complexity is O(n) due to traversing all nodes.
#LeetCode#leetcodepotd
Striver DSA Sheet @takeUforward_
Binary Trees has almost come to an end so will be starting with BST tomorrow
Covered following topics today
- Construct BT using Inorder & Postorder
- Serialize & Deserialize BT
- Morris Traversal (Inorder & Preorder)
#DSA#TUFWinterArc