Docker taught me an important DevOps lesson:
If the container is running,
don't ask why. ๐ณ
Just deploy it before it changes its mind. ๐
#Docker#DevOps#DevOpsLife#Containers
Locked in at the hackathon ๐ป Building a full-stack ERP with Next.js & TypeScript and it's actually coming together ๐ APIs hitting, dashboard loading, no major bugs... yet ๐ Let's finish strong ๐ช๐ฅ
#Hackathon#NextJS#BuildInPublic
Spent the evening going through Chai aur Code's TypeScript series.
The deeper I get into TS, the more I realize it's not just about types. Concepts like "unknown", type inference, and generics change how you think about JavaScript.
#TypeScript#JavaScript#buildinpublic
Day 72 / 100 โ Graph (DFS)
Solved:
โข Detect Cycles in 2D Grid
Used DFS with parent tracking to detect cycles in same-character regions. Key idea was avoiding revisiting the immediate previous cell while still catching real loops.
#100DaysOfCode#LeetCode#DSA ๐
Day 71 / 100 โ Linked List + Math
Solved:
โข Double a Number Represented as a Linked List
Reversed the list, handled digit-wise multiplication with carry, then rebuilt the answer. Classic simulation with clean pointer work.
#100DaysOfCode#LeetCode#DSA ๐
Day 70 / 100 โ Linked List + Greedy
Solved:
โข Partition List
โข Furthest Point From Origin
Small problems, but nice clarity in approach.
#100DaysOfCode#LeetCode#DSA ๐
Day 69 / 100 โ Stack + Linked List
Solved:
โข Add Two Numbers II
Used stacks to reverse traversal and handle carry while building the result list โ clean and efficient approach.
#100DaysOfCode#LeetCode#DSA ๐
Day 68 / 100 โ Greedy + Simulation
Solved:
โข Minimum Pair Removal to Sort Array
Repeatedly removed the minimum-sum adjacent pair until the array became sorted โ straightforward simulation with a greedy touch.
#100DaysOfCode#LeetCode#DSA ๐
Day 67 / 100 โ Trees
Solved:
โข Leaf-Similar Trees
Collected leaf nodes using DFS and compared sequences โ simple idea but neat execution.
#100DaysOfCode#LeetCode#DSA
Day 66 / 100 โ Trees
Solved:
โข Delete Leaves With a Given Value
Used post-order recursion to remove target leaf nodes step-by-step. Nice little edge-case handling problem.
#100DaysOfCode#LeetCode#DSA
Day 65 / 100 โ Trees
Solved:
โข Merge Two Binary Trees
Used recursion to merge nodes and sum overlapping values. Clean and straightforward problem.
#100DaysOfCode#LeetCode#DSA
Day 63 / 100 โ Trees
Solved:
โข Increasing Order Search Tree
Used inorder traversal to rearrange nodes into a right-skewed tree.
#100DaysOfCode#LeetCode#DSA