This repo is intended to be a shared practice place for beginners from ENP, to become familiar with competitive programming and participate in IEEEXtreme.
It is needed to learn the basics of DSA and algorithms design paradigms. This repo may guide you to get started.
You can practice for IEEEXtreme on CS Academy or Leet Code.
Find previous IEEEXtreme problems on: IEEEXtreme Practice
You can also prepare for it by:
- Solving problems of similar style on: CS Academy
- Solving problems on: Leet Code
It is important to:
- Learn basic data structures used to solve problems in programming. You can find some lessons on CS Academy: CS Academy - Lessons
- Learn algorithm design paradigms like: recursion, dynamic programming (tabulation, memoization..), greedy algorithms, divide and conquer, backtracking, graph algorithms, bitwise..etc.
The website "Geeks For Geeks" contains many courses, explained algorithms and solved problems. Links:
Data Structures
Algorithms
DSA
Below is a list of repositories that contain problems and their solutions of previous IEEEXtreme contests:
- IEEEXtreme 10.0 - 15.0 from IEEE ENSIAS Student Branch,
- IEEEXtreme 16.0
- IEEEXtreme 17.0