-
# Papers
- [x] [On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy](http://www.genetic-programming.org/sp2003/Hochmuth.pdf)
- [ ] [Small Populations Over Many Generations Can Beat Large Popu…
-
Source code could be read from `~/.cargo/registry/src/github.com-xxx/{crate_name}-{version}`.
This would enable easily using libraries such as [`competitive-programming-rs`](https://crates.io/crates/…
-
### Description
Explanation:
i will code for the left view of binay tree.
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I follow [Contribu…
-
### Description
In this, we will get a brief idea about Count Sort
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I follow [Contributing Gui…
-
### Description
The use and importance of fast I/O methods in CP
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I follow [Contributing Guide…
-
Since I have moved my competitive programming directories and other stuff to another repo so I want to get this readme updated. So it's a good first issue so please contribute.
-
### Description
Topic wise selected questions with easy medium and hard level from gfg
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I fol…
-
### Description
Both Algorithm and code will be explained with the help of documentation.
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I f…
-
**Write code in the preferred language and attach output with it.**
You are given the arrival and leaving times of n customers in a restaurant.
What was the maximum number of customers in the re…
-
### Description
A problem of Code Chef which gives you the Algo-Magic of problem.
### Domain
Competitive Programming
### Type of Contribution
Documentation
### Code of Conduct
- [X] I follow [C…