Skip to content

Commit 119a7d0

Browse files
cs-MohamedAymancs-MohamedAyman
authored
Update README.md
1 parent 2e1781b commit 119a7d0

File tree

1 file changed

+47
-40
lines changed

1 file changed

+47
-40
lines changed

‎level-3/README.md

Lines changed: 47 additions & 40 deletions
Original file line numberDiff line numberDiff line change
@@ -8,10 +8,7 @@ Problem Solving Training for computer science students.
88
<img align="right" width="90" height="90" src="https://github.com/cs-MohamedAyman/Problem-Solving-Training/blob/master/online-judges-logos/hackerearth.jpg">
99
<img align="right" width="90" height="90" src="https://github.com/cs-MohamedAyman/Problem-Solving-Training/blob/master/online-judges-logos/hackerrank.jpg">
1010
<img align="right" width="90" height="90" src="https://github.com/cs-MohamedAyman/Problem-Solving-Training/blob/master/online-judges-logos/uri.jpg">
11-
<br>
12-
<br>
13-
<br>
14-
<br>
11+
<br><br><br><br>
1512

1613
## Table of Contents
1714
* [Level 3](#level-3)
@@ -70,61 +67,71 @@ The LeetCode OJ sheets [phase-3-1](https://github.com/cs-MohamedAyman/Problem-So
7067
| | Phase Name | # Problems | Phase Name | # Problems |
7168
|:---:|:------------------:|:-------------:|:-----------------:|:------------:|
7269
| | [phase-3-1](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/leetcode-phase-3-1) | 180 problems | [phase-3-2](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/leetcode-phase-3-2) | 210 problems |
73-
| `1` | Binary Search I | `30 problems` | Binary Search | `30 problems` |
74-
| `2` | Binary Search II | `30 problems` | Greedy I | `40 problems` |
75-
| `3` | Divide and Conquer | `20 problems` | Greedy II | `40 problems` |
76-
| `4` | Sort I | `40 problems` | Greedy III | `40 problems` |
77-
| `5` | Sort II | `40 problems` | Graph I | `30 problems` |
78-
| `6` | Greedy | `20 problems` | Graph II | `30 problems` |
70+
| `1` | Backtracking | `35 problems` | Backtracking | `35 problems` |
71+
| `2` | Breadth First Search I | `25 problems` | Breadth First Search | `20 problems` |
72+
| `3` | Breadth First Search II | `25 problems` | Depth First Search | `20 problems` |
73+
| `4` | Depth First Search I | `35 problems` | Graph I | `30 problems` |
74+
| `5` | Depth First Search II | `35 problems` | Graph II | `30 problems` |
75+
| `6` | Dynamic Programming | `50 problems` | Dynamic Programming | `30 problems` |
7976
| | [phase-3-3](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/leetcode-phase-3-3) | 160 problems | [phase-3-4](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/leetcode-phase-3-4) | 160 problems |
80-
| `1` | Breadth First Search I | `25 problems` | Breadth First Search | `20 problems` |
81-
| `2` | Breadth First Search II | `25 problems` | Depth First Search | `20 problems` |
82-
| `3` | Depth First Search I | `35 problems` | Backtracking I | `35 problems` |
83-
| `4` | Depth First Search II | `35 problems` | Backtracking II | `35 problems` |
84-
| `5` | Dynamic Programming I | `30 problems` | Dynamic Programming I | `30 problems` |
85-
| `6` | Dynamic Programming II | `30 problems` | Dynamic Programming II | `30 problems` |
86-
| `7` | Dynamic Programming III | `30 problems` | Dynamic Programming III | `30 problems` |
77+
| `1` | Union Find & Binary Indexed Tree & Trie | `30 problems` | Segment Tree & Suffix Array & Geometry | `30 problems` |
78+
| `2` | Math I | `30 problems` | Math I | `30 problems` |
79+
| `3` | Math II | `30 problems` | Math II | `30 problems` |
80+
| `4` | String | `50 problems` | String | `50 problems` |
81+
| `5` | Dynamic Programming | `50 problems` | Dynamic Programming | `50 problems` |
8782

8883
<img align="right" width="80" height="80" src="https://github.com/cs-MohamedAyman/Problem-Solving-Training/blob/master/online-judges-logos/hackerearth.jpg">
8984
<br>
9085

9186
## [`HackerEarth OJ sheets`](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/README.md)
9287

93-
The HackerEarth OJ sheets [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-mathematics), [phase-3-graph](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-graph), [phase-3-dynamic-programming-greedy](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-dynamic-programming-greedy), [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-advanced-data-structures), Each sheet contains graph, greedy, mathematics, 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 ~110 problems.
88+
The HackerEarth OJ sheets [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-mathematics), [phase-3-graph](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-graph), [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-dynamic-programming), [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-advanced-data-structures), Each sheet contains graph, greedy, mathematics, 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 ~110 problems.
9489

9590
| | Phase Name | # Problems | Phase Name | # Problems |
9691
|:---:|:------------------------------------:|:-------------:|:----------------------:|:-------------:|
97-
| | [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-mathematics) | 80 problems | [phase-3-graph](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-graph) | 175 problems |
98-
| `1` | Basic Number Theory | `30 problems` | Graph Representation | `25 problems` |
99-
| `2` | Primality Tests | `15 problems` | Breadth First Search | `35 problems` |
100-
| `3` | Totient Function | `5 problems` | Depth First Search | `60 problems` |
101-
| `4` | Basics of Combinatorics | `20 problems` | Shortest Path | `45 problems` |
102-
| `5` | Inclusione-Exclusion | `20 problems` | Minimum Spanning Tree | `10 problems` |
103-
| | [phase-3-dynamic-programming-greedy](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-dynamic-programming-greedy) | 180 problems | [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-advanced-data-structures) | 140 problems |
104-
| `1` | Dynamic Programming | `50 problems` | Disjoint Sets | `30 problems` |
105-
| `2` | Dynamic Programming 2D | `45 problems` | Trie | `20 problems` |
106-
| `3` | DP and Bit Masking | `15 problems` | Segment Tree | `55 problems` |
107-
| `4` | Greedy Algorithms I | `35 problems` | Binary Indexed Tree | `35 problems` |
108-
| `5` | Greedy Algorithms II | `35 problems` | | |
92+
| | [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-mathematics) | 150 problems | [phase-3-graph](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-graph) | 300 problems |
93+
| `1` | Basic Number Theory I | `30 problems` | Graph Representation | `35 problems` |
94+
| `2` | Basic Number Theory II | `30 problems` | Breadth First Search | `35 problems` |
95+
| `3` | Primality Tests | `30 problems` | Depth First Search I | `40 problems` |
96+
| `4` | Totient Function | `10 problems` | Depth First Search II | `40 problems` |
97+
| `5` | Basics of Combinatorics | `30 problems` | Depth First Search III | `40 problems` |
98+
| `6` | Inclusione-Exclusion | `20 problems` | Shortest Path | `50 problems` |
99+
| `7` | | | Minimum Spanning Tree & Biconnected Components | `30 problems` |
100+
| `8` | | | Minimum Cost & Maximum Flow & Min-Cut | `30 problems` |
101+
| | [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-dynamic-programming) | 220 problems | [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerearth-phase-3-advanced-data-structures) | 230 problems |
102+
| `1` | Dynamic Programming I | `50 problems` | Disjoint Sets | `30 problems` |
103+
| `2` | Dynamic Programming II | `50 problems` | Trie | `20 problems` |
104+
| `3` | Dynamic Programming 2D I | `45 problems` | Segment Tree I | `35 problems` |
105+
| `4` | Dynamic Programming 2D II | `45 problems` | Segment Tree II | `35 problems` |
106+
| `5` | DP and Bit Masking | `30 problems` | Segment Tree III | `30 problems` |
107+
| `6` | DP and Bit Masking | `30 problems` | Binary Indexed Tree I | `30 problems` |
108+
| `7` | | | Binary Indexed Tree II | `30 problems` |
109+
| `8` | | | Suffix Tree & Suffix Array | `20 problems` |
109110

110111
<img align="right" width="85" height="85" src="https://github.com/cs-MohamedAyman/Problem-Solving-Training/blob/master/online-judges-logos/hackerrank.jpg">
111112
<br>
112113

113114
## [`HackerRank OJ sheets`](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/README.md)
114115

115-
The HackerRank OJ sheets [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-mathematics), [phase-3-graph-greedy](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-graph-greedy), [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-dynamic-programming), [phase-3-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-data-structures), These sheets contain graph, greedy, mathematics, and dynamic programming problems, in addition to data structures. Also, these sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~70 problems.
116+
The HackerRank OJ sheets [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-mathematics), [phase-3-graph-string](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-graph-string), [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-dynamic-programming), [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-advanced-data-structures), These sheets contain graph, greedy, mathematics, and dynamic programming problems, in addition to data structures. Also, these sheets were ordered based on the problem difficulty and grouped by the problem type. Finally, each sheet contains ~70 problems.
116117

117118
| | Phase Name | # Problems | Phase Name | # Problems |
118119
|:---:|:------------------------------------:|:-------------:|:----------------------:|:-------------:|
119-
| | [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-mathematics) | 115 problems | [phase-3-graph-greedy](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-graph-greedy) | 55 problems |
120-
| `1` | Fundamentals | `20 problems` | Graph Theory | `40 problems` |
121-
| `2` | Number Theory | `35 problems` | Greedy | `15 problems` |
122-
| `3` | Combinatorics | `30 problems` | | |
123-
| `4` | Algebra | `30 problems` | | |
124-
| | [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-dynamic-programming) | 60 problems | [phase-3-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-data-structures) | 60 problems |
125-
| `1` | Bit Manipulation | `15 problems` | Heap & Disjoint Set & Trie | `10 problems` |
126-
| `2` | Dynamic Programming | `40 problems` | Advanced I | `25 problems` |
127-
| `3` | Constructive Algorithms | `5 problems` | Advanced II | `25 problems` |
120+
| | [phase-3-mathematics](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-mathematics) | 250 problems | [phase-3-graph-string](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-graph-string) | 130 problems |
121+
| `1` | Fundamentals | `25 problems` | Graph Theory I | `30 problems` |
122+
| `2` | Number Theory I | `35 problems` | Graph Theory II | `30 problems` |
123+
| `3` | Number Theory II | `35 problems` | Greedy | `25 problems` |
124+
| `4` | Combinatorics | `50 problems` | Strings | `45 problems` |
125+
| `5` | Algebra | `55 problems` | | |
126+
| `6` | Geometry | `30 problems` | | |
127+
| `7` | Probability | `25 problems` | | |
128+
| | [phase-3-dynamic-programming](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-dynamic-programming) | 140 problems | [phase-3-advanced-data-structures](https://github.com/cs-MohamedAyman/Problem-Solving-Training/tree/master/level-3/hackerrank-phase-3-advanced-data-structures) | 60 problems |
129+
| `1` | Bit Manipulation I | `15 problems` | Heap & Disjoint Set & Trie | `10 problems` |
130+
| `2` | Bit Manipulation II | `15 problems` | Advanced I | `25 problems` |
131+
| `3` | Dynamic Programming I | `40 problems` | Advanced II | `25 problems` |
132+
| `4` | Dynamic Programming II | `30 problems` | | |
133+
| `5` | Dynamic Programming III | `30 problems` | | |
134+
| `6` | Constructive Algorithms | `10 problems` | | |
128135

129136
## `Notes`
130137

0 commit comments

Comments
 (0)