Competitive Programming Essentials, Master Algorithms 2023
Loại khoá học: Software Engineering
Master competitive coding techniques - maths, number theory, dynamic programming, advanced data structures & algorithms
Mô tả
Equip yourself with essential programming techniques required for ACM-ICPC, Google CodeJam, Kickstart, Facebook HackerCup & more. Welcome to Competitive Programming Essentials - the ultimate specialisation on Algorithms for Competitive Coders!
The online Competitive Programming Essentials by Coding Minutes is a highly exhaustive & rigorous course on Competitive Programming. The 50+ hours course covers the breadth & depth of algorithmic programming starting from a recap of common data structures, and diving deep into essential and advanced algorithms.
The course structure is well-researched by instructors who not only Competitive Coders but have worked with companies like Google & Scaler. This course will help you to get a solid grip of fundamental concepts & comes with practice questions so that you sail through online coding challenges and code-athons with ease. The course is divided into 10 modules and 50 sections covering topics like Mathematics, Number Theory, Bitmasking, Inclusion-Exclusion, Meet in the Middle Techniques, Segment Trees, Fenwick Trees, Square Root Decomposition, Graph Algorithms, Shortest Paths, Game Theory, Pattern Matching, Binary Search, Greedy Techniques, Dynamic Programming and even more.
The problem setters of the course are Siddharth Singhal and Rajdeep Singh. Both are upcoming software developers at Microsoft and Razorpay respectively. They both exhibit excellent knowledge of Data Structures and Algorithms and are avid competitive programmers.
Many top companies like Google, Facebook, Amazon, Directi, CodeNation, Goldman Sachs etc encourage Competitive Programming and conduct coding competitions to hire smart people who can solve problems.
Course Highlights
Instructors from Google & Scaler Academy
50+ hours of high quality & structured content
In-depth coverage of all topics
Exhaustive Course Curriculum
Code Evaluation on Coding Exercises
Lifetime Access
Complimentary TA Doubt Support
Bạn sẽ học được gì
Understand & implement important techniques in Competitive Programming
Learn advanced techniques to optimise naive solutions
Ace code-thons and online coding competitons on Codeforces, HackerRank
Get ready for ACM-ICPC, Google Kickstart, CodeJam & more
Yêu cầu
- Comfortable with at-least one programming language
- Understanding & ability to code using data structures
- Basic problem solving experience
Nội dung khoá học
42 sections
Introduction
06:18
Course Structure
00:41
Exercise Solutions (C++/Java)
00:05
Doubt Support
00:46
IDE Environment Setup
00:15
FAQ's
01:15
Sublime Setup
09:46
Adding Master Header File
03:14
Escaping Online Judges
06:47
Common Code Snippets
04:53
Using Macros
09:50
Example Code Explained
18:05
Space Time Complexity Introduction
07:40
Experimental Analysis
09:19
Big O Notation
04:36
Nested Loops
02:34
Note : Edit in Nested Loops - II
00:11
Nested Loops - II
02:49
Analysis of Bubble Sort
03:42
Analayis of BInary Search
07:26
Analysis of Merge Sort
05:47
Avoiding TLE Errors
03:26
Complexities for Worst Case AC
03:27
Time/Space Complexity Quiz
5 questions
Data Structures & STL Containers Revisited
14:10
Arrays in C++
12:03
Array STL
14:37
Vector STL
17:47
Deque STL
07:02
Stack STL
03:07
Queue STL
01:29
Priority Queue STL
05:21
[Webinar] Hashing STL
00:01
[Webinar] More on STL
00:01
First Unique Character in a String
1 question
Kth Largest Element
1 question
One Integer
1 question
Maximum Score From Removing Stones
1 question
Find K Closest Elements
1 question
Distinct Candies
1 question
Bulls and Cows
1 question
Smallest Range Covering Elements from K Lists
1 question
Bitwise Operators
09:54
Left Shift & Right Shift
04:21
Odd Even
03:16
Get ith Bit
03:55
Clear ith Bit
02:42
Set ith Bit
02:30
Update ith Bit
04:48
Clear Last i Bits
03:54
Clear Range of Bits
06:09
Replace Bits
04:57
Two Power
02:52
Power of Four
1 question
Decode XORed Array
1 question
Count Bits
04:18
Count Bits Hack
03:15
Make it Binary
04:13
Sort Integers by The Number of 1 Bits
1 question
Longest Consecutive Run of 1s in Binary
1 question
Hamming Distance
1 question
Unique Number - I
06:27
Unique Number - I Code
01:54
Unique Number - II
09:23
Unique Number - II Code
08:17
Unique Number - III
06:10
Unique Number - III Code
09:14
Finding Subsequences
06:14
Finding Subsets Code
05:06
Maximum Score
1 question
Triples with Bitwise AND Equal To Zero
1 question
Bitwise AND of Range of Numbers
1 question
Total Hamming Distance
1 question
Travelling Salesman Problem
12:03
Travelling Salesman Intution
03:42
Travelling Salesman Code
12:25
Travelling Salesman - DP Optimisation
02:43
Decode Permutation
1 question
Shortest Superstring
1 question
Welcome!
00:01
Introduction to Big Integers
04:45
Big Addition Concept
08:54
Big Addition Code
13:49
Array & Integer Multiplication
07:41
Large Factorials
09:20
Java Big Integer Class
15:09
BigInteger Example
03:44
Big Integers in Python
05:05
Python's Handling of Big Integers
00:05
Big Integer Challenge - Julka
05:28
Big Integer Challenge Solution
06:18
Binary Exponentiation
15:00
POW
1 question
Modular Binary Exponentiation
09:02
Magic of the Locker
1 question
Fast Mutiplication
10:45
Strange Function
1 question
Matrix Exponentiation Introduction
15:54
Matrix Exponentiation Code
14:23
Fibosum (spoj)
07:28
Fibosum(second approach)
11:03
Fibonacci Sum
1 question
Pigeonhole Principle
03:04
Problem DIVSUB
09:04
Applying Pigeonhole Principle
11:41
Decreasing Sequence
1 question
Gray Similar Code
12:00
Holiday
24:06
Holiday Code
15:25
Subarray Sum Divisible by N
1 question
Bob and Impossible Calculation
1 question
Expectation
08:01
Linearity of Expectation
03:35
Problem - Linearity of Expectation
02:27
Expected Throws - One Head
03:05
Expected Throws - Two Consecutive Heads
03:32
Expected Throws - N Consecutive Heads
05:52
Bernaulli's Trial
03:48
Choose Number
01:06
Bernoulli's Trial
02:03
Coupon Collector
06:43
Expectation Quiz
4 questions
Bob and Palindromes
1 question
Second Player
1 question
Inclusion Exclusion
05:33
Generalised Function
07:11
Problems
14:51
Total Number of Divisors Till N code
12:02
Divisibility
1 question
Introduction
10:13
Prime Sieve
11:55
Sieve of Eratosthenes Code
11:06
Prime Queries
06:46
Prime Factorisation
05:33
Prime Factorisation Code O(N)
03:03
Prime Factorisation Code O(Sqrt(N))
06:38
Prime Factorisation using Sieve O(LogN)
06:26
Count Primes
1 question
Segmented Sieve
03:18
Segmented Sieve Algorithm
08:01
Segmented Sieve Code
14:28
Alice and Candies
1 question
Prime Sum
1 question
Closest Divisors
1 question
Math
1 question
GCD
06:52
Euclid's Algorithm Code
03:01
GCD Complexity
05:53
Extended Euclideans
07:45
Extended Euclidean Example
10:00
Extended Euclidean Code
07:41
GCD using Extended Euclidean Algorithm
03:40
Multiplicative Modulo Inverse
04:12
Computing Multiplicative Modulo Inverse
03:44
MMI Code
04:04
Linear Diophantine Equations
09:15
Linear Diophantine Equation - Family of Solutions
03:03
Greatest Common Divisor
1 question
GCD II
1 question
Coprime Divisor
1 question
Alice Studies Informatics
1 question
Row Gcd
1 question
Number Theory Quiz
1 question
Modulo Airthmetic
12:27
Modulo Arithmetic Code
11:48
Fermat's Theorem
09:48
Factorial % P
03:15
nCr % P
08:29
Chinese Remainder Theorem
08:59
Totient Function
05:16
Totient Function code using Seive
09:39
Good Array
1 question
Remainders Game
1 question
Combinatorics Introduction
13:25
Binomial Coefficients
09:46
Selection of Personnel
1 question
The World is a Theatre
1 question
P & C Formulas
00:21
Computing Binomial Coefficients
08:49
Birthday Paradox
08:45
Birthday Paradox Code
07:48
Catalan Numbers
08:23
Catalan Numbers Code - Recursive
03:10
Catalan Numbers Code - Iterative / DP
04:13
Skyline
1 question
Count the Arrays
1 question
Beautiful Numbers
1 question
OEIS
00:12
Factorization
1 question
Introduction to Algorithms
00:02
Recursion Basics
10:22
Factorial
07:49
Fibonacci Series
11:02
Sorted Array Check
09:50
Understanding Recursion DIrections
07:24
Power Function
03:37
Fast Power
04:53
Tiling Problem
06:46
Count Strings
07:12
Friend's Pairing Problem
06:11
Tower Of Hanoi
23:54
Tower Of Hanoi (code)
10:07
Backtracking Problems
04:27
Finding Subsets
13:03
Letter Combinations of a Phone Number
1 question
Finding Subsets Code
07:28
Permuations
10:51
Brackets
06:55
Brackets Code
06:50
N-Queen
11:53
N-Queen Code
15:58
N-Queen Ways
14:57
Target Sum
1 question
Sudoku Solver
10:40
Sudoku Solver Code
18:29
Palindrome Partitioning
1 question
Sudoku Solver
1 question
Power Sum
1 question
Binary Search
08:00
Binary Search Code
04:06
Lower Bound and Upper Bound
07:07
Lower Bound Code
03:04
Angry Birds
11:21
Angry Bird Code
10:01
Game of Greed
08:20
Game of Greed Code
10:02
Valid Perfect Square
1 question
Koko Eating Bananas
1 question
Logs
1 question
Success Rate
1 question
Closest Room
1 question
Pond
1 question
Merge Sort
04:28
Merge Sort Code
12:41
Quick Sort
10:11
Quick Sort Code
00:21
Quick Select
04:33
Quick Select Code
03:04
Inversion Count
13:45
Inversion Count Code
04:05
Alice Problem
1 question
Reverse Pairs
1 question
Ternary Search
15:12
Ternary Search - Finding maxima/minima of a parabola (Code)
06:53
Bob and his Brother
1 question
Greedy Introduction
04:36
Indian Coin Change
04:48
Greedy vs DP
05:59
Activity Selection / Busyman
09:56
Baised Standings
07:03
Kingdom Defense
13:08
Bulbs
1 question
Minimum Number of Taps to Open
1 question
Make It Equal
1 question
Too Many Segments
1 question
Segment Intersections
1 question
Introduction
21:30
Subsums Code
06:44
Meet in the Middle
1 question
Xor-Paths
1 question
Introduction to Range Queries
00:02
Introduction and Structure
11:32
Building
05:26
Query
18:28
Update
08:48
Facts and Properties
10:31
Code
26:23
Range Xor Queries
1 question
Range Minimum Queries
1 question
Ashish and Bit Operations
1 question
Petya and Array
1 question
Array Stabilization
1 question
Introduction
11:25
Algorithm
15:02
Code
12:49
Bug and Code Continued
03:20
Flipping Coins
1 question
Xor on Segment
1 question
Structure
11:49
Query
13:33
Update
11:08
Code
12:20
Inversion Count (Multiple Ways of solving it)
07:12
Inversion Count Using Fenwick Tree
11:28
Inversion Count Using Fenwick Tree Code
05:41
Range Update Queries
1 question
Ashish and Aashika's Problem
1 question
Count of Smaller Numbers
1 question
Range Set Query
1 question
Subsequences
1 question
LEQ
1 question
Sqrt Decomposition Introduction
11:54
Range queries (Code)
09:58
DQUERY SPOJ using Mo's Algorithm
11:26
Sorting the queries according to MO's comparator
09:45
4 Pointers Technique
15:11
Code and Complexity of MO's Algorithm
20:01
DQUERY using Fenwick Tree
16:50
Little Elephant and Array
1 question
Powerful Array
1 question
Game Theory Introduction
00:03
Combinatorial Games
08:16
Take Away Games
16:31
Nim Game
1 question
Divisor Game
1 question
N and P positions
09:29
Lucky Number
1 question
Maximum number of coins
1 question
Game of Nim
09:46
Nim Sum
06:04
Applications of Nim Sum
24:56
Examples of Nim Games
16:50
Game of Bullets
1 question
Nim Game II
1 question
Stair Game
1 question
Graphs Introduction
00:02
Introduction
12:04
Graph Key Concepts
09:07
Adjacency List
08:42
Adjacency List
09:08
BFS Concept
06:43
BFS
07:15
DFS
04:18
DFS Code
05:40
Astronaut Pairs
1 question
Reconstruct Itinerary
1 question
Shortest Path
04:30
Shortest Path Code
06:10
Board Game
12:11
Board Game Code
19:30
Message Route
1 question
Word Ladder
1 question
Valid Bfs?
1 question
Trees
24:26
DFS on Trees
08:02
Subtree Problem
1 question
Cut'em All!
1 question
Tree Distances
1 question
DFS Trees and Backedges
09:06
DFS Tree and Backedges Code
16:40
LCA introduction
12:36
LCA Brute Force
16:11
LCA using Binary Lifting
38:42
Lowest Common Ancestor
1 question
Distance Queries
1 question
Path Xor
1 question
A maximum Path
1 question
Intro
18:41
Topological Sort
20:41
Restricted Permutation
1 question
Game Routes
1 question
SCC Theory
09:50
Condensed Component Graph
12:50
Kosaraju Algorithm for Strongly Connected Component
30:05
Kosaraju Algorithm Code
11:46
Connected Cities
1 question
GCD on Directed Path
1 question
DSU Introduction
04:19
DSU Data Structure
09:01
Union & Find Ops
07:02
DSU Implementation
13:16
Disjoint Set Union
1 question
Make Network Connected
1 question
Union By Rank
10:15
Path Compression
08:38
Dry Run
13:14
Make Palindrome
1 question
Sum of Maximum Weights
1 question
GCD Sort of an Array
1 question
Special Paths
1 question
Prim's Algorithm
19:32
Prim's Code
18:42
Kruskal's Algorithm
08:58
Kruskal's Code
13:37
Minimum Spanning Cost
1 question
Remove Maximum Number of Edges
1 question
Make it Connected
1 question
Build Roads
1 question
Ring MST
1 question
Shortest Path Introduction
07:52
Dijkstra's Algorithm
09:11
Dijkstra's Algorithm Code
14:53
Delay Time in Network
1 question
Dijkstra
1 question
Come Back Quickly
1 question
Bellman Ford Algorithm
33:08
Bellman Ford Code
09:10
Floyd Warshall Algorithm
29:34
Floyd Warshall Code
08:37
Cheapest Flight Within K Stops
1 question
Travel by Car
1 question
Blocked Roads
1 question
Introduction to Dynamic Programming
16:49
A Note About DP
05:04
N-K Ladders
12:47
N-K Ladders Top Down
04:10
N-K Ladders Bottom Up
08:07
Minimum Jums
07:27
Minimum Jumps Code
05:54
Longest Increasing Subsequence
06:46
Longest Increasing Subsequence Code
02:44
Box Stacking Problem
10:26
Box Stacking Code
09:44
Perfect Squares
1 question
Maximum Product Subarray
1 question
Find Two Non-overlapping Sub-arrays Each With Target Sum
1 question
Collecting Coins
1 question
Best Time to Buy and Sell Stock
1 question
Boredom
1 question
Sleeping Schedule
1 question
Palindrome Partitioning
1 question
Count All Possible Routes
1 question
Modulo Sum
1 question
Cherry Pickup
1 question
Barcode
1 question
Maximum Number of Events That Can Be Attended
1 question
Number of Ways to Wear Different Hats to Each Other
1 question
Minimum XOR Sum of Two Arrays
1 question
Numbers With Repeated Digits
1 question
Classy Numbers
1 question
Tree with Maximum Cost
1 question
Min Cost to Reach Destination
1 question
Maximum White Subtree
1 question
Terms and Definitions
14:45
Tabulation vs Memoisation
11:19
Frogs - 1
25:27
Frogs - 2
25:29
Vacation
21:50
Knapsack 1
26:02
Knapsack 2
40:53
LCS
26:41
LCS (code)
21:46
Longest Path
09:09
Longest Path (code)
07:42
Grid 1
09:20
Grid 1 (code)
04:10
Coins
07:49
Coins (code)
13:14
Sushi
15:21
Sushi (code)
13:48
Stones
13:30
Deque (first solution)
31:35
Deque (second solution)
10:43
Candies
27:02
Candies (code)
09:57
Slimes
13:13
Slimes (code)
18:03
Matching
08:11
Matching continued...
05:38
Matching (code)
20:18
Independent Set
22:43
Independent Set (code)
09:17
Flowers
18:27
Flowers using segment tree
05:42
Flowers (code)
19:52
Walk
16:53
Walk (code)
05:43
Digit Sum
17:40
Digit Sum (code)
18:23
Permutation
25:14
Permutation (Brute Force)
17:21
Permutation (code)
17:53
Introduction to Advanced Module!
00:02
Brute Force Pattern Matching using STL
10:59
Trie
30:57
Pattern Matching using Trie
13:14
Word Search
1 question
Ghost
1 question
Maximum Xor Queries
1 question
String Hashing - Polynomial Hash Function
13:51
Polynomial Hash Code
04:48
Rolling Hash / Rabin Karp Algorithm
09:26
Rabin Karp algorithm Code
12:29
Longest Common Path
1 question
Find Pattern
1 question
Introduction
07:11
Orientation of Points
07:21
Graham's Scan algorithm
20:48
Graham's Scan Algorithm Code
23:57
Problem - Polygon (Codeforces)
06:57
Erect the Fence
1 question
Introduction
21:19
Codeforces - Guess the Number
13:00
Guess the Number - code
06:45
Lost Numbers
10:40
Lost Numbers (code)
08:34
Xor Guessing
09:38
Xor Guessing (code)
04:48
Randomised Random Function
09:56
Run Code for a Particular Time
07:55
Introduction & Applications
08:29
Structure and Working
13:16
Using Coding Minutes IDE
08:39
Inversion Count using PBDS
14:27
Getting started with Codeforces / Spoj
14:27
Where to practice?
07:09
Viết Bình Luận
Khoá học liên quan
Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!
Get khoá học giá rẻ ngay trước khi bị fix.
Đánh giá của học viên
Bình luận khách hàng