Skip to content

Latest commit

 

History

History
666 lines (636 loc) · 21 KB

README.md

File metadata and controls

666 lines (636 loc) · 21 KB
Raw

Level 3: Intermediate Data Structures and Algorithms




  • This level simply consists of 22 phases, 2 phases on HackerRank Online Judge, 6 phases on LeetCode Online Judge, 4 phases on Google Competitions Online Judge, 6 phases on Codeforces Online Judge, and the last 4 phases on HackerEarth Online Judge.

  • 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 consider that the phase is done when you solved at least 30% of the phase problems, and the level is done when you solved at least 6 phases.


Table of Contents



Prerequisite Knowledge:

* C++, Python Programming Languages

* Java, C# Programming Languages

* Data Structures and Algorithms


HackerRank OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 HackerRank OJ
Mathematical Algorithms		 Number Theory
Combinatorics
Algebra
Geometry
Probability
30
25
30
15
15
115 80
02 HackerRank OJ
Graph Theory and Dynamic Programming		 Graph Theory
Greedy
Dynamic Programming I
Dynamic Programming II
Implementation
 25
15
20
20
20
100 80

LeetCode OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 LeetCode OJ
Basic Algorithms		 Binary Search
Sorting I
Sorting II
Greedy I
Greedy II
20
15
15
25
25
100 80
02 LeetCode OJ
Graph Theory		 Breadth First Search
Depth First Search
Graph
Backtracking
20
20
20
15
75 80
03 LeetCode OJ
Mathematics and Strings		 Math I
Math II
Math III
String I
String II
15
15
15
15
15
75 80
04 LeetCode OJ
Dynamic Programming		 Dynamic Programming I
Dynamic Programming II
Dynamic Programming III
Dynamic Programming IV
20
20
20
20
80 80

LeetCode OJ Custom Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 LeetCode OJ
Interviews Questions 1		 Array and String
Linked List
Stack and Queue
Binary Tree and Binary Search
Graph and Backtracking
Heap and Bit Manipulation
Hashmap and Math
Dynamic Programming
20
15
10
25
20
10
10
15
125 80
02 LeetCode OJ
Interviews Questions 2		 Array and String
Linked List
Stack and Queue
Binary Tree and Binary Search
Graph and Backtracking
Heap and Bit Manipulation
Hashmap and Math
Dynamic Programming
20
15
10
25
20
10
10
15
125 80

Google Competitions Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 Google Competitions
KickStart 1		 KickStart 2013
KickStart 2014
KickStart 2015
KickStart 2016
KickStart 2017
KickStart 2018
3
4
6
5
7
8
33 120
02 Google Competitions
KickStart 2		 KickStart 2019
KickStart 2020
KickStart 2021
KickStart 2022
9
9
8
11
37 120
03 Google Competitions
CodeJam 1		 CodeJam Qualifications
CodeJam 1A
CodeJam 1B
CodeJam 1C
8
8
8
8
32 120
04 Google Competitions
CodeJam 2		 CodeJam Qualifications
CodeJam 1A
CodeJam 1B
CodeJam 1C
8
7
7
7
29 120

Codeforces OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 Codeforces OJ
Phase 3-1		 Divide and Conquer
Graph
String
Data Structure
Math and Number Theory I
Math and Number Theory II
Greedy and Brute Force
Dynamic Programming
10
15
15
20
15
15
25
10
125 80
02 Codeforces OJ
Phase 3-2		 Divide and Conquer
Graph
String
Data Structure
Math and Number Theory I
Math and Number Theory II
Greedy and Brute Force
Dynamic Programming
10
15
15
20
15
15
25
10
125 80
03 Codeforces OJ
Phase 3-3		 Divide and Conquer
Graph
String
Data Structure
Math and Number Theory I
Math and Number Theory II
Greedy and Brute Force
Dynamic Programming
10
15
15
20
15
15
25
10
125 80
04 Codeforces OJ
Phase 3-4		 Divide and Conquer
Graph
String
Data Structure
Math and Number Theory I
Math and Number Theory II
Greedy and Brute Force
Dynamic Programming
10
15
15
20
15
15
25
10
125 80

Codeforces OJ Custom Contests

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 Codeforces OJ
Educational Contests 1		 Educational Rounds I
Educational Rounds II
Educational Rounds III
Educational Rounds IV
20
20
20
20
80 120
02 Codeforces OJ
Educational Contests 2		 Educational Rounds I
Educational Rounds II
Educational Rounds III
Educational Rounds IV
20
20
20
20
80 120

HackerEarth OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 HackerEarth OJ
Mathematics Strings		 Basic Number Theory
Primality Tests
Totient Function
Basics of String Manipulation
30
30
10
40
110 80
02 HackerEarth OJ
Graph		 Graph and Topological Sort
Breadth First Search
Depth First Search I
Depth First Search II
Depth First Search III
35
35
30
30
20
150 80
03 HackerEarth OJ
Dynamic Programming		 Dynamic Programming I
Dynamic Programming II
Dynamic Programming 2D I
Dynamic Programming 2D II
DP and Bit Masking
25
25
25
25
10
110 80
04 HackerEarth OJ
Advanced Data Structures		 Disjoint Sets
Trie
Segment Tree I
Segment Tree II
30
20
35
35
120 80

UVA OJ Phases

coming soon ...