UVA – 11452 – Dancing the Cheeky-Cheeky
Problem Name: Dancing the Cheeky-Cheeky
Judge: UVA
Algorithms & DS: Prefix Function, KMP
Problem Name: Dancing the Cheeky-Cheeky
Judge: UVA
Algorithms & DS: Prefix Function, KMP
Problem Name: Periodic Strings
Judge: UVA
Algorithms & DS: Prefix Function
Problem Name: LPS – Longest Palindromic Substring
Judge: SPOJ
Algorithms & DS: String Hashing, Binary Search
Problem Name: Shift The String
Judge: Codechef
Algorithms & DS: String Hashing, Rabin Karp
Problem Name: Palindromic characteristics
Judge: Codeforces
Algorithms & DS: String Hashing
Problem Name: ADACLEAN – Ada and Spring Cleaning
Judge: SPOJ
Algorithms & DS: String Hashing
Problem Name: The Gift Of Raksha Bandhan
Judge: Codechef
Algorithms & DS: String Hashing, Binary Search
Problem Name: Password
Judge: Codeforces
Algorithms & DS: String Hashing
Problem Name: Palindrome Degree
Judge: Codeforces
Algorithms & DS: String Hashing
Problem Name: Making Huge Palindromes
Judge: LightOJ
Algorithms & DS: String Hashing