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 3056 commits ██████░░░░░░░░░░░░░░░░░░░ 22.75 %
🌆 Daytime 3905 commits ███████░░░░░░░░░░░░░░░░░░ 29.07 %
🌃 Evening 4141 commits ████████░░░░░░░░░░░░░░░░░ 30.83 %
🌙 Night 2331 commits ████░░░░░░░░░░░░░░░░░░░░░ 17.35 %
📅 I'm Most Productive on Wednesday
Monday 1744 commits ███░░░░░░░░░░░░░░░░░░░░░░ 12.98 %
Tuesday 1700 commits ███░░░░░░░░░░░░░░░░░░░░░░ 12.66 %
Wednesday 2285 commits ████░░░░░░░░░░░░░░░░░░░░░ 17.01 %
Thursday 1868 commits ███░░░░░░░░░░░░░░░░░░░░░░ 13.91 %
Friday 2176 commits ████░░░░░░░░░░░░░░░░░░░░░ 16.20 %
Saturday 1994 commits ████░░░░░░░░░░░░░░░░░░░░░ 14.84 %
Sunday 1666 commits ███░░░░░░░░░░░░░░░░░░░░░░ 12.40 %
📊 This Week I Spent My Time On
💬 Programming Languages:
TypeScript 8 hrs 5 mins ████████░░░░░░░░░░░░░░░░░ 31.23 %
PHP 6 hrs 30 mins ██████░░░░░░░░░░░░░░░░░░░ 25.16 %
JavaScript 2 hrs 51 mins ███░░░░░░░░░░░░░░░░░░░░░░ 11.05 %
GraphQL 2 hrs 33 mins ██░░░░░░░░░░░░░░░░░░░░░░░ 09.86 %
Blade Template 1 hr 30 mins █░░░░░░░░░░░░░░░░░░░░░░░░ 05.85 %
🔥 Editors:
Zed 23 hrs 46 mins ███████████████████████░░ 91.85 %
Android Studio 2 hrs 6 mins ██░░░░░░░░░░░░░░░░░░░░░░░ 08.15 %
💻 Operating System:
Linux 25 hrs 53 mins █████████████████████████ 100.00 %
I Mostly Code in JavaScript
JavaScript 32 repos ██████░░░░░░░░░░░░░░░░░░░ 22.22 %
TypeScript 19 repos ███░░░░░░░░░░░░░░░░░░░░░░ 13.19 %
HTML 16 repos ███░░░░░░░░░░░░░░░░░░░░░░ 11.11 %
Rust 3 repos █░░░░░░░░░░░░░░░░░░░░░░░░ 02.08 %
Kotlin 3 repos █░░░░░░░░░░░░░░░░░░░░░░░░ 02.08 %
// Negative indexing for Arrays in JavaScript using Proxy:
// Access arr[-1] for the last item, arr[-2] for the second-to-last, etc., without mutating the array.
function withNegativeIndex(array) {
return new Proxy(array, {
get(target, prop, receiver) {
// If the property looks like an integer index (possibly negative)
if (typeof prop === 'string' && /^-?d+$/.test(prop)) {
let i = Number(prop);
if (i < 0) i = target.length + i;
return Reflect.get(target, i, receiver);
}
return Reflect.get(target, prop, receiver);
}
});
}
// Demo:
const letters = withNegativeIndex(['a', 'b', 'c', 'd']);
console.log(letters[-1]); // 'd'
console.log(letters[-2]); // 'c'
console.log(letters[0], letters[1]); // 'a' 'b'JavaScript (Node): Implement securePassphrase(words, n) that returns an object { passphrase, entropyBits } by selecting n words uniformly at random without modulo bias using only the built-in crypto module (no external libs). Calculate entropy as n * log2(words.length). In comments, briefly explain how you avoid modulo bias (e.g., rejection sampling with crypto.randomBytes/randomInt) and how you would handle very large word lists efficiently.
- Submit a PR to answer.