interesting-problems.txt (207B)
1 dp 2 == 3 4 - minimax games 5 6 greedy 7 ====== 8 9 trees 10 ===== 11 12 graphs 13 ====== 14 15 strings 16 ======= 17 18 - given strings a,b,c, find the number of substrings of a,b,c that match d 19 - rabin can get busted 20 - minimum # of swaps