<NumeroVibe Destiny/>
Type your name, DOB, and what you’re stuck on — it replies with a personalized numerology report in seconds.
Stack: React + TypeScript + Vite + Tailwind + GPT + Pabbly
Trying to build tools people actually enjoy using.
🔗 https://t.co/FFzlq8kG7y
#AI#LLM
Another small milestone
Just earned the LeetCode 100 Days Badge 2026 for solving problems consistently this year.
Trying to show up every day, learn something new, and get a little better at problem solving. The journey continues
#LeetCode#DSA#CodingJourney#ProblemSolving
Sharing a small update
Participated in Google Big Code 2026
→ Top 15k (Qualifier)
→ Top 1.5k (Round 1)
→ Reached Round 2
Didn’t make finals this time, but learned a lot about problem-solving and handling pressure.
Will come back stronger.
#Google#GoogleBigCode#DSA#CP
Day 185 ✅
Solved Find Kth Bit in Nth Binary String using recursion.
Used the pattern: Sₙ = Sₙ₋₁ + "1" +
reverse(invert(Sₙ₋₁)).Checked middle index, recursed on left half, or mirrored and inverted for right half.
#LeetCode#DSA#Java#Recursion#ProblemSolving
Day 182 ✅
Solved Concatenation of Consecutive Binary Numbers.
Used bit shifting to append each number’s binary form and applied modulo at every step to avoid overflow.
Also received DCC February 2026 badge 🏅
#LeetCode#Java#DSA#Consistency
Day 180 ✅
Solved Number of Steps to Reduce a Number in Binary Representation to One.
Instead of converting the binary string to a big integer, I simulated the process from right to left.Logic I used:
180-day streak going strong 💪
#LeetCode#DSA#Java#BitManipulation
Got my 50 Days Badge 2026 on LeetCode 🎯
50+ days of consistently solving problems this year.
From struggling with basic patterns to now comfortably applying binary search, sliding window, DFS, and DP where needed.
#LeetCode#DSA#ProblemSolving#Java#CodingJourney
Balanced Binary Tree ✅
(Day 162)Solved today’s LeetCode using DFS.
Calculated height of left and right subtrees and returned -1 early if the difference > 1.
This bottom-up approach avoids repeated traversal and keeps it O(n).
#LeetCode#DSA#Java#BinaryTree#CodingJourney
Solved today’s LeetCode Daily ✅ (Minimum Removals to Balance Array)
Approach:
Sorted the array first, then used two pointers to find the longest valid window where
max ≤ min × k.
O(n log n) | Java 💻
#LeetCode#DSA#Java#SlidingWindow#CodingJourney
LeetCode Daily done!🔥
Solved Minimum Cost Path with Edge Reversals — a graph problem using Dijkstra with a smart twist on reversed edges.
Building an augmented graph made the logic click fast.
Streak hits 150 days
#LeetCode#DSA#Graphs#Java#DailyChallenge#CodingJourney
🧩 LeetCode Daily done —
Minimum Pair Removal to Sort Array
Solved it by simulating the process: always merge the adjacent pair with the smallest sum until the array becomes non-decreasing.
Used a LinkedList to handle merges cleanly.
Streak: 145 days 🔥
#LeetCode#DSA#Java