#WSQ11 – Go Bananas

--Originally published at マルコ

What To Do

Write a function called find_bananas which receives a single parameter called filename (a string) and returns a positive integer which is the number of times the word (string) “banana” (or “BANANA” ) is found in the file. The banana can be any case (‘BaNana’ or ‘BANANA’ or ‘banana’, etc) and they can be “stuck together” like “banAnaBANANA” (that counts as two). Create your own test file (plain text) to check your work.

Featured image:

https://www.pixiv.net/member_illust.php?mode=medium&illust_id=52121901

WSQ 11 – Go Bananas

--Originally published at Programming

Hello everyone

For this week assigment we have to: Write a function called find_bananas which receives a single parameter called filename (a string) and returns a positive integer which is the number of times the word (string) “banana” (or “BANANA” ) is found in the file. The banana can be any case (‘BaNana’ or ‘BANANA’ or ‘banana’, etc) and they can be “stuck together” like “banAnaBANANA” (that counts as two).

Here is the code:

And this is how it runs:

WSQ11 – Go Bananas

--Originally published at Elu's Blog

For this assignment, these were my instructions:

This is what I came up with:

WSQ-11

--Originally published at Héctor Santillán

Desarrollar una función que reciba el nombre de un archivo e indique el número de veces que aparece “banana” en el texto, sin importar mayúsculas o minúsculas, o si está pegado a otra palabra o no.

Para desarrollar este programa me basé en mis conocimientos previos.

WSQ-11

--Originally published at Héctor Santillán

Para desarrollar este programa me basé en mis conocimientos previos.