Coder Social home page Coder Social logo

problem-solving-training's Introduction

Problem Solving Training

Problem Solving Training for computer science students.









Table of Contents


Level 1

This level simply consists of 18 sheets, 6 sheets on URI Online Judge, 2 sheets on HackerRank Online Judge, 2 sheets on AtCoder Online Judge, 4 sheets on Codeforces Online Judge, and the last 4 sheets on HackerEarth Online Judge.

Prerequisite Knowledge

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). Related Training: Programming Languages and Object Oriented Training

Level Timeline
Phase 1.1 - 175 problems in 2 weeks Phase 1.2 - 175 problems in 2 weeks Phase 1.3 - 175 problems in 2 weeks Phase 1.4 - 175 problems in 2 weeks Phase 1.5 - 175 problems in 2 weeks Phase 1.6 - 175 problems in 2 weeks
Phase c/c++ - 70 problems in 2 weeks Phase python - 100 problems in 2 weeks Phase 1.1 - 90 problems in 2 weeks Phase 1.2 - 90 problems in 2 weeks Phase 1.1 - 120 problems in 2 weeks Phase 1.2 - 120 problems in 2 weeks
Phase 1.3 - 120 problems in 2 weeks Phase 1.4 - 120 problems in 2 weeks Phase 1.1 - 100 problems in 2 weeks Phase 1.2 - 100 problems in 2 weeks Phase 1.3 - 100 problems in 2 weeks Phase 1.4 - 100 problems in 2 weeks



URI OJ sheets

The URI OJ sheets: phase-1-1, phase-1-2, phase-1-3, phase-1-4, phase-1-5, phase-1-6 each sheet of them divided into 6 classes of problems (Beginner - Ad-Hoc - Strings - Data Structures - Mathematics - Geometry). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~175 problems.

phase-1-1 175 problems phase-1-2 175 problems
Beginner 45 problemssolutions Beginner 45 problemssolutions
Ad-Hoc I 40 problemssolutions Ad-Hoc I 40 problemssolutions
Ad-Hoc II 35 problemssolutions Ad-Hoc II 35 problemssolutions
Strings 10 problemssolutions Strings 10 problemssolutions
Data Structures15 problemssolutions Data Structures15 problemssolutions
Mathematics 25 problemssolutions Mathematics 25 problemssolutions
Geometry 5 problemssolutions Geometry 5 problemssolutions
phase-1-3 175 problems phase-1-4 175 problems
Beginner 45 problemssolutions Beginner 45 problemssolutions
Ad-Hoc I 40 problemssolutions Ad-Hoc I 40 problemssolutions
Ad-Hoc II 35 problemssolutions Ad-Hoc II 35 problemssolutions
Strings 10 problemssolutions Strings 10 problemssolutions
Data Structures15 problemssolutions Data Structures15 problemssolutions
Mathematics 25 problemssolutions Mathematics 25 problemssolutions
Geometry 5 problemssolutions Geometry 5 problemssolutions
phase-1-5 175 problems phase-1-6 165 problems
Beginner 45 problemssolutions Beginner 35 problemssolutions
Ad-Hoc I 40 problemssolutions Ad-Hoc I 40 problemssolutions
Ad-Hoc II 35 problemssolutions Ad-Hoc II 35 problemssolutions
Strings 10 problemssolutions Strings 10 problemssolutions
Data Structures15 problemssolutions Data Structures15 problemssolutions
Mathematics 25 problemssolutions Mathematics 25 problemssolutions
Geometry 5 problemssolutions Geometry 5 problemssolutions


HackerRank OJ sheets

The HackerRank OJ sheets: phase-1-cpp This sheet focus on c/c++ basic problems, It's divided into 7 classes of problems (Introduction - Conditionals and Loops - Arrays and Strings - Functions - Standard Template Libraries - Structs and Enums - Classes and Inheritance). It was ordered based on the problem difficulty and grouped by the problem type. Finally, this sheet contains ~70 problems. phase-1-python This sheet focus on python basic problems, It's divided into 6 classes of problems (Introduction - Basic Data Types - Collections - Functions - Standard Libraries - Classes). It was ordered based on the problem difficulty and grouped by the problem type. Finally, this sheet contains ~100 problems.

