Attention please! CONTEST!
Do you know that the ability to solve algorithmic problems is very useful while working as QA Engineer? Have you ever considered your career in automated tests?
Stand up to the challenge and join our competition! Solve two tasks which no candidate for a QA position should have any problems with.
Task no 1: Write a method which returns an n-th element of the Fibonacci sequence. The solution needs to be an iterative method.
Taks no 2: We have a two-dimensional array of characters 10x10. The array is filled with characters "*" (asterisk) or "." (dot). Write a program which calculates occurances of the following patterns in the array:
Task no 3 – it’s a task for the creative. Please say why you think "It's O.K. to be a QA".
We are waiting for your answers until Monday, November 13. Send them to firstname.lastname@example.org
The awards are 5 free cinema guest passes and our pendrives.
Needless to say, only correct (Task 1 and 2) and the most creative (Task 3) answers win!
Ready... Steady... GO! Good luck!