Best riddles

cleanshort

Round on both ends

What is round on both ends and hi in the middle?
Ohio - The two 'o's are round with 'hi' in the middle.
89.81 %
41 votes

logicmath

24 from Spare Parts

Using only and all the numbers 3, 3, 7, 7, along with the arithmetic operations +,-,*, and /, can you come up with a calculation that gives the number 24? No decimal points allowed. [For example, to get the number 14, we could do 3 * (7 - (7 / 3))]
7 * ((3 / 7) + 3) = 24
89.81 %
41 votes

animalcleanfunny

Swimming in the ocean

If you were swimming in the ocean and a big alligator attacked you, what should you do?
Nothing. There are no alligators in the ocean.
89.81 %
41 votes

logicmath

Anagram Checker

Two words are anagrams if and only if they contain the exact same letters with the exact same frequency (for example, "name" and "mean" are anagrams, but "red" and "deer" are not). Given two strings S1 and S2, which each only contain the lowercase letters a through z, write a program to determine if S1 and S2 are anagrams. The program must have a running time of O(n + m), where n and m are the lengths of S1 and S2, respectively, and it must have O(1) (constant) space usage.
First create an array A of length 26, representing the counts of each letter of the alphabet, with each value initialized to 0. Iterate through each character in S1 and add 1 to the corresponding entry in A. Once this iteration is complete, A will contain the counts for the letters in S1. Then, iterate through each character in S2, and subtract 1 from each corresponding entry in A. Now, if the each entry in A is 0, then S1 and S2 are anagrams; otherwise, S1 and S2 aren't anagrams. Here is pseudocode for the procedure that was described: def areAnagrams(S1, S2) A = new Array(26) A.initializeValues(0) for each character in S1 arrayIndex = mapCharacterToNumber(character) //maps "a" to 0, "b" to 1, "c" to 2, etc... A[arrayIndex] += 1 end for each character in S2 arrayIndex = mapCharacterToNumber(character) A[arrayIndex] -= 1 end for (i = 0; i < 26; i++) if A[i] != 0 return false end end return true end
89.81 %
41 votes

logicshort

A boys name

Without looking at a calendar, within a minute name a boys name using 5 consecutive first letters of 5 consecutive months.
JASON - July August September October November.
89.81 %
41 votes

funnylogicshort

Telephone problem

A woman depended on a public telephone to make her calls, but it was usually out of order. Each day she reported this to the phone company, but nothing was done. Finally she came up with a fib that she told the phone company. The phone was fixed the next day. What did she tell them?
She told them that people were making calls without having to pay.
89.81 %
41 votes

animalfunnylogic

Black dog

A black dog stands in the middle of an intersection in a town painted black. None of the street lights are working due to a power failure caused by a storm. A car with two broken headlights drives towards the dog but turns in time to avoid hitting him. How could the driver have seen the dog in time?
It was daylight.
89.81 %
41 votes

funny

Dracula

Dracula’s going to the bank to keep his money, he seems a little more pale than usual, which bank did he go to?
A Blood Bank.
89.81 %
41 votes

cleanlogicshort

One word

Re-arrange the letters, O O U S W T D N E J R to spell just one word.
"Just one word".
89.81 %
41 votes