Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!
Recursion-1 > countPairs
prev | next | chance
We'll say that a "pair" in a string is two instances of a char separated by a char. So "AxA" the A's make a pair. Pair's can overlap, so "AxAxA" contains 3 pairs -- 2 for A and 1 for x. Recursively compute the number of pairs in the given string.
countPairs("axa") → 1
countPairs("axax") → 2
countPairs("axbx") → 1
|Apache Camel - Unable to propagate JMS Header Properties between Request - Response||3||16|
|Selenium and Interactive Data Language||3||53|
|add projects t working set in maven||2||38|
|Problems moving Excel files from local drive to server||4||26|