Search Results

I wrote the following to check whether a string ends with a second string. function isEndOf(origin, target) { return (origin.substr(target.length * -1, target.length) === target); } Usage: isEnd …

I recently started replaying Final Fantasy XII. One of its optional bosses, Zalera, has, among others, the following mechanics: His attack sequence is Lv. 2 Sleep, Lv. 3 Disable, Lv. 4 Break and Lv. …

It's not fair that 1% of the users hold 75% of the lolcode questions. #OccupyMatsMug ~ user2296177 I agree. Without further ado, here's the LOLCODE version of 99 bottles of beer on the wall: …

The challenge is simple: Return the length of the longest word in the provided sentence. The solution is just as simple: function findLongestWord(str) { arr = str.split(' '); size = 0; fo …

Vogel612 and I decided to take a shot at the StackSTV challenge in Haskell. This is part of the CRitter Collaboration challenge. Except I don't know any Haskell. So let's try a FizzBuzz first! I'm qu …

Everyone knows "99 bottles of beer on the wall". Mat's Mug made a comment about mugs on the wall in The 2nd Monitor and I realized I never wrote a "beer on the wall" program. But that seemed way too …

Protein strings are constructed from these 20 symbols. Henceforth, the term genetic string will incorporate protein strings along with DNA strings and RNA strings. …

Output formatting: Input Format Every line of input will contain a String followed by an integer. Each String will have a maximum of 10 alphabetic characters, and each integer will be in th …

Today I stumbled upon CodinGame, a site with programming challenges. I'll describe one of them. ASCII art allows you to represent forms by using characters. To be precise, in our case, these forms …

Backstory I collect books. A lot of books. Whitepapers, (programming) cookbooks, transcripts, important letters, overviews, you name it. Usually in PDF, otherwise my house would be too small. To keep …

HackerRank currently has '7 days of JavaScript' going, a quick intro into the JavaScript language. Every day a couple of challenges will be made available. One of the challenges of today was this: …

Problem: HAMM Given two strings \$s\$ and \$t\$ of equal length, the Hamming distance between \$s\$ and \$t\$, denoted \$d_H(s,t)\$, is the number of corresponding symbols that differ in \$s\$ and … Given: Two DNA strings \$s\$ and \$t\$ of equal length (not exceeding 1 kbp). Return: The Hamming distance \$d_H(s,t)\$. …

This question is part of a series solving the Rosalind challenges. For the previous question in this series, see A sequence of mistakes. The repository with all my up-to-date solutions so far can be f …

The following code transforms multi-line input into the the Brainfuck equivalent. One line turns into one program. The resulting programs are split by newlines for readability. Brainf.cpp #include " …