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 11.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.
- Knin
- Elementary
- Lion Territory
- King Capture
- Pyramid
- Maximum Sum
- Mister Counter
- Sub Array Sum Problem
- Odd Cycle Check
- Game of Life
- Jarawi and The Interview
- The Fast and the Curious
- Quipu Function
- Math Challenge
- Collecting Gold
- Orienteering
- Preparing for Xtreme 12.0
- Fill The Pixels
- Octopuses with Watches
- Shuffle
- Let’s Cheer Up Bob
- Gotta Catch 'Em All
- RecXor
- BeetleBag
- Aeneas' cryptographic disc (4th c. B.C.)
- Rumour
- Fibonacci
- Running Up Stairs
- Vangelis the Batbear and the Bubbles challenge
- Blackgate Penitentiary
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 11.0 competition is not listed in this repository, consider contributing to it.
