[Kenchon book to Python] "Train your problem-solving skills! Algorithms and data structures" I tried to rewrite the posted code in Python! -table of contents-
Introduction
Kenchon-san, which has posted many easy-to-understand and interesting articles about algorithms and competitive programming on Qiita, has published a book! Congratulations! !! !! !!
** Train problem-solving skills! Algorithm and data structure **
Kenchon book Amazon site
This book is easy to understand and enjoyable to read, with abundant diagrams, explanations, and examples of algorithms and data structures. As a sluggish competition professional er who participates in AtCoder, which has been becoming more difficult in recent years, I definitely want to wear the algorithm of this book! I thought so, but it's a waste to just copy sutras and scan them normally. Therefore, I decided to rewrite the posted code to the Python I usually use. We will publish it as a reminder and maintain motivation. I hope it will be of some help to you!
This is the first Qiita article, so please forgive me if there are any points that are difficult to read. We would be grateful if you could point out bugs, give us your opinions, and give us advice (if possible, kindly)!
table of contents
Chapter 1
No code
Chapter 2
https://qiita.com/KevinST/items/cb926022777d2b0f3cfd
Chapter 3
https://qiita.com/KevinST/items/4d04dc7369880670a63b
Chapter 4
https://qiita.com/KevinST/items/f846d57e56242c6e1293
The following article has not been created. We will update it as it progresses!
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Other Remarks
――Basically, it is assumed that you read ** while looking at Kenchon-san's book ** -It does not describe the end-of-chapter problem (and I may write an article if requested) --Created in the following environment: Python3.7.4 (Anaconda), Windows10, Pycharm ――The test cases are basically taken from the Kencho book, but some of the test cases that are not mentioned are made by myself. ――I sometimes post supplements. I would be grateful if you could refer to it if you like.