I'm trying to create a Caesar cypher decoder that takes in a coded message, looks for the most common letter used, assumes this letter is "e" (since it is the most commonly used letter), and then shifts the letters the correct amount of places until the whole message is decoded.
The coder only works with strings large enough to get a good reading on all the letters used, and rides on the hope that the string is an average sentence where "e" is used the most, but I'm not sure how to do this...
I'm new to Python and the first thing I thought of was to make a list of counters for each letter then check the number of instances each letter has in the string, adding 1 to whichever counter the letter works with. I don't know how to put this into code though...