Skip to content

Latest commit

 

History

History
253 lines (226 loc) · 13.2 KB

README.md

File metadata and controls

253 lines (226 loc) · 13.2 KB

Problem Solving Training - Level 1

Problem Solving Training for computer science students.






Table of Contents





Level 1

This level simply consists of 16 phases, 4 phases on HackerRank Online Judge, 4 phases on Codeforces Online Judge, 4 phases on HackerEarth Online Judge, 4 phases on AtCoder Online Judge.

The prerequisites for level 1 of this training are the basic knowledge for any programming language like (Variable Types - Basic Operators - Conditions - Loops - Functions - Lists/Arrays - Strings).


HackerRank OJ phases

The HackerRank OJ phases: [cpp], [python], [java], [linux-shell], each phase of them divided into (Introduction - Conditionals and Loops - Arrays and Strings - Functions Standard Libraries - Classes and Inheritance). In addition to the Linux Shell phase that contains (Bash - Text Processing - Arrays in Bash - Grep Sed Awk). These phases were ordered based on the problem difficulty and grouped by the problem topic. Finally, each phase contains ~70 problems.

cpp 70 problems python 100 problems
Introduction 20 problems Introduction 25 problems
Arrays and Strings 10 problems Collections 25 problems
Functions and Libraries 10 problems Functions and Libraries I 20 problems
Structs and Classes 15 problems Functions and Libraries II 20 problems
Implementation 15 problems Classes 10 problems
java 65 problems linux-shell 65 problems
Introduction 15 problems Bash 10 problems
Strings and BigNumber 15 problems Text Processing I 15 problems
Data Structures 15 problems Text Processing II 15 problems
Object Oriented Programming10 problems Arrays in Bash 10 problems
Advanced 10 problems Grep Sed Awk 15 problems


AtCoder OJ phases

The AtCoder OJ phases: [phase-1-1], [phase-1-2], [phase-1-3], [phase-1-4], These phases contain beginner contests (easy contests) and each phase contains ~135 problems.

phase-1-1 135 problems phase-1-2 135 problems
2016-2017 Beginner Contests20 problems 2016-2017 Beginner Contests20 problems
2018-2019 Beginner Contests30 problems 2018-2019 Beginner Contests30 problems
2020-2021 Beginner Contests35 problems 2020-2021 Beginner Contests35 problems
2022 Beginner Contests 25 problems 2022 Beginner Contests 25 problems
2023 Beginner Contests 25 problems 2023 Beginner Contests 25 problems
phase-1-3 135 problems phase-1-4 135 problems
2016-2017 Beginner Contests20 problems 2016-2017 Beginner Contests20 problems
2018-2019 Beginner Contests30 problems 2018-2019 Beginner Contests30 problems
2020-2021 Beginner Contests35 problems 2020-2021 Beginner Contests35 problems
2022 Beginner Contests 25 problems 2022 Beginner Contests 25 problems
2023 Beginner Contests 25 problems 2023 Beginner Contests 25 problems


Codeforces OJ phases

The Codeforces OJ phases: [phase-1-1], [phase-1-2], [phase-1-3], [phase-1-4], each phase of them contains A Div2 problems and divided into (Basic Operators - Conditions - Loops - Lists/Arrays - Strings). These phases were ordered based on the problem difficulty and grouped by the problem topic. Finally, each phase contains ~125 problems.

phase-1-1 125 problems phase-1-2 125 problems
Basic Operator 10 problems Basic Operator 10 problems
Condition 20 problems Condition 20 problems
Loop 25 problems Loop 25 problems
String 30 problems String 30 problems
List / Array I 20 problems List / Array I 20 problems
List / Array II20 problems List / Array II20 problems
phase-1-3 125 problems phase-1-4 125 problems
Basic Operator 10 problems Basic Operator 10 problems
Condition 20 problems Condition 20 problems
Loop 25 problems Loop 25 problems
String 30 problems String 30 problems
List / Array I 20 problems List / Array I 20 problems
List / Array II20 problems List / Array II20 problems


HackerEarth OJ phases

The HackerEarth OJ phases: [phase-1-1], [phase-1-2], [phase-1-3], [phase-1-4], each phase of them divided into (Input/Output - Bit Manipulation - Recursion - Operators). These phases were ordered based on the problem difficulty and grouped by the problem topic. Finally, each phase contains ~100 problems.

phase-1-1 100 problems phase-1-2 100 problems
Implementation25 problems Implementation25 problems
Implementation25 problems Implementation25 problems
Implementation25 problems Implementation25 problems
Implementation25 problems Implementation25 problems
phase-1-3 100 problems phase-1-4 125 problems
Implementation 25 problems Input / Output 40 problems
Implementation 25 problems Bit Manipulation40 problems
Implementation 25 problems Recursion 10 problems
Implementation 25 problems Operators 35 problems

Notes

  • The time estimate for level problems is between 30 min to 45 min for each problem, including reading time, thinking time, coding time, debugging time, and learning time, and you can say that the phase is done if you solved at least 30% of the phase problems, finally you can say that the level is done if you solved at least 6 phases.