cpp 70 problems python 100 problems
Introduction 15 problemssolutions Introduction 5 problemssolutions
Conditionals and Loops 5 problemssolutions Basic Data Types 20 problemssolutions
Arrays and Strings 10 problemssolutions Collections 30 problemssolutions
Functions 5 problemssolutions Functions 10 problemssolutions
Standard Template Libraries 5 problemssolutions Standard Libraries 25 problemssolutions
Structs and Classes 30 problemssolutions Classes 10 problemssolutions


AtCoder OJ sheets

The AtCoder OJ sheets: phase-1-1, phase-1-2, These sheets focus on beginner contests (easy contests) and each sheet contains ~90 problems.

phase-1-1 90 problems phase-1-2 90 problems
2016-2017 Beginner Contests20 problemssolutions 2016-2017 Beginner Contests20 problemssolutions
2018-2019 Beginner Contests30 problemssolutions 2018-2019 Beginner Contests30 problemssolutions
2020-2021 Beginner Contests40 problemssolutions 2020-2021 Beginner Contests40 problemssolutions


Codeforces OJ sheets

The Codeforces OJ sheets: phase-1-1, phase-1-2, phase-1-3, phase-1-4 contain A-Div2 problems, and each sheet of them divided into 5 classes of problems (Basic Operators - Conditions - Loops - Lists/Arrays - Strings). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~120 problems.

phase-1-1 140 problems phase-1-2 120 problems
Basic Operator15 problemssolutions Basic Operator10 problemssolutions
Condition 15 problemssolutions Condition 15 problemssolutions
Loop 35 problemssolutions Loop 20 problemssolutions
String 35 problemssolutions String 30 problemssolutions
List / Array 40 problemssolutions List / Array 40 problemssolutions
phase-1-3 120 problems phase-1-4 120 problems
Basic Operator 5 problemssolutions Basic Operator 5 problemssolutions
Condition 20 problemssolutions Condition 20 problemssolutions
Loop 25 problemssolutions Loop 20 problemssolutions
String 30 problemssolutions String 30 problemssolutions
List / Array 40 problemssolutions List / Array 45 problemssolutions


HackerEarth OJ sheets

The HackerEarth OJ sheets: phase-1-1, phase-1-2, phase-1-3, phase-1-4 contain implementation problems and basic programming problems. These sheets were ordered based on difficulty. Each sheet contains ~100 problems. It's divided into 4 classes of problems (Input/Output - Bit Manipulation - Recursion - Operators).

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

Notes

  • If the student has a target to compete in the programming competitions like ACM-ICPC or Google CodeJam or Google KickStart or Facebook Hackercup or TopCoder Open TCO, so it's recommended to start with Codeforces sheets, TopCoder sheets, Spoj sheets, UVa sheets, and AtCoder 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 sheets, HackerRank sheets, URI sheets, and LeetCode 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 problem, including reading time, thinking time, coding time, debugging time, and learning time.

Level 2

This level simply consists of 28 sheets, 6 sheets on URI Online Judge, 2 sheets on HackerRank Online Judge, 2 sheets on AtCoder Online Judge, 8 sheets on Codeforces Online Judge, 6 sheets on LeetCode Online Judge, and the last 4 sheets on HackerEarth Online Judge.

Prerequisite Knowledge

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 - Searching Algorithms - Sorting Algorithms - Divide and Conquer). Related Training: Data Structures and Algorithms Training

Level Timeline
Phase 2.1 - 160 problems in 2 weeks Phase 2.2 - 160 problems in 2 weeks Phase 2.3 - 160 problems in 2 weeks Phase 2.4 - 160 problems in 2 weeks Phase 2.5 - 160 problems in 2 weeks Phase 2.6 - 160 problems in 2 weeks
Phase data structures - 120 problems in 2 weeks Phase algorithms basics - 120 problems in 2 weeks Phase 2.1 - 90 problems in 2 weeks Phase 2.2 - 90 problems in 2 weeks Phase 2.1 - 120 problems in 2 weeks Phase 2.2 - 120 problems in 2 weeks
Phase 2.3 - 120 problems in 2 weeks Phase 2.4 - 120 problems in 2 weeks Phase 2.1 - 190 problems in 2 weeks Phase 2.2 - 190 problems in 2 weeks Phase 2.3 - 190 problems in 2 weeks Phase 2.4 - 190 problems in 2 weeks
Phase 2.5 - 190 problems in 2 weeks Phase 2.6 - 190 problems in 2 weeks Phase linear data structures - 100 problems in 2 weeks Phase non linear data structures - 100 problems in 2 weeks Phase algorithms searching - 100 problems in 2 weeks Phase algorithms sorting - 100 problems in 2 weeks



