2018年2月5日 · Given the following input: An integer n where n > 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):

2015年12月27日 · 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 ...

2016年12月13日 · Watch it run! This is a slightly modified version that updates as it runs so you can sorta see how it works. This is an outdated version since I haven't gotten around to re-recording it yet, but the general approach is identical. This is probably the longest V answer ever written. It certainly didn't help that V's interpreter is extremely slow. …

2021年7月1日 · When Alice was touch typing on her QWERTY keyboard (Figure 1), she accidentally shifted both of her hands rightwards by one key, so q became w, w became e, etc. (p became [). Spaces were not affected

2015年5月17日 · 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...

2018年10月10日 · The Challenge The goal of this challenge is to determine whether a given String can be typed using only one line of a standard UK QWERTY keyboard. This is code golf, so shortest solution in bytes...

2023年2月24日 · For challenges involving a keyboard or keyboard layouts, such as QWERTY and AZERTY.Q&A for programming puzzle enthusiasts and code golfers

Here's an interesting challenge... I want you to golf code that when executed will allow your input to be converted to mimic output as though you were typing on a DVORAK keyboard layout. The aim is...

2016年3月17日 · The three rows of the qwerty keyboard are qwertyuiop, asdfghjkl and zxcvbnm. Your task is to find the longest word that can be typed using only one row of the keyboard, from a given list of words.

2021年4月14日 · Deadfish, all 35 characters, 444 bytes Uses s, d, and c, which are allowed, plus i as an extra. 6 iisiiisiiiiic 7 iisiiisiiiiiic 8 iisiiisiiiiiiic 9 iiisdsdddddddc 0 iisiiisdc - iisiiisddddc = iiisdsdddc y iiisiisc u iiisiisddddc i iiisisiiiiic o iiisisiiiiiiiiiiic p iiisiisdddddddddc [ iiissiiiiiiiiiic ] iiisisdddddddc h iiisisiiiic j iiisisiiiiiic k iiisisiiiiiiic l iiisisiiiiiiiic ...