Pagini recente » Master - in tara, in afara sau deloc | Diferente pentru blog/algoritmiada-2018 intre reviziile 7 si 6 | Diferente pentru blog/algoritmiada-2015 intre reviziile 9 si 8 | Diferente pentru blog/algoritmiada-2013 intre reviziile 8 si 7 | Diferente pentru blog/rolling-hash intre reviziile 7 si 8
Nu exista diferente intre titluri.
Diferente intre continut:
# Given two equal length strings, figure out if one is a rotation of the other. O(n)
# Given two polygons find out if they are similar polygons. O(n)
# Given a string, find it's longest periodic prefix. O(n log n) For aaabaaabcde the answer is aaabaaab
# Given a tree T with character labeled nodes and a given string P count how many downward a paths matching P. O(n)
# Given a tree T with character labeled nodes and a given string P count how many downward paths match P. O(n)
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.
