![]() |
Weekly Problems #05 |
Pedro Ribeiro - DCC/FCUP |
This is one of 10 weekly problem sets. Each one is worth 12% of the grade of the "Submitted Implementation" evaluation criteria.
6 proposed problems (1st problem solved is worth 35%, 2nd one 30%, 3rd one 20% and 4th one 15% - see evaluation for details)
NOTE: SPOJ problems will be made available also on Mooshak from Dec 3 Dec 5
LIS - Longest Increasing Subsequence in O(n log n)
(LCS - Longest Common Subsequence on words with solution output)
Edit Distance variation
0-1 Knapsack variation
Coins Change - restricted amount of coins
Matrix Chain Multiplication variation
About the delivery:
Pedro Ribeiro - DCC/FCUP | Last update: