Source: High-Entropy Passphrases
Part 1: Given a list of passphrases, count how many contain no duplicate words.
Part 1: Given a list of passphrases, count how many contain no duplicate words.
Part 1: The input is a list of strings, potentially containing sequences in square brackets. Find all strings that have an ABBA sequence (two characters followed by the same two in reverse order) outside of any square brackets, but no ABBA sequences in square brackets.
Part 1: A room is described as a name, a sector ID, and a checksum as follows:
aaaaa-bbb-z-y-x-123[abxyz]
name: aaaaa-bbb-z-y-x sector ID: 123 checksum: abxyz
Today’s five minute post brought to you via Programming Praxis / Career Cup:
Given a positive integer, return all the ways that the integer can be represented by letters using the mapping 1 -> A, 2 -> B, …, 26 -> Z. For instance, the number 1234 can be represented by the words ABCD, AWD and LCD.
In one of my current research projects involving large amounts of Twitter data from a variety of countries, I came across an interesting problem. The Twitter stream is encoded as a series of JSON objects–each of which has been written out using ASCII characters. But not all of the Tweets (or even a majority in this case) can be represented with only ASCII. So what happens?
Well, it turns out that they encode the data as JSON strings with Unicode escape characters. So if we had the Russian hashtag #победазанами (victory is ours), that would be encoded as such:
"#\u043f\u043e\u0431\u0435\u0434\u0430\u0437\u0430\u043d\u0430\u043c\u0438"