K-99: Ninety-Nine Kotlin Problems

#81

P81 - Path between nodes.

#82

P82 - Cycles from a node.

#83

P83 - Spanning trees.

#84

P84 - Minimum spanning tree.

#85

P85 - Graph isomorphism.

#86

#87

#88

P88 - Connected components.

#89

P89 - Bipartite graphs.

#90

P90 - Eight queens.

#91

P91 - Knight's tour.

#93

P93 - An arithmetic puzzle.

#94

P94 - Regular graphs with N nodes.

#95

P95 - English number words.

#96

P96 - Conway's Game of Life.

#97

P97 - Sudoku.

#98

P98 - Nonograms.

#99

P99 - Crossword puzzle.