Problem-Solving-Training

Problem solving training for computer science students.

Level 1

This level simply consists of eight sheets, three of them on Codeforces OJ, plus four of them on HackerEarth OJ, and the last one on HackerRank OJ.

Prerequisites

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 - Strings).

Codeforces OJ sheets

Codeforces OJ sheets

The Codeforces OJ sheets codeforces - phase 1-1, codeforces - phase 1-2, codeforces - phase 1-3 contain A-Div2 problems, and each sheet of them divided into 5 classes of problems (Basic Operators - Conditions - Loops - Lists - Strings). These sheets were sorted based on difficulty and grouped by the type of problems as mentioned. Finally, each sheet contains ~100 problems.

Agenda of codeforces - phase 1-1 sheet (100 problems)

Category	Problems
Basic Operator	5 problems
Condition	10 problems
Loop	20 problems
String	20 problems
List	40 problems

Agenda of codeforces - phase 1-2 sheet (100 problems)

Category	Problems
Basic Operator	5 problems
Condition	10 problems
Loop	20 problems
String	20 problems
List	40 problems

Agenda of codeforces - phase 1-3 sheet (100 problems)

Category	Problems
Basic Operator	5 problems
Condition	10 problems
Loop	20 problems
String	20 problems
List	40 problems

HackerEarth OJ sheets

HackerEarth OJ sheets

The HackerEarth OJ sheets hackerearth - phase 1-1, hackerearth - phase 1-2, hackerearth - phase 1-3 contain implementation problems and basic programming problems. These sheets were sorted based on difficulty. Each sheet contains ~100 problems. For the last sheet hackerearth - phase 1-basic-programming that focus on the basic programming problems, It's divided into 4 classes of problems (Input/Output - Bit Manipulation - Recursion - Operators). Also, this sheet was sorted based on difficulty and grouped by the type of problems as mentioned. Finally, this sheet contains ~130 problems.

Agenda of hackerearth - phase 1-1 sheet (100 problems)

Category	Problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems

Agenda of hackerearth - phase 1-2 sheet (100 problems)

Category	Problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems

Agenda of hackerearth - phase 1-3 sheet (100 problems)

Category	Problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems
Implementation	25 problems

Agenda of hackerearth - phase 1-basic-programming sheet (130 problems)

Category	Problems
Input/Output	50 problems
Bit Manipulation	70 problems
Recursion	10 problems
Operators	5 problems

HackerRank OJ sheets

HackerRank OJ sheets

The HackerRank OJ sheet hackerrank - phase 1-functional-programming, It's divided into 6 classes of problems (Introduction - Recursion - Functional Structures - Memoization - Ad-Hoc - Misc). Also, this sheet was sorted based on difficulty and grouped by the type of problems as mentioned. Finally, this sheet contains ~80 problems.

Agenda of hackerrank - phase 1-functional-programming sheet (80 problems)

Category	Problems
Introduction	25 problems
Recursion	20 problems
Functional Structures	10 problems
Memoization	10 problems
Ad-Hoc	15 problems
Misc	5 problems

Notes

• If the student has a target to compete in the programming competitions like ACM-ICPC or Google Codejam or Google Kick-start or Facebook Hackercup, so it's recommended to start with Codeforces sheets, but if (s)he has a target to practice on a specific topic or preparing for an interview, so it's recommended to start with HackerEarth and HackerRank sheets.
• On each one of these sheets has an excel sheet to record your effort and enhance your progress, The time estimate for level problems is between 30 min to 45 min for each one, including reading time, thinking time, coding time, debugging time, and learning time.

Level 2

This level simply consists of eight sheets, four of them on Codeforces OJ, plus two of them on HackerEarth OJ, and the last two on HackerRank OJ.

Prerequisites

The prerequisites for level 2 of this training are the basic knowledge for Data Structures and Algorithms like (Linear Data Structures - Non-Linear Data Structures - Basics Algorithms - Mathematical Algorithms).

