The 30-week Algorithm Competition Programme 2018-2019, divided into Fall and Spring semesters, will include lectures, contests, problem-solvings and a variety of practises every saturday.
After our National Fall, Winter and Summer Camps, we prepared this full-fledged programme to last all year in order to grow the algorithm community in it’s technical capacity and ready the students for international contests.
The participants are expected to not only have the skills, but also the enthusiasm and motivation for this unique event, which will be completely free of charge.The programme will involve experienced editors to lecture the attendees, problem setters to prepare problems every week and reviewers to check their technical accuracy. There will be a minimum requirement of %80 for attendance.
Following the successful competitive programming communities in Romania, Bulgaria, Russia, Philippines and more, we strive to be a community that is eager to learn; where every member helps the other and the learners can also teach with the experienced.
Aside from meeting at inzva every saturday, we will keep in touch via the discord channel of the community.
DATE & LOCATION
Every Saturday, total of 30 days spread over 30 weeks.
Week 1: September 29 Saturday / Week 30: May 25 Saturday/ inzva - Beykoz Kundura
MOTIVATION
We believe that the main benefit comes from the opportunity to practice with challenging problems. Here are some other benefits we think the participants will acquire from the camp:
- Motivating yourself to improve your knowledge on a subject
- Assessing yourself
- Coding more efficient
- Advanced knowledge of data structures and algorithms
- Learning teamwork and critical thinking
- Getting to know ICPC World better
- Technical adequacy and preparation for interviews
- The chance to be broadcasted as an Editor/Problem Setter/Reviewer or Attendee on inzva’s page.
Those with %80+ attendance will have a certificate on Linkedin, GitHub and inzva.com as a graduate of this program, and those with proved success will be able to join our upcoming international summer camp directly.
TECHNICAL PROFICIENCY
All participants are expected to know a programming language well. Attendees must prepare their own programming environment (computer, IDE, compiler etc.). The whole practice process will run on HackerRank
You can find the curriculum here
The top three students will get prizes on the final contest day at the end of the year-long program. We will also have various surprises for those who make it to the top of the leaderboards with weekly contests. Provided, it’s about learning, teaching and sharing; not winning.
FREQUENTLY ASKED QUESTIONS
See the FAQ here.
HOW TO BE AN EDITOR/PROBLEM SETTER/REVIEWER
If you want to support the community as an Editor, Problem Setter or Reviewer, and get scholarship for your work by BEV Foundation, you can find more information and application form via the links below.
EDITOR
Prepares the content for the week and lecture at inzva physically. Read more
PROBLEM SETTER
Prepares two contests consisting of 5 and 10 questions according to the lectures prepared by the editor. Read more
REVIEWER
Reviews the content prepared by the editor and the problem setter, making sure it follows the guideline and curriculum. Read more
We are proud to be founding a community together that will last years to come. With your support and contribution, we hope to be a sharing computer programming community for your generation and after.
BUNDLES
| Name | Topics |
|---|---|
| 01-Intro | Big O Notation, Recursion, Builtin Data Structures |
| 02-Algorithms-1 | Sorting Algorithms, Search Algorithms |
| 03-Math-1 | Number Theory, Factorization, Combinatorics, Exponentiation |
| 04-Graph-1 | Representing Graphs, Tree Traversals, Binary Search Tree, DFS, BFS, Union Find, Heap |
| 05-DP-1 | Greedy Algorithms, Memoization, Common DP Problems |
| 06-Data-Structures-1 | Stack, Queue, Deque, Linked List, Prefix Sum, Sparse Table, BIT, SQRT Decomposition, Segment Tree |
| 07-Graph-2 | Bipartate Checking, Topoligical Sort, Shortest Path, Minimum Spanning Tree |
| 08-Data-Structures-2 | Self Balancing Binary Trees, Lowest Common Ancestor in a Tree |
| 09-Data-Structures-3 | Segment Tree with Lazy Propogation, Binary Search on Segment Tree, Mo's Algorithm, Trie |
| 10-DP-2/ | Bitmask DP, DP on Rooted Trees, DP on DAGs, Digit DP, Tree Child-Sibling Notation |
| 11-Graph-3 | Bridges and Articulation Points, SCC, BCC, Max Flow |
| 12-Math-3 | Vector Calculus, Area Calculation, Lines and Planes, Intersection, Convex Hull Problem, Rotating Calipers, Closest Pair Problem |
| 13-graph-5 | Segment Tree on a Tree, Heavy-Light Decomposition, Centroid Decomposition of a Tree, Subtrees' Set-Swap Technique |
| 14-Algorithms-5 | KMP, Robin-Karp Algorithm, Suffix Array, Longest Common Prefix Array |
All Contests List
Algorithm Program 2019-2020
| Name | Topic |
|---|---|
| Intro #1 | Recursion, Brute-force |
| Intro #2 | Binary Search, Ternary Search, Sorting Algorithms |
| Math-1 #1 | Sieve of Eratosthenes, Modular Arithmetic, GCD, Factorization Algorithms |
| Math-1 #2 | Combination, Meet in the Middle, Enumeration |
| Contest #1 | All of the Above |
| Graph-1 #1 | Graph Definitions, Representing Graph |
| Graph-1 #2 | DFS, BFS |
| Graph-2 #1 | Heap, Priority-Queue, Dijkstra, Bellman-Ford (Shortest Path) |
| Graph-2 #2 | Union Find, Kruskal's Algorithm, Prim's Algorithm (MST) |
| Contest #2 | All of the Above |
| DP #1 | Coin Problem, LIS, Knapsack Problems |
| DP #2 | Edit Distance, Counting Tilings Problem, Counting the number of solutions |
| DS-1 #1 | Stack, Queue, Deque, Prefix Sum, Sparse Table |
| DS-1 #2 | Segment Tree, Lazy Propagation |
| Graph-3 #1 | LCA, SCC |
| Strings | KMP, Robin Karp, Trie |
Winter Camp 2020 - Foundation
| Name | Topic |
|---|---|
| Day #1 | Sieve of Eratosthenes, Brute-Force, Enumeration, Binary Search, Ternary Search |
| Day #2 | DFS, BFS |
| Day #3 | Priority Queue, Shortest Path, MST |
| Day #4 | Coin Problem, LIS, Knapsack Problems, LCS |
| Final | All of the Above |
Algorithm Competition League #1
| Name | Topic |
|---|---|
| Contest #1 | No Specific Topic |
| Contest #2 | No Specific Topic |
| Contest #3 | No Specific Topic |
| Contest #4 | No Specific Topic |
| Contest #5 | No Specific Topic |
| Contest #6 | No Specific Topic |
| Contest #7 | No Specific Topic |
| Contest #8 | No Specific Topic |
| Contest #9 | No Specific Topic |
| Contest #10 | No Specific Topic |