Implementation of Timeit function, Get performance numbers for a function
How to implement a timeit decorator in Python to measure and log method execution times for performance analysis.
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 21 of 28
React JS router not working on Nginx docker container
How to fix React JS BrowserRouter routes returning 404 on Nginx in a Docker container.
Add two numbers(reverse order) link list Problem - Leet Code Solution
LeetCode "Add Two Numbers" (reverse-order linked lists) solved by traversing both lists and tracking carry, with full code walkthrough.
Radix Sort Algorithm
Learn Radix Sort — a non-comparison algorithm that sorts numbers digit by digit using counting sort as a stable sub-routine, in Java.
Counting Sort Algorithm
Learn Counting Sort — a non-comparison O(n+k) sorting algorithm that places elements directly into position using prefix sums, in Java.
Young Tableau problem - Cormen
Implementing Young Tableau operations — extract-min, insert, and search — on a row-and-column sorted matrix, from Cormen's CLRS exercises.
Min Priority Queue Implementation with Heap Data structure
Implementing a Min Priority Queue using a min-heap with insert, extract-min, and decrease-key operations in Java.
Max Priority Queue Implementation with Heap Data structure
Implementing a Max Priority Queue using a max-heap with insert, extract-max, and increase-key operations in Java.
Visual Studio Code - How to associate file extension to a known programming language
How to associate custom file extensions with a known programming language in Visual Studio Code.
Two Sum Problem - Leet Code Solution
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Java - Union and Intersection of two lists
How to compute the union and intersection of two Java lists using collection utility methods.
Heap Sort Algorithm
Learn Heap Sort — build a max-heap, then repeatedly extract the maximum element and restore the heap property. Includes Java code and complexity analysis.