A collection of my thoughts, ideas, and writings on various topics.

Detailed analysis and solution for LeetCode problem 3181: Max Total Reward, using dynamic programming and bitset optimization.
Heap Sort is an efficient, in-place sorting algorithm that utilizes the properties of a binary heap data structure to sort elements in O(n log n) time complexity.
Dynamic programming approach to find the longest palindromic substring in a given string.