Source Code

An adjacency matrix is a 2d array representing a graph. The nodes are the headings for the rows and columns ...

In mathematics expressions, there are infix, prefix and postfix notations. Infix notation is characterized by the placement of operators between ...

What is huffman coding? Huffman coding is an algorithm to generate the binary code based on the frequencies of corresponding ...

Autocomplete is a feature that search box returns the suggestions based on what you have typed. Autocomplete with trie provides ...

Web scraping is a great way to retrieve data and save the information. with a simple Java web scraping setup, ...

Dijkstra's algorithm is an algorithm to find the shortest paths between vertices in a graph. It uses greedy technique by ...

Get suggested friends is one of a coding question in social network applications. The data structures for social network is ...

An Euler path is a trail in a graph that visits every edge exactly once. Here we use graph data ...

The K closest problem is to find K closest points to the pointer(0,0) (it is called center or origin). The ...

Shortest path in matrix is to find the shortest distance from the the source to the destination. As you know, ...