In this blog post we will have a look at fast I/O methods for competitive programming in C++, Java and Python. Continue reading
Tag Archives: Java
Dijkstra’s algorithm – Part 4b (Java implementation)
This is the continuation of Part 3b. Here we will finally implement Dijkstra’s algorithm in Java. Continue reading
Dijkstra’s algorithm – Part 3b (Priority Queue in Java)
This is the continuation of Part 2b. Here we will have a look at the priority queue in Java. Continue reading
Dijkstra’s algorithm – Part 2b (Graph implementation in Java)
This is the continuation of Part 1. Here we will have a look at the implementation of the graph as a dictionary (hash table) in Java. Continue reading
Form the adjacency matrix and adjacency lists from the edges
In this blog post I will describe how to form the adjacency matrix and adjacency list representation if a list of all edges is given. Continue reading
Depth First Search – Java and Python implementation
1. Depth First Search – Graph example
In this blog post we will have a look at the Depth First Search (DFS) algorithm in Java. Continue reading
Adjacency list representation of a graph (Python, Java)
1. Adjacency list representation – Example
Here, I will talk about the adjacency list representation of a graph. Continue reading
Determine distribution of elements in a list
Suppose you are given a list of names, and for each name you shall determine the number of occurrences in that list. Continue reading
Sorting arrays in Java for competitive programming
Abstract
I will describe how to avoid a TLE (timelimit exceeded) in competitive programming when sorting an array in Java. Continue reading
How to split Strings in Java
Abstract
I will describe how to split a string in Java using the split() method. Continue reading
Programming, algorithms and data structures 