Kruskal’s algorithm is one of the popular algorithms used to find an MST in a connected weighted graph. This algorithm is efficient, easy to understand, and guarantees the construction of a minimum-weight spanning tree.
This algorithm uses Relaxation, to find the shortest path between the source vertex and other vertices. It gradually expands the search space until the shortest path to the destination node is found.
Dijkstra’s algorithm works based on the principle of Greedy-approach, gradually expanding the search space until the shortest path to the destination node is found.
Nim’s game is played with a set of heaps, each containing a certain number of objects or stones. Two players take turns removing objects from the heaps
“Order Statistics” is a concept discussed in the book “Introduction to Algorithms”. It pertains to finding the ith order statistics of a set of n elements in linear time. ith order statistics is the ith smallest element in a set of n elements.
LRU (Least Recently Used) Cache is a type of cache replacement algorithm, where the least recently used item is evicted when the cache is full.
This data structure is useful in situations where we need to group items together based on certain criteria, and then perform operations on these groups.
A Bipartite Graph is a graph whose vertices can be divided into two sets such that no two vertices within the same set are adjacent.
An ORM, or object-relational mapping, is a programming technique that allows a software application to access and manipulate a database.
Dynamic content refers to website content that changes based on user input or other factors. This can include things like personalised recommendations or customised display.