Algorithm Training Beginner Set

Open for everyone and designed for beginners, our algorithm sets continue with the Algorithm Training Beginner Set taking place from September 20, 12.00 to September 27, 12.00!

The first set, the Algorithm Training Intermediate Set is available here for practice and to give an idea of our sets. 

‘‘20 beginner level algorithm problems that every computer science student should solve before graduation’’

Algorithm Training Beginner Set is an educational material consisting of a total of 20 problems consisting of competitive programming, algorithms, and interview topics.

This set is suitable for everyone:

  • New to the algorithms and competitive programming world,

  • Want to practice basic algorithms and competitive programming topics

Includes:

  • Problems, 

  • Editorials, 

  • and Solution Videos

and aims at: 

  • Helping beginners to understand algorithms,

  • Providing advanced algorithm enthusiasts to practice themselves in basic algorithms and competitive programming,

  • Preparing students for technical interviews,

  • Preparing students for algorithm courses they will take during their studies,

  • Improving algorithm enthusiasts’ programming skills

Application Period

August 7 - September 17 until 17.00. 

The application period is closed.

Check out the video explaining “What is the Algorithm Training Beginner Set” by our dear Algorithm Team member Ekrem Bal:


WHICH COMPETITIVE PROGRAMMING PLATFORM?

algoleague is a competitive programming platform where algorithm enthusiasts of all levels practice their algorithmic thinking skills and compete in contests both in teams and individually. The platform is powered by inzva community and supported by BEV Foundation.

A community-driven project led by inzva, algoleague is now ready to provide all algorithm enthusiasts with a continuous learning experience consisting of long-lasting contents such as editorials, videos, discussion sessions, and contests.

Algorithm Training Beginner Set will be the first contest to be held on algoleague!

IMPORTANT NOTES

  • The set will begin on Monday, September 20, 12:00, and end on Monday, September 27, 12:00. It will consist of a total of 20 problems in one week. 

  • The first day starts on September 20 at 12:00 on algoleague. 

  • The set is open for everyone, if you are interested in joining and improving yourself, you are more than welcome to apply until the application deadline.

  • 3 problems will be asked in a day during the week except day 4. 2 problems will be asked on day 4. 

  • Prepared solution videos of the problems will be added to the YouTube channel after the last day. Subscribe button and the notification bell are waiting for you!

  • We would like to encourage full effort in upsolving as everyone’s schedule is different.

days And topics

Day 1: Implementation

Day 2:   Math, Recursion, Greedy

Day 3:   Implementation, Recursion, Sorting

Day 4:   Binary Search

Day 5:   Data Structures

Day 6:   Graph

Day 7:   Dynamic Programming


RULES

  • Each participant can join the set with only one ID. We are expecting all participants to solve the problems individually. It is forbidden to share any problems’ solutions or codes on any platform.

  • The problems will be prepared by inzva Algorithm Team and Algorithm Community Members. All rights are reserved by inzva and BEV Foundation. 

  • inzva Algorithm team will be able to change the set rules. If the rules are to be changed, they will be announced on the website and via mail. 

  • All participants must follow the set’s rules.


TECHNICAL PROFICIENCY

Programmers who are 

  • Comfortable with one of the following programming languages supported by algoleague: C, C#, C++, Python 2, Python 3, Java and Javascript,

  • Willing to start learning about common algorithms,

are welcome to attend this training set. Since this set will include basic problems about each algorithm, beginner-level algorithm knowledge could be useful as well. But don’t worry if you don’t feel comfortable with your algorithmic skills. Throughout this set, you will be provided with the required knowledge each day!

PRIZES

  • We will randomly distribute 100TL gift cards from the desired platform (Steam/Udemy/D&R, etc.) among the 10 participants who solved all problems of the set.

  • We will randomly distribute 50TL gift cards from the desired platform (Steam/Udemy/D&R, etc.) among the 5 participants who tried to solve all problems during the set.

Note: inzva reserves the right to change the prizes to other prizes of the same value at any point in time without prior notice.


OUR PROBLEM SETTERS AND TESTERS

Thank you all for your effort and enthusiasm!

FREQUENTLY ASKED QUESTIONS

See the FAQ here.

WISH TO PRACTICE BEFORE THE SET?

For newcomers, we suggest two free open materials that are available on our website and Github and one additional material:

Anyone who is into the world of algorithms can study these materials at a convenient time for themselves.


HOW TO BE AN EDITOR / PROBLEM SETTER

If you want to support the community as an editor/problem setter, and get a scholarship from BEV Foundation for your effort please contact us by sending an email to algorithm@inzva.com with the subject “Being an editor/a problem setter for inzva events”.

All participants have to abide by our CODE OF CONDUCT and LETTER OF CONSENT.

A BEV Foundation project inzva is a non-profit hacker community organizing study and project groups as well as camps in the fields of AI and Algorithm; and gathering CS students, academics and professionals in Turkey.

All personal data you shared in this form will solely be used to determine the participants of the event and to inform the venue provider, and will be deleted as soon as we carry out our legal obligations. Therefore, by sending this form, you accept having your personal data processed and transferred to third parties that are providing services for the event (i.e. venue and transportation providers).

Follow us on our social media accounts to have the most recent news about our upcoming events and programs!