Skip to content

Ilyes-Origamist/IEEEXtreme-ENP

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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:

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:

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published