URI OJ sheets

The URI OJ sheets: phase-2-1, phase-2-2, phase-2-3, phase-2-4, phase-2-5, phase-2-6 each sheet of them divided into 7 classes of problems (Ad-Hoc - Strings - Data Structures - Mathematics - Graph - Paradigms - Geometry). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~160 problems.

phase-2-1 160 problems phase-2-2 160 problems
Ad-Hoc 25 problemssolutions Ad-Hoc 25 problemssolutions
Strings 15 problemssolutions Strings 15 problemssolutions
Data Structures15 problemssolutions Data Structures15 problemssolutions
Mathematics 20 problemssolutions Mathematics 20 problemssolutions
Graph 40 problemssolutions Graph 40 problemssolutions
Paradigms 35 problemssolutions Paradigms 35 problemssolutions
Geometry 10 problemssolutions Geometry 10 problemssolutions
phase-2-3 160 problems phase-2-4 160 problems
Ad-Hoc 25 problemssolutions Ad-Hoc 25 problemssolutions
Strings 15 problemssolutions Strings 15 problemssolutions
Data Structures15 problemssolutions Data Structures15 problemssolutions
Mathematics 20 problemssolutions Mathematics 20 problemssolutions
Graph 40 problemssolutions Graph 40 problemssolutions
Paradigms 35 problemssolutions Paradigms 35 problemssolutions
Geometry 10 problemssolutions Geometry 10 problemssolutions
phase-2-5 125 problems phase-2-6 125 problems
Ad-Hoc 15 problemssolutions Ad-Hoc 15 problemssolutions
Strings 10 problemssolutions Strings 10 problemssolutions
Data Structures10 problemssolutions Data Structures10 problemssolutions
Mathematics 10 problemssolutions Mathematics 10 problemssolutions
Graph 50 problemssolutions Graph 50 problemssolutions
Paradigms 25 problemssolutions Paradigms 25 problemssolutions
Geometry 5 problemssolutions Geometry 5 problemssolutions


HackerRank OJ sheets

The HackerRank OJ sheets: phase-2-data-structures, phase-2-algorithms-basics, These sheets contain linear and non-linear data structures problems plus advanced data structures problems, and basic algorithms problems. These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~120 problems.

data-structures 120 problems algorithms-basics 120 problems
Arrays & Linked Lists 20 problemssolutions Warm-up & Recursion 20 problemssolutions
Stacks & Queues 10 problemssolutions Sorting 15 problemssolutions
Trees & Balanced Trees 25 problemssolutions Search 25 problemssolutions
Heap & Disjoint Set & Trie10 problemssolutions Implementation I 30 problemssolutions
Advanced 50 problemssolutions Implementation II 30 problemssolutions


AtCoder OJ sheets

The AtCoder OJ sheets: phase-2-1, phase-2-2, These sheets focus on beginner contests (easy contests) and each sheet contains ~90 problems.

phase-2-1 90 problems phase-2-2 90 problems
2016-2017 Beginner Contests20 problemssolutions 2016-2017 Beginner Contests20 problemssolutions
2018-2019 Beginner Contests30 problemssolutions 2018-2019 Beginner Contests30 problemssolutions
2020-2021 Beginner Contests40 problemssolutions 2020-2021 Beginner Contests40 problemssolutions


Codeforces OJ sheets

The Codeforces OJ sheets: phase-2-1, phase-2-2, phase-2-3, phase-2-4 contain B-Div2 problems, and each sheet of them divided into 5 classes of problems (Data Structure - Mathematics - String - Greedy - Brute Force). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~120 problems. For the last 4 sheets phase-2-div3-contests that focus on div3-contests (easy contests) and contains ~100 contests, and phase-2-educational-contests, that focus on educational-contests (medium contests) and contains ~100 contests. Finally phase-2-gym-contests-1, phase-2-gym-contests-2 that focus on gym-contests that contains ~200 contests.

