2 Likes

it will be great if trainers can add other good problems on topics discussed in class , though it will be spoonfeeding but it will be of great help if they can
.

Problems that Karan discussed on Friday:

Avoiding Partitions

Tricky Case 2 2 1 1 1 2

Topological Ordering :

http://codeforces.com/gym/100792 Problem K

http://codeforces.com/gym/100801 Problem G

Graph

http://codeforces.com/gym/100253 Problem M

http://codeforces.com/gym/100540 Problem E

Bridges

https://icpc.kattis.com/problems/tours

http://codeforces.com/gym/100851 Problem B

3 Likes

Please add all the problems.These are just the problems discussed on friday.

For the last link it should be Problem C.

Try coding these during the morning slot of 28th:

Karthik’s:

https://community.topcoder.com/stat?c=problem_statement&pm=13359&rd=16076

https://community.topcoder.com/stat?c=problem_statement&pm=13219&rd=16077

https://community.topcoder.com/stat?c=problem_statement&pm=1931&rd=4709

Ajay’s:

Discussed Problems:

http://codeforces.com/contest/449/problem/D

Not discussed:

2 Likes

28th, Afternoon slot:

HLD:

And the problems linked to in that blog. We had discussed a version of QTREE, QTREE2 and QTREE6.

Centroid Decomposition:

http://codeforces.com/blog/entry/10533#comment-159119

We discussed QTREE5 and http://codeforces.com/blog/entry/10533?#comment-159115

3 Likes

29th:

DP Optimizations:

http://codeforces.com/blog/entry/8219

Divide and Conquer DP:

Knuth Optimization:

https://www.quora.com/What-is-Knuths-optimization-in-dynamic-programming

http://www.cs.ust.hk/mjg_lib/bibs/DPSu/DPSu.Files/p429-yao.pdf

Convex Hull Trick:

[CHT][1]

1D-1D:

Some relevant problems:

Commando APIO 2010

Exchange NOI 2007

Breaking Strings http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1860

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3983

Little G the poet NOI 2009

Holiday IOI 2014

Split The Sequence APIO 2014

http://blog.ezyang.com/2012/02/visualizing-range-trees/

Treaps (Not done):