He has recently secured an internship opportunity with Amazon. Anand is a Computer Science student at VIT Chennai (Batch 2017-21) & pursuing Data Structures & Algorithms with Java course at Coding Ninjas. Let’s take a look at how Anand got ...

Bridges in a graph are the edges which when removed makes the graph disconnected. In case of an undirected graph, the definition remains the same, i.e. a bridge is an edge which when removed increases the number of connected components. ...

Like Binary Search, Jump Search is a scanning calculation for arranged clusters. The fundamental thought is to check fewer components (than direct hunt) by hopping ahead by fixed advances or skirting a few components instead of looking through all components. ...

Algorithms are an essential part of today’s life. It helps ease down our tough calculations or processes. Floyd Warshall is also an Algorithm used in edge-weighted graphs. The basic use of Floyd Warshall is to calculate the shortest path between ...

Kadane’s algorithm is used for “Maximum subarray sum” in any given array of integers. Some of you may think it’ll be a sum of all elements of an array. There’ll be negative elements in the array which will decrease the ...

Floyd’s cycle-finding algorithm is a pointer algorithm that uses only two pointers, moving through the sequence at different speeds. It states the usage of Linked List in this algorithm and its output. The purpose is to determine whether the linked list ...

Depth-first search (DFS) is popularly known to be an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the basis node (selecting some arbitrary node because the root node within the case of a graph) ...

To put the elements in a particular order, sorting algorithms are used. The order can be anything from alphabetical to numerical, which can be ascending to descending. Consider a phone book directory, we may arrange the contacts on the basis ...

A maze is in the form of a 2D matrix in which some cells/blocks are blocked. One of the cells is termed as a source cell, from where we have to start. And another one of them is termed as ...

Binary search is the most widely used searching algorithm mostly in a sorted list. Its time complexity is O(long). Brute force way to search an element is searching through the entire list until the element is found. Let’s see the ...