Development and ML Projects for competitive programmers!

Kartik's CF Specialist Series: Problem#2 | Pleasant Pairs

Kartik's CF Specialist Series: Problem#1 | Challenging Cliffs

Codeforces Round #902 Div2 - A, B, C and D | Editorial and Code Walkthrough

Codeforces Div1 - Quantity of Strings | DSU

let's learn DSU #disjointsets #datastructures #coding

DSU | SPOJ Problem | Generic Implementation | Walkthrough

Disjoint Set Data Structures | Union Find | DSU | Range Query

Codeforces Round 890 | Problem C: To Make Max | Binary Search, Constructive Algorithms

Codeforces Round 889 | C1 & C2 Dual Hard Version | Constructive Algorithms

Codeforces Educational 151 Problem C | DP Algorithms | Problem Solving

Codeforces Pinely Round: C Set Construction

Writing Good Technical Documents!

Career Update: Software Engineer at Google!

LeetCode Weekly Contest 282 | Minimum Time to Complete Trips

Kartik Challenges @gkcs: Let's Solve a Hard CF problem!

Bridges and Articulation Points | Bridge finding algorithm in Graphs

DFS Tree Representation of Graph: Find cycles, articulation points and solve hard problems

Kartik's CF Specialist Sheet: 1400 and Beyond!

Codeforces CP sheets? #shorts

Map Solution AC but Unordered Map TLE? map v/s unordered map!

Kartik's CF Expert Sheet: CP Rating To the Moon!

Development and ML Projects for competitive programmers!

Practice Effectively! When to look at the solution?

Matrix Exponentiation (by apna candidate master)