Dependency Injection
A simple program demonstrating the example and use of Dependency Injection (Constructor-Dependency-Injection-Method).
Continue ReadingWelcome to my blog!
Wanna learn DSA and Algos ? having a hard time finding different algorithms, then this is the place for you
A perfect place to learn and explore DataStructures and Algorithms altogether at one place.
Featured Algo's
Here are some of the important Algorithms you might definitely want to know.
-
-
Depth First Search (DFS- Traversal)
Depth First Algorithm is a Traversal Algorithm used in Trees and Graphs, Both has similar Implementation, with a slight change i.e. Graphs may contain cycles unlike trees
Continue Reading -
Breadth First Search (BFS- Traversal)
Breath First Algorithm is a Traversal Algorithm used in Trees and Graphs, Both has similar Implementation, with a slight change i.e. Graphs may contain cycles unlike trees
Continue Reading -
Binary Search Algorithm
Binary search is a most efficient and important algorithm which searches for the target element in a limited space in a sorted workspace, but either in strictly increasing or strictly decreasing workspace only, using Decease and conquer Algo.
Continue Reading -
Floyd's Cycle Detection Algorithm
Floyd’s cycle finding algorithm or Hare-Tortoise algorithm is a pointer algorithm that uses only two pointers, moving through the sequence at different speeds. This algorithm is used to find a loop in a linked list. It uses two pointers one moving twice as fast as the other one. The faster one is called the faster pointer and the other one is called the slow pointer.
Continue Reading -
Kadane's Algorithm
The simple idea of Kadane’s algorithm is to look for all positive contiguous segments of the array (max_ending_here is used for this). And keep track of maximum sum contiguous segment among all positive segments (max_so_far is used for this).
Continue Reading