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.
The Archive of
Intentional Thought
Technical essays, architectural deep-dives, and practical guides at the intersection of code and design.
Page 24 of 30
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.
Index for Coding Problems
Master index of all coding problems covered on GyanByte — sorted by category: sorting, data structures, trees, graphs, arrays, strings, and LeetCode solutions.
What is Heap Data Structure
What a heap data structure is, how it's stored as an array, and the difference between max-heap and min-heap properties with parent-child index math.
Principles of Software Designing
Core software design principles — encapsulation, programming to interfaces, composition over inheritance, and SOLID — with practical examples.
Python 3 - Magical Methods and Tricks with extremely useful methods
A collection of useful Python 3 tricks and magical methods for writing concise and elegant code.