Day 9/21 β DSA
Todayβs problem: Ceil in a BST.
A simple question taught me something important:
Don't always search everything. Use the structure youβre given.
My solution is basic, but I'm learning to recognize these patterns.
What DSA pattern are you learning?
Day 8/21 π
No new LeetCode problem today.
Today was about revising what Iβve learned so far and connecting with more people in tech.
Revising β Understanding β Building β Connecting.
Looking to connect with developers, engineers, students & fellow builders.
Day 7/21 β DSA π³
Solved: Search in a Binary Search Tree. New learning: BST property makes searching simple:
β key < root β go left
β key > root β go right
β Equal β found.
Instead of checking every node, each comparison eliminates half the search space.
Day 6/21 β DSA
Solved: Construct Binary Tree from Inorder & Postorder Traversal.
New learning:
β Postorder gives the root from the end
β HashMap gives the root's position in Inorder
β Inorder splits left & right subtrees
β Recursion builds the tree
Day 5/21 β DSA π³
Solved: Construct Binary Tree from Preorder & Inorder Traversal.
New learning:
β HashMap stores Inorder positions
β Preorder gives the root
β Inorder splits left & right subtrees
β Recursion builds the treePreorder + Inorder β Binary Tree π
Day 4/21 π
No LeetCode today.
Instead, I spent some time thinking about what I actually want to become as a developer.
Still learning & building:
β DSA with Java
β Full-stack
Still learning, still figuring things out.
If you're also learning/building in tech, let's connect.
Day 3/21 β DSA
π³Solved: Count Complete Tree Nodes
Key points:
β If left & right heights are equal, the tree is perfect
β Nodes = 2^h - 1
β Otherwise, recursively count nodes. Tree properties can turn brute force into an optimized solution.
Day 2/21 β DSA π³
Solved: Amount of Time for Binary Tree to Be Infected. Key idea:
β HashMap: Node β Parent
β BFS from the starting node
β Track visited nodesBinary Tree + HashMap + BFS = clean solution.
Learning the pattern, not just the problem.
Day 1/21 οΏ½οΏ½ DSA π
Solved: All Nodes Distance K in Binary Tree π³
Key insight:
β HashMap: Node β Parent
β Move Left, Right & Parent
β BFS to find nodes at distance K
β Visited set prevents revisiting
Learning the concept, not just solving the problem.
@NickpxJ I built my first project using Codex, which was a great learning experience. I would appreciate your feedback on what key additions or refinements are needed to make this project valuable and production-ready -
https://t.co/wCRoqwUeaV
Trying to grow my tech circle on X.
Iβm a 3rd-year CSE student learning DSA,full-stack development .
Looking to connect with developers, engineers, students, founders, recruiters, and fellow builders.
Letβs learn, build, share projects, and help each other grow.
Let's connect!
From "What's a Pull Request?" to 19 merged PRs.
That's what 3 months of Open Source taught me.
The biggest reward wasn't the rankβit was becoming a more confident developer.
π Just getting started.
#BuildInPublic#GitHub#Nsoc'26 #OpenSource