{ Full Stack - ML, DL, GenAI }
Engineering related stuff.
A heap is a tree-based data structure that satisfies the heap property, where the key of the parent node is either greater than or equal to (in a max-heap) or less than or equal to (in a min-heap) the key of its children. Heaps are often used to impl...

K-means clustering is an unsupervised machine learning algorithm used to divide a dataset into a pre-defined number of distinct, non-overlapping subgroups known as clusters. The goal is to group data points in such a way that points within the same c...

A Trie, also known as a prefix tree or digital tree, is an advanced tree-like data structure used for efficiently storing and searching strings. The name Trie comes from the word "retrieval," highlighting its ability to quickly find or retrieve data....
