Daily Challenge #31

Discuss
1

Next Letters

Create a procedure that takes a parameter, modifies it and returns using this algorithm:

  1. Replaces every letter in the string with the next letter in alphabet (e.g. c becomes d, z becomes a).
  2. Checks modified string and determine if it contains vowels (a, e, i, o, u) and if so, capitalizes the vowels.

Examples:

nextLetters(hello3) → Ifmmp3
nextLetters(fun times!) → gvO Ujnft!

6 Likes
2

Somehow I am able to do it :sweat_smile:

blocks%20(38)
blocks%20(38)1281×615 62.1 KB

4 Likes
3

Great. Show output also

1 Like
4

Here it is:

11-18_59_57
11-18_59_571366×625 51.4 KB

2 Likes
5

Great job @vknow360 . Also, take a look at below. Does that give you (or others) idea for other possible solutions?

image
image226×107 3.68 KB

1 Like
6

Look up in pairs?

1 Like
7

@Italo Block below is only for purpose of illustration and needs fine-tuning.
Basically, lookup the character in list1. If it exists, using FOUND-index, get its associated entry in list2 Notice that list2 is one-off from list1

image
image1101×377 47.8 KB

2 Likes
8

Very clever solution!

Also I didn’t think of using look up in pairs. It allows you to change the coding to something totally random every time you want.

I also like how @vknow360 coded a whole procedure without using the look up in pairs block. It helps develop the coding skills.

3 Likes
9

This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.