phase-2-1 120 problems phase-2-2 130 problems
Data Structure10 problemssolutions Data Structure20 problemssolutions
String 40 problemssolutions String 25 problemssolutions
Mathematics 25 problemssolutions Mathematics 35 problemssolutions
Greedy 30 problemssolutions Greedy 35 problemssolutions
Brute Force 15 problemssolutions Brute Force 15 problemssolutions
phase-2-3 105 problems phase-2-4 145 problems
Data Structure30 problemssolutions Data Structure30 problemssolutions
String 5 problemssolutions String 30 problemssolutions
Mathematics 35 problemssolutions Mathematics 40 problemssolutions
Greedy 25 problemssolutions Greedy 30 problemssolutions
Brute Force 10 problemssolutions Brute Force 15 problemssolutions
phase-2-div3-contests 100 contests phase-2-educational-contests 100 contests
Div3 Contests I 20 Contestssolutions Educational Rounds I 20 Contestssolutions
Div3 Contests II 20 Contestssolutions Educational Rounds II 20 Contestssolutions
Div3 Contests III20 Contestssolutions Educational Rounds III20 Contestssolutions
Div3 Contests IV 20 Contestssolutions Educational Rounds IV 20 Contestssolutions
Div3 Contests V 20 Contestssolutions Educational Rounds V 20 Contestssolutions
phase-2-gym-contests-1 115 contests phase-2-gym-contests-2 110 contests
GYM Contests 2 15 Contestssolutions GYM Contests 2 10 Contestssolutions
GYM Contests 3 I 25 Contestssolutions GYM Contests 3 I 25 Contestssolutions
GYM Contests 3 II 25 Contestssolutions GYM Contests 3 II 25 Contestssolutions
GYM Contests 3 III25 Contestssolutions GYM Contests 3 III25 Contestssolutions
GYM Contests 3 IV 25 Contestssolutions GYM Contests 3 IV 25 Contestssolutions


LeetCode OJ sheets

The LeetCode OJ sheets: phase-2-1, phase-2-2, phase-2-3, phase-2-4, phase-2-5, phase-2-6 contain linear and non-linear data structures problems, searching and sorting algorithms, and each sheet of them divided into 6 classes of problems (Array - LinkedList - Stack - Queue - Binary Tree - Heap Tree - HashTable) in addition to (Binary Search - Sorting - Divide and Conquer - Greedy - Bit Manipulation). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~190 problems.

phase-2-1 200 problems phase-2-2 210 problems
Array I 40 problemssolutions Array I 50 problemssolutions
Array II 40 problemssolutions Array II 50 problemssolutions
Array III 40 problemssolutions Array III 50 problemssolutions
Linked List 10 problemssolutions Linked List 30 problemssolutions
Stack 50 problemssolutions Stack 10 problemssolutions
Queue and Dequeue20 problemssolutions Queue and Dequeue20 problemssolutions
phase-2-3 170 problems phase-2-4 180 problems
Recursion 30 problemssolutions Binary Tree I 30 problemssolutions
Binary Tree 30 problemssolutions Binary Tree II 30 problemssolutions
Heap Tree 30 problemssolutions Binary Tree III30 problemssolutions
Hash Table I 30 problemssolutions Heap Tree 30 problemssolutions
Hash Table II 30 problemssolutions Hash Table I 30 problemssolutions
Hash Table III 20 problemssolutions Hash Table II 30 problemssolutions
phase-2-5 190 problems phase-2-6 200 problems
Binary Search I 35 problemssolutions Binary Search 30 problemssolutions
Binary Search II 35 problemssolutions Greedy I 40 problemssolutions
Divide and Conquer 20 problemssolutions Greedy II 40 problemssolutions
Sorting I 40 problemssolutions Greedy III 40 problemssolutions
Sorting II 40 problemssolutions Bit Manipulation I 25 problemssolutions
Greedy 20 problemssolutions Bit Manipulation II25 problemssolutions


HackerEarth OJ sheets

The HackerEarth OJ sheets: phase-2-linear-data-structures, phase-2-non-linear-data-structures, phase-2-algorithms-searching, phase-2-algorithms-sorting, Each sheet contains linear and non-linear data structures problems, in addition to searching and sorting algorithms. These sheets were ordered based on the problem difficulty and each sheet contains ~100 problems.

