## Traverse the given directory using BFS and DFS in Java

In this post, we will see how to traverse the given directory and list out all files present in it and all its sub-directories. Get great deals at Amazon

Coding made easy

In this post, we will see how to traverse the given directory and list out all files present in it and all its sub-directories. Get great deals at Amazon

Given a directed acyclic graph (DAG) and a source vertex, find the cost of shortest path from source vertex to all other vertices present in the graph. If vertex can’t be reached from given source vertex, printĀ its distance as infinity.

Given a graph, determine if given graph is bipartite graph using DFS. A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V.

Given a directed graph, check if it is strongly connected or not. A directed graphs is said to be strongly connected if every vertex is reachable from every other vertex.

Give a M x N binary matrix, replace all occurrences of 0 by 1 which are not completely surrounded by 1.

Flood fill (also known asĀ seed fill) is an algorithm that determines the area connected to a given node in a multi-dimensional array.

Given a M x N matrix of characters, find all occurrences of a given string in the matrix. We are allowed to search the string in all eight possible directions i.e. North, West, South, East, North-East, North-West, South-East, South-West. Note that there should not be any cycles in the output path.

Given a N x N matrix of positive integers, find a path from the first cell of the matrix to its last cell.

Given a huge set of strings with duplicate strings present, find first k-maximum occurring words in it.

Given a huge set of strings with duplicate strings present, find the maximum occurring word in it. If two words have same count, return any one of them.

Lexicographic sorting: Given a set of strings, print them in Lexicographic order (dictionary/alphabetical order).