|
- The Keyboard Shift Cipher - Code Golf Stack Exchange
Given the following input: An integer n where n gt; 0 A string s where s is not empty and s~=[0-9A-Z]+ (alpha-numeric capitals only) Using a standard, simplified QWERTY keyboard (as shown below):
- Help Alice fix her text! - Code Golf Stack Exchange
" ,mnbvcxz;lkjhgfdsa[poiuytrewq" is the entire keyboard, plus the shifted characters, plus two spaces, written in reverse (explained later) This string is pushed to the stack first, then: : # Flip the top two stack values, placing the keyboard string under the input ⊸⊗ # Replace characters in the input with their indices in the keyboard
- Fix my Fat Fingers - Code Golf Stack Exchange
Code Golf Challenge I have an isdue, my fingrrs are fat and I freqintly jave an isdue of ty[ing one keystrpke to the right on my kryboard I'm afraid the isdue is getyng worse anf worsr as time goe
- Given an input, move it along the keyboard by N characters
The Challenge: Given any input that can be typed on a keyboard, move the text along by N chars Here is the QWERTY keyboard to be used You can ignore the modifier keys (Shift, Caps, Enter, Delet
- code challenge - Print the QWERTY keyboard using keys that are as close . . .
Normally, challenges are scored in bytes, or sometimes Levenshtein distance, but for this one we're using keyboard distance -- the number of keys between the keys used to type the program (use the
- How long does it take to type this? - Code Golf Stack Exchange
Introduction I can type at a moderate pace, using the QWERTY keyboard layout But if a word like yellowwooddoor has a ton of repeated letters, it takes a bit longer to type it Even worse is when
- Programming with a Sporadic Shift Key - Code Golf Stack Exchange
There's something wrong with your keyboard The Shift key has a mind of its own Every time you type a character you have no idea whether it will come out shifted or not (though it is 50-50) Besid
- Is the word typeable with keys adjacent to each other?
CJam, 74 bytes l_1>]z["qwertyuiop asdfghjkl zxcvbnm "[__B>]z+s_W%+_]zsf{\#)}:*"Yes""No"? Try it online Explanation The general approach is to produce a big adjacency string containing every pair of adjacent keyboard characters and then check that every pair of adjacent input characters is contained in that string I'm quite happy with how I managed to build the adjacency string, which uses
|
|
|