Algorithm Training Set

Algorithm Training Set is a series that gives you a good opportunity to practice with important questions at that level of difficulty or topic found in the algoleague.

The sets will be accessible to anyone who would like to improve themselves in competitive programming, even after the contest is concluded.

Training sets INCLUDES:

  • Problems

  • Editorials 

  • Solution Videos

AND AIMS TO: 

  • provide students who are new to algorithms and competitive programming with a starting point for basic and important algorithm questions on related topics,

  • provide a set of problems related to the topic for the enthusiasts  to refresh their knowledge of the topic or brush up on their skills,

  • provide programmers with a possible way to improve their problem-solving skills, algorithmic thinking, and efficient coding skills.

Special thanks to our Algorithm Team and our Algorithm community who prepared and tested the problems for their great effort and enthusiasm.

What have we done so far?

  • Fundamentals of Interview Problems is a comprehensive contest designed to enhance problem-solving skills, boost confidence, and provide a thorough understanding of interview preparation strategies.

    It is a contest of 30 problems that includes a diverse range of challenges spanning various difficulty levels, from easy to difficult. Through systematic engagement with this set of problems, candidates can strengthen their abilities and approach interviews with greater readiness and competence.

    If you want to solve the problems in the set, you can find it here.

  • Algorithm Training Beginner Set is an educational material consisting of a total of 20 problems consisting of competitive programming, algorithms, and interview topics. It is especially suitable for those new to the algorithms and competitive programming world.

    The Beginner set also includes solution videos.

    If you want to solve the questions in the set, you can find it here.

  • Algorithm Training Intermediate Set consists of a total of 20 problems that cover competitive programming, academic, and interview topics, and is the first algorithm-oriented educational material. It is suitable for everyone who is into the world of algorithm competitions, newcomers and competitors alike.

    In addition to the problems, the set includes solution videos.

    If you want to solve the problems in the set, you can find it here.

  • We have compiled short, subject-oriented training videos from the topics covered in the Algorithm Program and prepared the first Turkish algorithm video series. This is a series of short videos with key topic-based information.

    If you want to solve the problems in the set, you can find it here. You can watch the videos for the lectures about the problems at any time.

  • Dynamic programming is both a mathematical optimization and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.

    Building on the foundations of our initial set, Dynamic Programming #1, this new edition delves deeper into advanced concepts and techniques, challenging learners with more complex problems.

    The Dynamic Programming #2 is a contest of 26 problems that cover more advanced competitive programming, academic, and interview topics.

    If you want to solve the problems in the set, you can find it here.

  • Data Structures are essential components in computer science, serving as frameworks to organize and store data for efficient processing. Examples include arrays, linked lists, stacks, queues, trees, and hash tables. These structures are foundational to algorithm design, enabling quick and effective data manipulation. Mastery of data structures is crucial for creating efficient and scalable software solutions tailored to specific computational tasks.

    Data Structures #1 is a contest of 23 problems. It is suitable for anyone who wants to challenge themselves in data structures.

    You don’t need to worry if you don’t have knowledge of data structures. In the set, there are many problems from simple to complex. After you complete the set, you will feel competent about the topic.

    If you want to solve the problems in the set, you can find it here.

  • Graph theory is a field of study that focuses on graphs, mathematical structures representing connections between objects. It explores the relationships and connections between various elements. Graphs serve as powerful tools for modeling and analyzing pairwise relations in different disciplines.

    Graph #1 is a contest of 30 problems that cover competitive programming, academic, and interview topics. It is suitable for anyone who wants to challenge themselves in Graph.

    When you complete this set which has different levels of problems from easy to difficult, you will have a knowledge of graph theory in depth. 

    If you want to solve the problems in the set, you can find it here.

  • #NiceToMathYou is a contest consisting of 16 fundamental math problems of different levels from easy to difficult.

    When you complete this set of problems, you will have an in-depth knowledge of algorithmic math.

    If you want to solve the problems in the set, you can find it here.

  • Dynamic Programming is both a mathematical optimization and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.

    The Dynamic Programming #1 is a contest of 30 problems that cover competitive programming, academic, and interview topics. It is suitable for anyone who wants to challenge themselves in dynamic programming.

    If you want to solve the problems in the set, you can find it here.

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 contact@algoleague.com with the subject “Being an editor/a problem setter”. 

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.

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