I’m constantly inspired by the fast-paced world of technology and love diving into new tools and frameworks that push the boundaries of what’s possible. Whether I’m learning something new or building creative solutions, I’m passionate about bringing fresh ideas to life and sharing what I discover with others. Let’s build something amazing together! 🚀
I'm an Early 🐤
🌞 Morning 3653 commits ██████░░░░░░░░░░░░░░░░░░░ 23.34 %
🌆 Daytime 4521 commits ███████░░░░░░░░░░░░░░░░░░ 28.88 %
🌃 Evening 4844 commits ████████░░░░░░░░░░░░░░░░░ 30.95 %
🌙 Night 2635 commits ████░░░░░░░░░░░░░░░░░░░░░ 16.83 %
📅 I'm Most Productive on Wednesday
Monday 2014 commits ███░░░░░░░░░░░░░░░░░░░░░░ 12.87 %
Tuesday 2049 commits ███░░░░░░░░░░░░░░░░░░░░░░ 13.09 %
Wednesday 2639 commits ████░░░░░░░░░░░░░░░░░░░░░ 16.86 %
Thursday 2195 commits ████░░░░░░░░░░░░░░░░░░░░░ 14.02 %
Friday 2541 commits ████░░░░░░░░░░░░░░░░░░░░░ 16.23 %
Saturday 2321 commits ████░░░░░░░░░░░░░░░░░░░░░ 14.83 %
Sunday 1894 commits ███░░░░░░░░░░░░░░░░░░░░░░ 12.10 %
📊 This Week I Spent My Time On
💬 Programming Languages:
TypeScript 19 hrs 53 mins █████████░░░░░░░░░░░░░░░░ 36.53 %
PHP 14 hrs 48 mins ███████░░░░░░░░░░░░░░░░░░ 27.20 %
JavaScript 9 hrs 24 mins ████░░░░░░░░░░░░░░░░░░░░░ 17.27 %
Blade Template 7 hrs 22 mins ███░░░░░░░░░░░░░░░░░░░░░░ 13.55 %
JSON 53 mins ░░░░░░░░░░░░░░░░░░░░░░░░░ 01.65 %
🔥 Editors:
Zed 54 hrs 25 mins █████████████████████████ 100.00 %
💻 Operating System:
Linux 54 hrs 25 mins █████████████████████████ 100.00 %
I Mostly Code in JavaScript
JavaScript 32 repos █████░░░░░░░░░░░░░░░░░░░░ 21.48 %
PHP 21 repos ████░░░░░░░░░░░░░░░░░░░░░ 14.09 %
TypeScript 21 repos ████░░░░░░░░░░░░░░░░░░░░░ 14.09 %
HTML 17 repos ███░░░░░░░░░░░░░░░░░░░░░░ 11.41 %
Python 4 repos █░░░░░░░░░░░░░░░░░░░░░░░░ 02.68 %
// This snippet shows how to use Python's "walrus operator" inside a list comprehension for compactness
# It reads a list of integers and filters those whose squared value is > 10, computing square only once
nums = [1, 2, 3, 4, 5]
result = [sq for x in nums if (sq := x*x) > 10]
print(result) # Output: [16, 25]Write a function in Python that takes a list of integers and returns the length of the longest subsequence where the difference between adjacent elements is exactly 1. Consider negative numbers and duplicates. Example: input [1, 2, 2, 3, 4] -> output 4 (subsequence: [1,2,3,4])
- Submit a PR to answer.
The Fastest, The Lightest and The Tightest android web browser.
Website: melvinjonesrepol.com/webvium-browser
AI Driven blog spot about technology, businesses and related topics.
*website: projectdeep.vercel.app
Monitor your coding activity, create custom leaderboards, and compete with your team or the community.
DevPulse brings WakaTime stats into a sleek, collaborative leaderboard experience.
Website: devpulse-olive.vercel.app
A browser extension that provides a floating console for developers to easily access logs while browsing the web.
Website: melvinjonesrepol.com/floating-console-extension
The only shortlink you will ever need. Simple, lightweight and utilize Redis for transactions.
Website: go.melvinjonesrepol.com
If you have an idea, let's make that idea come true! From development, production to deployment. We can do that.