eklavya singh
151 posts


today i deploy that project which contain backend and frontend both, which is my first full stack project which is very basic, it helps me know about authentication & authorization, JWT, APIs, file structure and also wrote frontend with react
project:expenses-tracker-sand-eight.vercel.app
English

just completed the work, which i've been working on,today i fix bugs and created the dashboard,where user can see there expenses,delete it,also create new expense,
for fetching i used Axios, for database i used mongoDB
you can check my work from github
github.com/codewitheklavy…

English

today i start creating a Employee management system:
using react
authentication: login
store data in local storage because its a only frontend project.......
you can track from my github:
github: github.com/codewitheklavy…
English

@denicmarko Yes, I'm excited to join the Community of developers. Waiting for an invite
English

24 hour hackathon No sleep. (10–11 Apr)
HackHorizon 2.0 — We made Top 30/180
Built: Medicine Access Platform
Compare meds | AI assist | Find doctors
click here and share experience
link: dynamic-devs-three.vercel.app
github: github.com/codewitheklavy…
#hackathon
English

@N_and_ni you should check also sheryians coding school (sarthak sharma) for react
English

🚀 Day 72 of #100DaysOfCode
🧩 Solved LeetCode 455 – Assign Cookies
Used a simple greedy approach: sort kids' greed + cookie sizes, then match the smallest valid cookie to each child. Clean and efficient in C++!
#LeetCode #CPlusPlus #GreedyAlgorithm #CodeWithEklavya 🚀🔥

English

🚀 Day 71 of #100DaysOfCode
Solved LeetCode 62 – Unique Paths
Practiced grid DP today:
dp[i][j] = dp[i-1][j] + dp[i][j-1]
Also tried the combinatorics shortcut for an O(1) solution.
Feeling stronger with DP patterns! 💪🔥
#LeetCode #CPlusPlus #DP #CodeWithEklavya

English

🚀 Day 70 of #100DaysOfCode
🧩 Solved LeetCode 2363 – Merge Similar Items
Merged two item lists by combining weights of identical values using a simple map<int,int> approach.
Sorted output comes naturally since map keeps keys ordered. Clean and efficient solution!
#leetcode

English

Day 69/100 – LeetCode 139 (Word Break)
Solved this using DP + unordered_set.
Used a dp[i] array to check if each prefix of the string can be formed using dictionary words.
Clean logic, solid pattern for string DP. 💡
On to the next! 🚀
#100DaysOfCode #LeetCode #CPP #DP

English

🚀 Day 68 of #100DaysOfCode
Solved LeetCode 414 – Third Maximum Number
Tracked top 3 distinct values in a single pass.
Key learnings:
• Handle duplicates smartly
• Maintain first, second & third max
💻 C++
On to the next! 🚀
#DSA #CPP #LeetCode #CodeWithEklavya

English

🚀 Day 67 of #100DaysOfCode
🧩 Solved LeetCode 33 – Search in Rotated Sorted Array
Learned to use modified binary search to identify the sorted half + shrink the search space smartly.
Rotated arrays aren’t scary anymore 😄💡
#100DaysOfCode #LeetCode #CodingJourney #Cpp

English





