EPAM Mexico Algorithms study group.
- We have defined a learning path combining some books (listed at the bottom) to follow.
- Every Monday, a problem will be presented, according to the next topic listed in the learning path.
- A volunteer will be the owner of the topic, and will be responsible of defining the problem and the theoretical background.
- Developers will have the whole week to study the topic and to solve the problem with the most optimal solution.
- As a Developer, you should create your own branch from master repository
$ git checkout -b <my-branch-name> - Use your branch to commit your solutions, in the format/language you prefer.
- Next week, the topic owner will present the most optimal solution and the link between problem and theory.
- Any of the participants can present better/innovative solution, but as requisite it needs to be pushed into participant branch.
- An assigned moderator per week will help to have smooth conversation and topic discussions.
- After this, a new set topic will be presented according to the learning path.
Each topic will have the following convention: ##_<Topic>, having ## = topic number.
Example: 00_BigO for Big(O) Notation.
Inside the topic folder, on master branch the following files will be placed:
- A markdown file (.md) containing the problem instructions, called README.md.
- A set of .in and .out files, containing sample test cases (optional).
- A markdown file containing some of the theoretical background (optional).
To update the branch, with the new problems, use: $ git rebase -p origin/master
Participants are free to use the programming language they want.
| # | topic | date | owner | moderator |
|---|---|---|---|---|
| 00 | Big(O) Notation | Nov 21 | Christian Velázquez | Francisco Jauregui |
| 01 | Arrays | Nov 28 | Francisco Jauregui | Emmanuel García |
| 02 | HashTables | Dec 05 | Emmanuel García | Ernesto Espinosa |
| 03 | Resizable Arrays | Dec 12 | Ernesto Espinosa | Sinuhé Jaime |
| 04 | Linked List | Dec 19 | Sinuhe Jaime | Ernesto Espinosa |
| 05 | Queues | Jan 09 | Oscar Legorreta | Sinuhe Jaime |
| 06 | Stacks | Jan 16 | Luis Pool | Oscar Legorreta |
| 07 | Recursion | Jan 23 | Daniel Vega | Emmanuel Garcia |
| 08 | Memory Complexity | Jan 30 | Christian Velazquez | Ernesto Espinosa |
| 09 | Sorting Intro | Feb 06 | Ernesto Espinosa | Miriam Lee |
| 10 | Elementary Sorting | Feb 13 | Miriam Lee | Ernesto Espinosa |
| 11 | Merge Sort | Feb 20 | Ernesto Espinosa | Luis Gerardo Garcia |
| 12 | Quick Sort | Feb 27 | Eduardo Hernandez | Christian Velazquez |
| 13 | Heap Sort | Mar 06 | Rafael Benitez | Eduardo Hernandez |
| 14 | Linear Sorting | Mar 13 | Luis Gerardo Garcia | Mayra Monreal |
| 15 | Trees Introduction | Mar 20 | Mayra Monreal | Ivan Hernandez |
| 16 | Binary Trees | Mar 27 | Ulises Mancilla | Hugo Vega |
| 17 | Balanced Trees | Apr 10 | Ivan Hernandez | Alberto Chacon |
| 18 | Graph Introduction | Apr 17 | Ernesto Espinosa | Ulises Mancilla |
| 19 | Kruskal Algorithm | Apr 24 | Hugo Vega | Daniel Pedraza |
| 20 | DFS/BFS on Graphs | May 02 | Daniel Pedraza | Victor Parra |
| 21 | Dynamic Programming | May 08 | Victor Parra | Dionicio Rodriguez |
| 22 | Shortest Paths | May 15 | Dionicio Rodriguez | Orlando Cano |
| 23 | A* Algorithm | May 22 | Orlando Cano | Jossue Loubet |
To be defined.
- Data Structures and Algorithms Visualizations - https://www.cs.usfca.edu/~galles/visualization/Algorithms.html