# Codility Equi Task Solution in Modern Perl

Codility is one of the most common services used to apply test codes (for job applications, for example). Here you can find a task sample to pratice before try the real test. The present sample is the Equi Task, and the propose is very simple.

Imagine an array with N elements. There is a P value (0 <= P <= N) who solve the problem below?

``````A + A + ... + A[P−1] = A[P+1] + ... + A[N−2] + A[N−1].
``````

In other words, where is the equilibrium index of this array?

For example, consider the following array A consisting of N = 7 elements:

``````A = -7   A =  1   A = 5
A =  2   A = -4   A = 3
A =  0
``````

P = 3 is an equilibrium index of this array, because:

``````A + A + A = A + A + A
``````

The task is build one subroutine called equi who will receive the array should return the value of P, or -1 if there is no equilibrium index.

Easy? Well, there is another challenge: create a O(n) solution.

Here is my solution in Perl:

# Spell Correct in GNU AWK

Based on Peter Norvig Spell Correct

This is my version of the Norvig’s Spell Corrector in gnu awk.

Follow the code we can find 2 functions and 3 blocks of code. Awk is a oriented to data flow, I’m always reading something, in this case I read a huge file big.txt with many words. It is a good sample of word frequency distributions, the most common words should be present in more number than rare words.

Hello World!

# Mudando De Endereço

Foram centenas de posts desde que comecei a usar o blogspot como valvula de escape.

Agora adquiri um domínio próprio e estou usando o wordpress como engine de blog, com MediaWiki para salvar os posts mais importantes daqui.

Atualizem os seus feeds: pacman.blog.br, estou desativando este site. Obrigado a todos pela audiência :)