35 тысяч подписчиков
142 видео
Introduction to Graph Theory
What is Bitmasking
Square Root Decomposition with Code
Career Update: Software Engineer at Google!
Codeforces Round
Google Coding Interview Problem: Dynamic Programming
Writing Good Technical Documents!
CSES DP: Counting Numbers
Codeforces Round 890 | Problem C: To Make Max | Binary Search, Constructive Algorithms
Use leetcode effectively! ft.
Digit Dynamic Programming: Problem 2 | Google Kick Start 2020 problem
CSES Dynamic Programming: Counting Towers
Top YouTube Channels for CP | Trying out Youtube Shorts
Codeforces CP sheets?
Codeforces Round 700 | Problem C | Searching Local Minimum
Dynamic Programming: Assembly-line Scheduling
Codeforces round 703: Guessing the Greatest C2
Sublime text setup for Competitive Programming
Disjoint Set Data Structures | Union Find | DSU | Range Query
Dynamic Programming : Array Description
Google Kick Start Round G, 2020: Editorial | All problems
Rod Cutting Problem: Live lecture on DP
DP with Bitmasking #1
DSU | SPOJ Problem | Generic Implementation | Walkthrough
Codeforces Round 684: Problem C1 and C2
Fermat's little theorem and it's applications
Practice Effectively! When to look at the solution?
LeetCode Weekly Contest 282 | Minimum Time to Complete Trips
Kartik's CF Specialist Sheet: 1400 and Beyond!
Podcast with Gaurav Sen: Interviewing, competitive programming and software engineering
Bridges and Articulation Points | Bridge finding algorithm in Graphs
Map Solution AC but Unordered Map TLE? map v/s unordered map!
Codeforces Educational 151 Problem C | DP Algorithms | Problem Solving
Matrix Exponentiation (with examples) | Throwing Dice | CSES maths
DP with Bitmasking: Counting Tiling
Probability and Expected Values | Definition with Examples and Code
Dynamic Programming : Grid Paths
Introduction to Digit Dynamic Programming
Kartik's CF Specialist Series: Problem#1 | Challenging Cliffs
Kartik Challenges
Development and ML Projects for competitive programmers!
let's learn DSU
DFS Tree Representation of Graph: Find cycles, articulation points and solve hard problems
Kartik's CF Specialist Series: Problem#2 | Pleasant Pairs
Codeforces Round 889 | C1 & C2 Dual Hard Version | Constructive Algorithms
Codeforces Pinely Round: C Set Construction
Kartik's CF Expert Sheet: CP Rating To the Moon!
