Course Content
INTRODUCTION
0/13
Introduction to Course
04:20
What is Competitive Programming
06:10
Competitive Programming Competitions
08:23
Websites for Competitive Programming
13:25
Terminologies in Competitive Programming
16:17
Choosing a Programming Language
05:53
Taking Input _ Output in Competitive Programming Contests
10:47
Cout vs Printf
05:04
Endl vs Back n
04:21
Fast cin cout Methods _ Conclusion
09:41
Time Complexity in Competitive Programming
10:23
Calculating Time Complexity of Code
14:05
Importance of English in Competitive Programming
02:39
Standard Template Library (STL)
0/17
Introduction to STL in C++
10:07
Standard Array
16:19
Standard Vector
39:24
Standard Set
42:04
Standard Multiset
40:13
Standard Map
43:43
Standard Multimap
32:12
Standard Pair
15:53
Standard Forward List
31:34
Standard List
17:55
Standard Unordered Set
13:12
Standard Unordered Multiset
11:08
Unordered Map and Unordered Multimap
14:50
Standard Stack
10:60
Standard Queue
07:58
Standard Priority Queue
11:11
Standard Deque
12:31
Bit Manipulation and Modulo Arthematic
0/12
Importance of Bit Manipulation Techniques
10:47
Basic Binary Operations
47:10
Bit Operations in C++
20:17
Check ith bit is SET or NOT SET
10:23
Toggle ith bit
09:09
Check odd or even using bits
09:48
Check if Number is Power of 2
11:55
Need for Modulo 10^9 + 7
21:16
Modulo Arithmetic
22:13
[A3
04:02
[A3
12:21
[A3
10:25
Graphs
0/17
Introduction to Graphs
34:03
Weights in Graphs
15:18
Why Study Graphs
11:01
Edge List
30:28
Adjacenty Matrix
39:04
Adjacenty List
23:24
DFS Traversal
20:21
Implementing DFS Traversal
04:22
BFS Traversal
21:29
Implementing BFS Traversal
09:09
Minimum Spanning Tree
13:18
Concept of Kruskal_s Algorithm
30:46
Concept of Prim_s Algorithm
18:23
Concept of Dijkstra Algorithm
24:26
[A4
04:55
[A4
15:56
[A4
05:57
Segment Trees
0/17
Sum of Updated Range Problem
14:28
Solving Sum of Range Problem with Segment Trees
16:06
Segment Trees – Update Queries
18:11
Segment Trees – Calculate Sum
45:21
Implementing Segment Tree – Part 1
21:53
05_Segment Trees_06_Implementing Segment Tree – Part 2
00:00
Problem – Range Minimum Query
05:56
Implementing Range Minimum Query
11:09
Implementing Segment Tree – Tricks
35:46
Lazy Propagation in Segment Trees – Part 1
24:30
Lazy Propagation in Segment Trees – Part 2
13:57
Problem – Xenia and Bit Operations
05:33
Solution – Xenia and Bit Operations
09:31
Solution with Code – Xenia and Bit Operations
12:16
Problem – Circular RMQ
07:10
Solution with Code – Circular RMQ – Part 1
16:20
Solution with Code – Circular RMQ – Part 2
32:19
Backtesting
0/11
Introduction to Backtracking
09:40
N Queens Problem Explained
10:49
N Queens Solved
25:52
Knights Tour Problem Explained
10:58
Knight_s Tour Solved
20:13
Rat in Maze Problem Explained
04:45
Rat in Maze Solved
20:33
Problem Richie Rich
09:50
Solving Richie Rich
07:56
Problem False Number
19:33
Solving False Number
11:00
Greedy Alogarithms
0/12
Introduction to Greedy Algorithms
17:25
Understanding Greedy with Fractional Knapsack Problem
19:45
Solving Fractional Knapsack Problem
22:29
Tasks and Deadlines Problem
21:23
Solving Tasks and Deadlines Problem
14:29
Optimal File Merging Problem
16:53
Solving Optimal File Merge Patterns Problem
14:43
Huffman Coding
00:00
[A7
06:24
[A7
15:16
[A7
04:39
[A7
17:10
Dynamic Programming
0/14
Introduction to Dynamic Programming
14:37
Top down vs Bottom Up
16:21
Fibbonacci Problem Top Down
29:15
Implementing Fibonnaci with DP
11:00
2D Grid Traversal Problem
28:59
Implementing 2D Grid Traversal Problem
17:31
Understanding Memoization
06:55
Fibbonacci with Tabulation
10:46
Implementing Fibbonacci with Tabulation
07:00
2D Grid Traversal Problem with Tabulation
11:57
Implementing 2D Grid Traversal Problem with Tabulation
06:24
Understanding Tabulation
08:03
[A8
19:36
[A8
17:07
Competitive Programming

Previous
Next
0% Complete
Ask ChatGPT
Set ChatGPT API key
Find your Secret API key in your ChatGPT User settings and paste it here to connect ChatGPT with your Tutor LMS website.
×