linear-data-structures 110 problems non-linear-data-structures 90 problems
Arrays 1D 45 problemssolutions Binary Tree 10 problemssolutions
Arrays Multi-dimensional40 problemssolutions Binary Search Tree 10 problemssolutions
Stacks 25 problemssolutions Heaps / Priority Queues 20 problemssolutions
Queues 5 problemssolutions Hash Tables 50 problemssolutions
algorithms-searching 120 problems algorithms-sorting 140 problems
Linear Search 15 problemssolutions Bubble, Selection, Insertion, Merge40 problemssolutions
Binary Search I 50 problemssolutions Quick, Count, Heap 20 problemssolutions
Binary Search II 50 problemssolutions Greedy Algorithms I 40 problemssolutions
Ternary Search 5 problemssolutions Greedy Algorithms II 40 problemssolutions

Notes

  • If the student has a target to compete in the programming competitions like ACM-ICPC or Google CodeJam or Google KickStart or Facebook Hackercup or TopCoder Open TCO, so it's recommended to start with Codeforces sheets, TopCoder sheets, Spoj sheets, UVa sheets, and AtCoder 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 sheets, HackerRank sheets, URI sheets, and LeetCode 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 problem, including reading time, thinking time, coding time, debugging time, and learning time.

Level 3

This level simply consists of 28 sheets, 4 sheets on HackerRank Online Judge, 8 sheets on Codeforces Online Judge, 4 sheets on AtCoder Online Judge, 4 sheets on LeetCode Online Judge, and the last 8 sheets on HackerEarth Online Judge.

Prerequisite Knowledge

The prerequisites for level 3 of this training are the advanced knowledge for Data Structures and Algorithms Analysis like (Disjoint Sets - Trie - Segment Tree - Binary Indexed Tree - Divide and Conquer - Graph Algorithms - Greedy Algorithms - Dynamic Programming - Mathematical Algorithms). Related Training: Advanced Data Structures and Algorithms Training

Level Timeline
Phase math 1 - 130 problems in 2 weeks Phase math 2 - 130 problems in 2 weeks Phase graph & string - 130 problems in 2 weeks Phase dynamic programming - 130 problems in 2 weeks Phase 3.1 regular contests - 60 problems in 2 weeks Phase 3.2 regular contests - 60 problems in 2 weeks
Phase 3.3 grand contests - 60 problems in 2 weeks Phase 3.4 grand contests - 60 problems in 2 weeks Phase 3.1 - 120 problems in 2 weeks Phase 3.2 - 120 problems in 2 weeks Phase 3.3 - 120 problems in 2 weeks Phase 3.4 - 120 problems in 2 weeks
Phase 3.1 - 190 problems in 2 weeks Phase 3.2 - 190 problems in 2 weeks Phase 3.3 - 190 problems in 2 weeks Phase 3.4 - 190 problems in 2 weeks Phase math & strings 1 - 120 problems in 2 weeks Phase math & strings 2 - 120 problems in 2 weeks
Phase graph 1 - 120 problems in 2 weeks Phase graph 2 - 120 problems in 2 weeks Phase dynamic programming 1 - 120 problems in 2 weeks Phase dynamic programming 2 - 120 problems in 2 weeks Phase advanced data structures 1 - 120 problems in 2 weeks Phase advanced data structures 2 - 120 problems in 2 weeks



HackerRank OJ sheets

The HackerRank OJ sheets: phase-3-mathematics-1, phase-3-mathematics-2, phase-3-graph-string, phase-3-dynamic-programming, These sheets contain string, number theory, algebra, graph, greedy, mathematics, bit manipulation, and dynamic programming problems. These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~130 problems.

mathematics-1 120 problems mathematics-2 120 problems
Fundamentals 10 problemssolutions Fundamentals 10 problemssolutions
Number Theory35 problemssolutions Number Theory35 problemssolutions
Combinatorics25 problemssolutions Combinatorics25 problemssolutions
Algebra 25 problemssolutions Algebra 25 problemssolutions
Geometry 30 problemssolutions Probability 25 problemssolutions
graph-string 130 problems dynamic-programming 140 problems
Graph Theory I 30 problemssolutions Bit Manipulation 30 problemssolutions
Graph Theory II 30 problemssolutions Dynamic Programming I 40 problemssolutions
Greedy 25 problemssolutions Dynamic Programming II 30 problemssolutions
Strings I 20 problemssolutions Dynamic Programming III30 problemssolutions
Strings II 20 problemssolutions Constructive Algorithms10 problemssolutions


