Skip to main content
Side panel
DL 1
Home
Support
User support
GDPR
More
English (en)
Čeština (cs)
Deutsch (de)
English (en)
Français (fr)
Русский (ru)
You are currently using guest access
Log in
DL 1
Home
Support
Collapse
Expand
User support
GDPR
Expand all
Collapse all
Open course index
Faculty of Mathematics and Physics
Department of Applied Mathematics
Algorithms and Datastructures I English
Last homework
Last homework
Section outline
◄
Dynamic programming
Select activity Longest non-repeating subsequence
Longest non-repeating subsequence
Assignment
Completion
Students must
Mark as done
◄
Dynamic programming
Jump to...
Main course page
Model of comptuation, time and space complexity
Graph search algorithms (BFS and DFS)
Shortest paths in valued graphs
Minimum spanning trees
Union-find
Data-structures for sets
Hash tables
Divide and Conquer
Sorting
Dynamic programming