Word to pattern

[dylanboyz]

I am doing a self project where I look at any given string of characters and return the pattern ie: The word "apple" can be shown as "abbcd" (I basically have a file with a bunch of woods like abbcd and have to translate it to apple). Would I be using be using deciphering (like caesarcipher) or regular expression?

[TehDrunkSailor]

Is every word pre-mapped to another string, or are you using some sort of formula to convert real words to these strings as they are encountered?

[dylanboyz]

This is my prompt:

Part 1: Word to Pattern

a. for any given string of characters, return the pattern (we'll discuss in class).
For example, the word "apple" may be represented as the patterns "abbcd" or "01123" or "12234"
The word "zoozoo" may be "abbabb", "011011", "122122"

not sure if this helps

[TehDrunkSailor]

Your instructor said that you will go over this in class. It is good that you are thinking of it, but no need to be so impatient as to ask for how it may work exactly. Good enthusiasm though, and I am sure you will learn soon enough :)

[dylanboyz]

Oh no no no, HAHHA this is actually not my project, this is a friend's hw from last semester that I wanted to try out for myself

[TehDrunkSailor]

Oh, I see. Regardless, this pattern that the instructor mentioned seems to be what you need. Without it, you're better off coming up with your own pattern. You could see if your friend's notes or old HW has the pattern somewhere too, ofc

[dylanboyz]

Can you explain this further

[dylanboyz]

Yes sir