AtCoder OJ sheets

The AtCoder OJ sheets: phase-3-1, phase-3-2, phase-3-3, phase-3-4, These sheets focus on Regular + Grand contests (medium contests) and contains ~60 contests

phase-3-1 70 problems phase-3-2 70 problems
2016-2017 Regular Contests30 problemssolutions 2016-2017 Regular Contests30 problemssolutions
2018-2019 Regular Contests15 problemssolutions 2018-2019 Regular Contests15 problemssolutions
2020-2021 Regular Contests25 problemssolutions 2020-2021 Regular Contests25 problemssolutions
phase-3-3 55 contests phase-3-4 55 contests
2016-2017 Grand Contests20 contestssolutions 2016-2017 Grand Contests20 contestssolutions
2018-2019 Grand Contests20 contestssolutions 2018-2019 Grand Contests20 contestssolutions
2020-2021 Grand Contests15 contestssolutions 2020-2021 Grand Contests15 contestssolutions


Codeforces OJ sheets

The Codeforces OJ sheets: phase-3-1, phase-3-2, phase-3-3, phase-3-4 contain C-Div2/A-Div1 problems, and each sheet of them divided into 7 classes of problems (Divide and Conquer - Graph - Data Structure - Math and Number Theory - String - Greedy and Brute Force - Dynamic Programming). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~120 problems. For the last 3 sheets phase-3-div3-contests that focus on div3-contests (easy contests) and contains ~100 contests, and phase-3-educational-contests, that focus on educational-contests (medium contests) and contains ~100 contests. Finally phase-3-gym-contests-1, phase-3-gym-contests-2 that focus on gym-contests that contains ~200 contests.

phase-3-1 120 problems phase-3-2 120 problems
Divide and Conquer 10 problemssolutions Divide and Conquer 10 problemssolutions
Graph 15 problemssolutions Graph 10 problemssolutions
String 15 problemssolutions String 10 problemssolutions
Data Structure 20 problemssolutions Data Structure 20 problemssolutions
Math and Number Theory30 problemssolutions Math and Number Theory30 problemssolutions
Greedy and Brute Force25 problemssolutions Greedy and Brute Force20 problemssolutions
Dynamic Programming 10 problemssolutions Dynamic Programming 10 problemssolutions
phase-3-3 120 problems phase-3-4 130 problems
Divide and Conquer 10 problemssolutions Divide and Conquer 15 problemssolutions
Graph 10 problemssolutions Graph 10 problemssolutions
String 10 problemssolutions String 10 problemssolutions
Data Structure 20 problemssolutions Data Structure 20 problemssolutions
Math and Number Theory30 problemssolutions Math and Number Theory30 problemssolutions
Greedy and Brute Force20 problemssolutions Greedy and Brute Force20 problemssolutions
Dynamic Programming 10 problemssolutions Dynamic Programming 10 problemssolutions
phase-3-div3-contests 100 contests phase-3-educational-contests 100 contests
Div3 Contests I 20 Contestssolutions Educational Rounds I 20 Contestssolutions
Div3 Contests II 20 Contestssolutions Educational Rounds II 20 Contestssolutions
Div3 Contests III 20 Contestssolutions Educational Rounds III20 Contestssolutions
Div3 Contests IV 20 Contestssolutions Educational Rounds IV 20 Contestssolutions
Div3 Contests V 20 Contestssolutions Educational Rounds V 20 Contestssolutions
phase-3-gym-contests-1 115 contests phase-3-gym-contests-2 110 contests
GYM Contests 2 15 Contestssolutions GYM Contests 2 10 Contestssolutions
GYM Contests 3 I 25 Contestssolutions GYM Contests 3 I 25 Contestssolutions
GYM Contests 3 II 25 Contestssolutions GYM Contests 3 II 25 Contestssolutions
GYM Contests 3 III25 Contestssolutions GYM Contests 3 III25 Contestssolutions
GYM Contests 3 IV 25 Contestssolutions GYM Contests 3 IV 25 Contestssolutions


LeetCode OJ sheets

