Striver's CP Sheet - Ace Interviews

Last updated : December 13, 2025

Striver’s CP Sheet (Solely for preparing for Coding Rounds of Top Product Based Companies and to do well in Coding Sites and Competitions).

Disclaimer: If it gets tough, consider doing the SDE sheet to grasp the concepts thoroughly.

Recommended Way of Doing: Solve easy problems of all topics, then medium, and finally hard ones.

Overall Progress0/298

Progress

Calendar + Roadmap

Daily Planner

Sessions

Striver's CP Sheet - Ace Interviews

Last updated : December 13, 2025

Striver’s CP Sheet (Solely for preparing for Coding Rounds of Top Product Based Companies and to do well in Coding Sites and Competitions).

Disclaimer: If it gets tough, consider doing the SDE sheet to grasp the concepts thoroughly.

Recommended Way of Doing: Solve easy problems of all topics, then medium, and finally hard ones.

Overall Progress0/298

Progress

Calendar + Roadmap

Daily Planner

Sessions

Striver's CP Sheet - Ace Interviews

Implementation / Constructive0 / 50

Maths0 / 50

Binary Search0 / 12

Prime, Sieve, Prime Factorisation0 / 10

Bit Manipulation/Power Set0 / 11

Stack/Queues/PriorityQueues0 / 13

String Algorithms0 / 16

BFS0 / 1

Tree's0 / 7

LCA0 / 12

Graph Algorithms0 / 21

Matrix Exponentiation0 / 6

Trie0 / 8

Dynamic Programming0 / 34

Disjoint Set0 / 9

Sqrt Decomposition/ MO’s algo0 / 6

Fenwick Tree0 / 12

Segment Tree(lazy also included)0 / 14

Lazy propagation0 / 6

Striver's CP Sheet - Ace Interviews

Implementation / Constructive0 / 50

Maths0 / 50

Binary Search0 / 12

Prime, Sieve, Prime Factorisation0 / 10

Bit Manipulation/Power Set0 / 11

Stack/Queues/PriorityQueues0 / 13

String Algorithms0 / 16

BFS0 / 1

Tree's0 / 7

LCA0 / 12

Graph Algorithms0 / 21

Matrix Exponentiation0 / 6

Trie0 / 8

Dynamic Programming0 / 34

Disjoint Set0 / 9

Sqrt Decomposition/ MO’s algo0 / 6

Fenwick Tree0 / 12

Segment Tree(lazy also included)0 / 14

Lazy propagation0 / 6