Skip to content

Latest commit

 

History

History
467 lines (442 loc) · 15.1 KB

README.md

File metadata and controls

467 lines (442 loc) · 15.1 KB

Level 4: Advanced Data Structures and Algorithms




coming soon ...


Table of Contents



Prerequisite Knowledge:


HackerRank OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 HackerRank OJ
Data Structures Hard Problems 1
Linear and Non-linear DS
Strings
Dynamic Programming I
Dynamic Programming II
Advanced
15
15
15
10
20
75 80
02 HackerRank OJ
Data Structures Hard Problems 2
Linear and Non-linear DS
Strings
Dynamic Programming I
Dynamic Programming II
Advanced
15
15
15
10
20
75 80
03 HackerRank OJ
Algorithms Hard Problems 1
Greedy
Graph Theory
Mathematics
Number Theory
Combinatorics, Geometry, Probability
10
20
15
15
20
80 80
04 HackerRank OJ
Algorithms Hard Problems 2
Greedy
Graph Theory
Mathematics
Number Theory
Combinatorics, Geometry, Probability
10
20
15
15
20
80 80

LeetCode OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 LeetCode OJ
Data Structures Hard Problems
Array
Stack, Queue, Dequeue
Binary Tree
Heap Tree
Hash Table
Advanced Topics
10
15
5
20
5
15
70 80
02 LeetCode OJ
Algorithms Hard Problems
Breadth First Search
Depth First Search
Backtracking
Binary Search
Greedy
Bit Manipulation, Sorting
20
20
20
20
20
20
120 80
03 LeetCode OJ
Mathematics and Strings
Math I
Math II
Math III
String I
String II
String III
15
15
10
10
10
10
70 80
04 LeetCode OJ
Dynamic Programming
Dynamic Programming I
Dynamic Programming II
Dynamic Programming III
Dynamic Programming IV
Dynamic Programming V
Dynamic Programming VI
15
15
15
15
15
15
90 80

Google Competitions Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 Google Competitions
CodeJam 1
CodeJam Round 2
CodeJam Round 3
CodeJam Round World Finals
8
8
11
27 120
02 Google Competitions
CodeJam 2
CodeJam Round 2
CodeJam Round 3
CodeJam Round World Finals
7
7
7
21 120

Codeforces OJ Phases

coming soon ...


HackerEarth OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 HackerEarth OJ
Mathematics Strings
Basic Number Theory
Basics of Combinatorics
Inclusione-Exclusion
String Searching and Z Algorithm
30
30
25
35
120 80
02 HackerEarth OJ
Graph
Depth First Search
Shortest Path I
Shortest Path II
Spanning Tree
Min Cost and Max Flow
40
25
20
35
30
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
Segment Tree
Binary Indexed Tree I
Binary Indexed Tree II
Suffix Tree and Suffix Array
30
30
30
20
110 80

AtCoder OJ Phases

# Phase OJ Phase Name Phase Sections # Problems Hrs
01 AtCoder OJ
Phase 3-1
2016-2017 Grand Contests
2018-2019 Grand Contests
2020-2023 Grand Contests
10
10
10
30 120
02 AtCoder OJ
Phase 3-2
2016-2017 Grand Contests
2018-2019 Grand Contests
2020-2023 Grand Contests
10
10
10
30 120