Java Notes | Abstract class & Multi-level Inheritance
Each child class in the hierarchy is responsible for implementing abstract methods that have not been implemented by its superclasses.
Bellman-Ford Algorithm | Single source shortest path
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 | Single source shortest path
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 | Code Implementation
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 | Selection Algorithm
“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.
Non-decreasing Subsequences Solution – LeetCode Solution [Medium]
Given an integer array nums, return all the different possible non-decreasing subsequences of the given array with at least two elements.
Is Subsequence – LeetCode Solution [Easy]
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
LRU (Least Recently Used) Cache | Algorithm & Implementation
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.
Data Structures for Disjoint Sets | Union Find Algorithm
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.
What is a Bipartite Graph?
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.