The LeetCode OJ sheets: phase-3-1, phase-3-2, phase-3-3, phase-3-4 contain graph algorithms, mathematical algorithms, number theory, string algorithms, and dynamic programming problems, in addition to advanced data structures, Each sheet of them divided into 6 classes of problems (Binary Search - Divide and Conquer - Sort - Greedy - Graph - Breadth First Search - Depth First Search - Backtracking - Dynamic Programming). These sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~180 problems.

phase-3-1 200 problems phase-3-2 185 problems
Backtracking 35 problemssolutions Backtracking 35 problemssolutions
Breadth First Search I 25 problemssolutions Breadth First Search 20 problemssolutions
Breadth First Search II25 problemssolutions Depth First Search 20 problemssolutions
Depth First Search I 35 problemssolutions Graph I 30 problemssolutions
Depth First Search II 35 problemssolutions Graph II 30 problemssolutions
Dynamic Programming 50 problemssolutions Dynamic Programming 30 problemssolutions
phase-3-3 190 problems phase-3-4 190 problems
Union Find & Binary Indexed Tree & Trie30 problemssolutions Segment Tree & Suffix Array & Geometry 30 problemssolutions
Math I 30 problemssolutions Math I 30 problemssolutions
Math II 30 problemssolutions Math II 30 problemssolutions
String 50 problemssolutions String 50 problemssolutions
Dynamic Programming 50 problemssolutions Dynamic Programming 50 problemssolutions


HackerEarth OJ sheets

The HackerEarth OJ sheets: phase-3-mathematics-strings-1, phase-3-mathematics-strings-2, phase-3-graph-1, phase-3-graph-2, phase-3-dynamic-programming-1, phase-3-dynamic-programming-2, phase-3-advanced-data-structures-1, phase-3-advanced-data-structures-2, Each sheet contains string, graph, greedy, mathematics, number theory, and dynamic programming problems, in addition to advanced data structures. These sheets were ordered based on the problem difficulty and grouped by the problem type, each sheet contains ~120 problems.

mathematics-strings-1 110 problems mathematics-strings-2 110 problems
Basic Number Theory 30 problemssolutions Basic Number Theory 30 problemssolutions
Primality Tests 30 problemssolutions Basics of Combinatorics 30 problemssolutions
Totient Function 10 problemssolutions Inclusione-Exclusion 20 problemssolutions
Basics of String Manipulation 40 problemssolutions String Searching & Z Algorithm35 problemssolutions
graph-1 150 problems graph-2 150 problems
Graph Representation 35 problemssolutions Depth First Search 40 problemssolutions
Breadth First Search 35 problemssolutions Shortest Path 50 problemssolutions
Depth First Search I 40 problemssolutions Spanning Tree 30 problemssolutions
Depth First Search II 40 problemssolutions Minimum Cost & Maximum Flow30 problemssolutions
dynamic-programming-1 110 problems dynamic-programming-2 120 problems
Dynamic Programming I 25 problemssolutions Dynamic Programming I 25 problemssolutions
Dynamic Programming II 25 problemssolutions Dynamic Programming II 25 problemssolutions
Dynamic Programming 2D I 25 problemssolutions Dynamic Programming 2D I 25 problemssolutions
Dynamic Programming 2D II25 problemssolutions Dynamic Programming 2D II25 problemssolutions
DP and Bit Masking 10 problemssolutions DP and Bit Masking 10 problemssolutions
advanced-data-structures-1 120 problems advanced-data-structures-2 110 problems
Disjoint Sets 30 problemssolutions Segment Tree 30 problemssolutions
Trie 20 problemssolutions Binary Indexed Tree I 30 problemssolutions
Segment Tree I 35 problemssolutions Binary Indexed Tree II 30 problemssolutions
Segment Tree II35 problemssolutions Suffix Tree & Suffix Array20 problemssolutions

Notes

  • If the student has a target to compete in the programming competitions like ACM-ICPC or Google CodeJam or Google KickStart or Facebook Hackercup or TopCoder Open TCO, so it's recommended to start with Codeforces sheets, TopCoder sheets, Spoj sheets, UVa sheets, and AtCoder 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 sheets, HackerRank sheets, URI sheets, and LeetCode 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 problem, including reading time, thinking time, coding time, debugging time, and learning time.

Level 4

coming soon ...

problem-solving-training's People

Contributors

cs-mohamedayman avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.