Old fashioned cell phones were and are used heavily as texting platforms, unfortunately the keyboard has only 12 + a few buttons, and is therefor ill-suited to naive text entry.
Common solutions make use of the traditional telephone coding (generally with a modest extension for 'q' and 'z'):
2:...
so I have a (java) programming dilemma: I have separated input handling and graphics handling for my game into separate classes from the main one, and I have fields that I want to be mutable for one but no the other. Is there a way to only return not-a-deep-copy if a method is called from a certain class?
Found this picture on the web today. Being a lazy programmer, I don't want to actually open google and type a couple of characters. Way too much work! This is such an important task that it should be automated.
Challenge
Everyone knows that the first image in a google search result is always...
This is Round 2 in a series of challenges involving "the two best code-golfers in the world right now", Dennis♦︎︎︎ and Martin Ender♦︎︎︎. Here is Round 1, but these are different challenges, independent of each other.
As most of you know, Dennis' user id is 12012 and Martin's is 8478. There are...
so.. let's instead of computing where there is an exact match, report where the Hamming distance is exactly x, for some x specified as part of the question
@orlp so .. it tells you how much you can compress the outputs. Imagine you have a string of length n and another of length 2n-1 and we want to compress it so that you can still answer the question "Is the Hamming distance exactly 3 at alignment i"
this tells you how small the data structure could be
You may have heard of the "Hacker Logo", also called the "Hacker Emblem". It looks like this:
This is a pattern from a mathematical simulation called the Game of Life. The glider is the simplest Life pattern that moves, and the most instantly recognizable of all Life patterns.
The challenge
...
Does the nth char in a string equal the nth from last char in the string?
code-golf string
Inspired by Does the start equal the end
Given a string s and an integer n, output a truthy/falsey as to whether the nth char in s equals the nth from the end char in s.
Input
A non-empty string and an...