Skip to content
This repository was archived by the owner on Mar 7, 2024. It is now read-only.

Commit d451cde

Browse files
darecoderdarecoder
authored
Added Competitive Programming in Java course content (#73)
* Added Competitive Programming in Java course content Topics updated * Subtopics added
1 parent 680d87e commit d451cde

File tree

1 file changed

+186
-11
lines changed

1 file changed

+186
-11
lines changed

‎src/data/courses/advanced/CompetitiveJava.js

Lines changed: 186 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ export const competitiveJava = {
2828
topics: [
2929
{
3030
title: 'Revisiting Java Collection Framework',
31-
classes: 'Classes 1-4',
31+
classes: 'Lectures 1-2',
3232
subtopics: [
3333
'In-built Data Structures',
3434
'Classes, Interfaces and Inheritance',
@@ -37,30 +37,205 @@ export const competitiveJava = {
3737
]
3838
},
3939
{
40-
title: 'Getting started with Codeforces',
41-
classes: 'Classes 5-8',
40+
title: 'Understanding online platforms: Codeforces & Leetcode',
41+
classes: 'Lectures 3',
4242
subtopics: [
4343
'Start Competitive Programming on Codeforces',
44-
'Set up Sublime Text for Competitive Coding',
44+
'Set up IntelliJ idea for Competitive Coding',
4545
'Create Template to save time in Competitive Coding'
4646
]
4747
},
4848
{
4949
title: 'Bit Masking and Manipulation',
50-
classes: 'Classes 9-13',
50+
classes: 'Lectures 4-5',
5151
subtopics: [
5252
'Get, Set, Clear and Update bits',
5353
'Fast Exponentiation using Bitmasking',
5454
'Generate Subsets using Bitmasking',
5555
'Decimal to Binary using Bitwise',
56-
'Inclusion Exclusion Concept + Implementation',
56+
'Backtracking with Bitmasking',
57+
'Binary Search + Bitmaksing',
58+
'Inclusion Exclusion Concept + Implementation'
5759
]
5860
},
5961
{
60-
title: 'Under Development',
61-
classes: 'Classes 14-30',
62-
subtopics: []
62+
title: 'Number theory & Computational Theory',
63+
classes: 'Lectures 6-7',
64+
subtopics: [
65+
'Binomial coefficients',
66+
'Matrix Exponentiation',
67+
'Catalan Series',
68+
'Fibonnaci & other series facts',
69+
'Prime factorization',
70+
'Pigeonhole Principle',
71+
'Extended Euclids Algorithms',
72+
'Willsons Theorem',
73+
'Pollards rho Theorem'
74+
]
75+
},
76+
{
77+
title: 'Divide & Conquer Algorithms',
78+
classes: 'Lectures 8',
79+
subtopics: [
80+
'Randomized Binary Search',
81+
'Merge sort & Quick sort',
82+
'Second largest element',
83+
'Painter partition problem',
84+
'Aggressive Cows',
85+
'Tilling problem'
86+
]
87+
},
88+
{
89+
title: 'Recursion & Backtracking',
90+
classes: 'Lectures 10-12',
91+
subtopics: [
92+
'Recursive tree, Stack trace',
93+
'Generate all passwords from given character set',
94+
'Lockdown Game',
95+
'Its confidential problem',
96+
'Sudoku solver',
97+
'Optimal BST problem',
98+
'Subset sum',
99+
'M coloring problem',
100+
'Lexical permutation',
101+
'N-Queens & N-Knights'
102+
]
103+
},
104+
{
105+
title: 'Dynamic Programming',
106+
classes: 'Lectures 13-15',
107+
subtopics: [
108+
'Understanding the concept in Dynamic Programming',
109+
'Understanding overlapping subproblems',
110+
'Memorization vs Tabulation',
111+
'Top down & bottom-up approach',
112+
'0-1 KnapSack problem',
113+
'Wildcard pattern problem',
114+
'Egg drop problem',
115+
'Matrix chain multiplication',
116+
'Wildcard Matching',
117+
'Longest Increasing Subsequence',
118+
'Maximum Subarray Sum'
119+
]
63120
},
121+
{
122+
title: 'Greedy Algorithms',
123+
classes: 'Lectures 16-17',
124+
subtopics: [
125+
'Greedy Algorithm concept & philosphy',
126+
'Pirates & Gold coins problem',
127+
'Activity selection & Job sequencing problem',
128+
'Policemen catch thieves',
129+
'Efficient Huffman encoding & decoding',
130+
'Assign mice to holes',
131+
'Minimum Spanning Tree',
132+
'Memory Management Algorithms'
133+
]
134+
},
135+
{
136+
title: 'Binary Tree',
137+
classes: 'Lectures 17-18',
138+
subtopics: [
139+
'Implementation of Binary Trees',
140+
'Tree traversal- inorder, preorder, postorder',
141+
'Searching Algorithms- DFS, BFS',
142+
'Calculate- hieght, depth, diameter of tree',
143+
'Implementation of Binary Search Tree',
144+
'AVL Trees & Rotations',
145+
'Interview problems on BT & BST'
146+
]
147+
},
148+
{
149+
title: 'String Matching',
150+
classes: 'Lectures 19-20',
151+
subtopics: [
152+
'String Matching Algorithms',
153+
'String window pronlems',
154+
'String Hashing',
155+
'Rabin Karp Algorithm',
156+
'Knuth Morris Pratt Algorithm'
157+
]
158+
},
159+
{
160+
title: 'Tries',
161+
classes: 'Lectures 21-22',
162+
subtopics: [
163+
'Trie as a Data Structure',
164+
'Implementation',
165+
'Max XOR pair',
166+
'Library Bookmarks',
167+
'Range XOR',
168+
'Trie Interview problem'
169+
]
170+
},
171+
{
172+
title: 'Segment Tree',
173+
classes: 'Lectures 22-23',
174+
subtopics: [
175+
'Segment Tree structure & concept',
176+
'Build & update implementation',
177+
'Lazy Propagation',
178+
'Persistent Segment Tree',
179+
'XOR Sum problem',
180+
'Xenia & Bit operations[Codeforces]',
181+
'Alpha & his arrays',
182+
'Greatest common divisor',
183+
'Distinct Integers in range'
184+
]
185+
},
186+
{
187+
title: 'Fenwick Tree',
188+
classes: 'Lectures 24-25',
189+
subtopics: [
190+
'Fenwick Tree concept',
191+
'Build & update implementation',
192+
'Range Sum query',
193+
'Inversion count',
194+
'2D Binary Indexed Tree',
195+
'No. of elements greater than K in [L,R] range',
196+
'Range Queries problems'
197+
]
198+
},
199+
{
200+
title: 'Graphs',
201+
classes: 'Lectures 26-27',
202+
subtopics: [
203+
'Terminologies in Graph',
204+
'EdgeList implementation',
205+
'AdjacencyList implementation',
206+
'AdjacencyMap implementation',
207+
'Searching Algorithms- DFS, BFS',
208+
'Connected component, Cycle detection',
209+
'Bipartite Graph',
210+
"Kruskal's, Dijkstra's, Prim's Algorithms",
211+
"Kosaraju's Algorithm",
212+
'Dynamic Programming with Graphs'
213+
]
214+
},
215+
{
216+
title: 'Advanced Mathematics',
217+
classes: 'Lectures 28-29',
218+
subtopics: [
219+
'Fast Fourier transform concepts',
220+
'FFT Implementation',
221+
'Discrete Fourier transform',
222+
'Inverse FFT',
223+
'Square Root Decompositions',
224+
'Segmented Sieve',
225+
'Modulo inverse',
226+
'Lucas Theorem'
227+
]
228+
},
229+
{
230+
title: 'Game Theory',
231+
classes: 'Lectures 30',
232+
subtopics: [
233+
'Concept around Game theory',
234+
'Combinational Game theory',
235+
'Game of chocolates',
236+
'Robot problems'
237+
]
238+
}
64239
],
65240
slides: [
66241
{
@@ -78,8 +253,8 @@ export const competitiveJava = {
78253
'Number Theory',
79254
'Segment Tree',
80255
'Fenwick Tree',
81-
'Decompositions'
82-
256+
'Decompositions',
257+
'Tries'
83258
],
84259
overview: [
85260
"Under Development"

0 commit comments

Comments
 (0)