IEEEXtreme is a global challenge in which teams of IEEE Student members – advised and proctored by an IEEE member, and often supported by an IEEE Student Branch – compete in a 24-hour time span against each other to solve a set of programming problems. In this repository, you will find the Problemset and some Solutions of IEEEXtreme 12.0 .
In the Problemset folder, you will find the pdf version of the problems. To practice and get your score, try to solve the problems by yourself and submit your solutions, each title in the list below will take you to The CSAcademy practice session of the problem.
- Tree Fun
- Gotta ~ Catch 'Em All
- Make Distinct
- The Gold-diggers
- Organizational Chart
- Tweedledee's Split Brackets
- Troll Coder - Escape
- Friendly Sequences
- Tweedledum's Nested Brackets
- PIEEEXMan
- Troll Coder
- Bear Sums
- Lemons
- Drawing Rooted Binary Trees
- Telescope Scheduling
- Xplore
- Bit Soccer
- Xtreme Fake Coins
- Product Rectangle
- Barter System
- Magic Spell
- Barrett Reduction
- Infinite snakes and ladders
- Factorial Zeros
If a link doesn't get you the right challenge, open an issue, we will fix it !
Also, check the IEEEXtreme Practice Community where you will find all tasks of previous editions !
⭐ Starring the repo is also a contribution 😉 !
Please consider contributing accepted solutions or if you think your code could help the Open Source Community. If you are looking to contribute and it's the first time you do, this tutorial: First Contribution will help you !
Also, if a problem of IEEEXtreme 12.0 competition is not listed in this repository, consider contributing to it.