Codeforces OJ sheets

Codeforces OJ sheets

The Codeforces OJ sheets codeforces - phase 2-1, codeforces - phase 2-2, codeforces - phase 2-3 contain B-Div2 problems, and each sheet of them divided into 5 classes of problems (Data Structure - Mathematical - String - Greedy - Brute Force). These sheets were sorted based on difficulty and grouped by the type of problems as mentioned. Finally, each sheet contains ~90 problems.

Agenda of codeforces - phase 2-1 sheet (85 problems)

Category	Problems
Data Structure	15 problems
Mathematical	25 problems
String	15 problems
Greedy	25 problems
Brute Force	5 problems

Agenda of codeforces - phase 2-2 sheet (85 problems)

Category	Problems
Data Structure	15 problems
Mathematical	25 problems
String	15 problems
Greedy	25 problems
Brute Force	5 problems

Agenda of codeforces - phase 2-3 sheet (100 problems)

Category	Problems
Data Structure	25 problems
Mathematical	25 problems
String	25 problems
Greedy	25 problems
Brute Force	5 problems

Agenda of codeforces - phase 2-gym-contests sheet (100 problems)

Category	Problems
Educational Codeforces Rounds	80 problems
Codeforces GYM Contests *	5 problems
Codeforces GYM Contests **	15 problems

HackerEarth OJ sheets

HackerEarth OJ sheets

The HackerEarth OJ sheets hackerearth - phase 1-1, hackerearth - phase 1-2, hackerearth - phase 1-3 contain implementation problems and basic programming problems. These sheets were sorted based on difficulty. Each sheet contains ~100 problems. For the last sheet hackerearth - phase 1-basic-programming that focus on the basic programming problems, It's divided into 4 classes of problems (Input/Output - Bit Manipulation - Recursion - Operators). Also, this sheet was sorted based on difficulty and grouped by the type of problems as mentioned. Finally, this sheet contains ~130 problems.

Agenda of hackerearth - phase 2-linear-data-structures sheet (110 problems)

Category	Problems
Arrays 1D	65 problems
Arrays Multi-dimensional	20 problems
Stacks	25 problems
Queues	5 problems

Agenda of hackerearth - phase 2-non-linear-data-structures sheet (90 problems)

Category	Problems
Binary Tree	10 problems
Binary Search Tree	10 problems
Heaps / Priority Queues	20 problems
Hash Tables	50 problems

HackerRank OJ sheets

HackerRank OJ sheets

The HackerRank OJ sheet hackerrank - phase 1-functional-programming, It's divided into 6 classes of problems (Introduction - Recursion - Functional Structures - Memoization - Ad-Hoc - Misc). Also, this sheet was sorted based on difficulty and grouped by the type of problems as mentioned. Finally, this sheet contains ~80 problems.

Agenda of hackerrank - phase 2-data-structures sheet (110 problems)

Category	Problems
Arrays & Linked Lists	20 problems
Stacks & Queues	10 problems
Trees & Balanced Trees	20 problems
Heap & Disjoint Set & Trie	10 problems
Advanced	50 problems

Agenda of hackerrank - phase 2-mathematics sheet (140 problems)

Category	Problems
Fundamentals	20 problems
Number Theory	30 problems
Combinatorics	30 problems
Algebra	30 problems
Geometry	15 problems
Probability	15 problems

Notes

• If the student has a target to compete in the programming competitions like ACM-ICPC or Google Codejam or Google Kick-start or Facebook Hackercup, so it's recommended to start with Codeforces sheets, but if (s)he has a target to practice on a specific topic or preparing for an interview, so it's recommended to start with HackerEarth and HackerRank sheets.
• On each one of these sheets has an excel sheet to record your effort and enhance your progress, The time estimate for level problems is between 30 min to 45 min for each one, including reading time, thinking time, coding time, debugging time, and learning time.