This challenge was a follow-up to an earlier challenge, titled "Palindromes Pairs - Coding Phase". In that earlier warmup ppc challenge, the goal was to write an algorithm to solve the following problem: given up to 1000 strings $latex s_i$, each of length at most 1000, count the number of pairs $latex (i, j)$ such… Continue reading Tokyo Westerns CTF 2017 – Palindromes Pairs (Challenge Phase)

## Tokyo Westerns CTF 2017 – Palindromes Pairs (Challenge Phase)

Advertisements