Heaps in Interviews - Priority Queue Problems and Implementations
Implementations of four classic heap interview problems in Python, JavaScript, and TypeScript - Kth Largest, Top K Frequent, Find Median, and Merge K Sorted Lists.
Kishor Upadhyaya — Software engineer from Kathmandu, Nepal. I build scalable web apps and care about frontend architecture, performance, and developer experience.
Implementations of four classic heap interview problems in Python, JavaScript, and TypeScript - Kth Largest, Top K Frequent, Find Median, and Merge K Sorted Lists.
A hands-on guide to implementing LRU and LFU caches from scratch in Python, with the kind of clarity interviewers expect.
A comprehensive guide to the most asked DSA, machine coding, and system design interview questions, with tips on how to approach each one.
Comprehensive guide to ES14 features including enhanced array methods and shebang support for developers.
Guide to console methods including assert(), table(), and trace() for improved debugging.
Exploration of lesser-known JavaScript features including destructuring, spread operators, and optional chaining.
Flatten your deeply nested multi-dimentional array with this simple Javascript trick.
Remove duplicates from Javascript Array using Set, reduce, and filter methods.
Framework comparison highlighting Svelte and SvelteKit's lightweight design and performance advantages.