Find The Website Hacker

Tarang football website was hacked by one of the players. Jack, the coach of Tarang has pointed out five players as the possible hacker.
Each suspected player made three statements from each suspected player and out of which two are true and one is false.

Joseph
A) I have not hacked the website.
B) I know nothing about hacking.
C) John did it.

Hazard
A) I have not hacked the website.
B) The website was attacked by one of the players.
C) I hate Shelly

Remy
A) I have not hacked the website.
B) I have never seen Oscar in my entire life.
C) I am sure John did it.

John
A) I have not hacked the website.
B) I am sure Oscar did it.
C) Joseph was lying when he said he did it.

Oscar
A) I have not hacked the website.
B) I am sure Hazard did it.
C) I used to be friend with Remy.

So who hacked the website?




Similar Riddles

I can turn polar bears white.
I can make anyone dance.
I can make everyone cry
I can make your hands clap
I can make you thin.
I can make you smile.
I can make you smile

Can you guess the riddle?

Asked by Neha on 03 Jun 2024


In a classic wine shop, the list of three most popular wines are:
- The cost of 1 French wine bottle: 500$
- The cost of 1 German wine bottle: 100$
- The cost of 20 Dutch wine bottles: 100$

John entered the wine shop and he needs to buy
- All three types of wine bottles.
- Needs to buy Dutch wine bottles in multiples of 20.
- Need to buy 100 wine bottles in total.

John has only 10000$. How many wine bottles of each type, John must buy?

Asked by Neha on 19 Aug 2023

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

Horse Race in Mexico

Asked by Neha on 24 Mar 2021


In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.

A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.

What is the name of the Flat?

Asked by Neha on 05 May 2021

I know a nine-letter word having only one vowel.
Do you ?

Asked by Neha on 19 Jun 2023

Can you find the company name in the pictogram below?

Find The Company

Asked by Neha on 09 Dec 2024


This was asked in an interview with Coa-Cola.

The interviewer has given me 100 marbles(50 white and 50 black) and two empty boxes.
He then told me that he will leave the room and i need to place all the marbles in two boxes.

And When he come back, he will draw a marble from any of the two box and if the marble is white I will be hired.

Also
* No box can be empty.
* All 100 marbles must be placed in one of the two boxes.

So what should I have done?

Asked by Neha on 29 Nov 2024

Two fathers and two sons went fishing one day. They were there the whole day and only caught 3 fish. One father said, that is enough for all of us, we will have one each. How can this be possible?

Asked by Neha on 17 May 2021

Why is it against the law for a man living in Delhi to be buried in Mumbai?

Asked by Neha on 20 Oct 2024


A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.

For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.

Can you find out how much did the youngest one receive?

Asked by Neha on 30 Sep 2024

Hot Articles

Amazing Facts

No Solution

In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki