I am an eight letter word and I am a computer terminology.
The second, third and fourth letters make an animal.
The fourth, fifth, sixth, seventh and eighth letters make a weapon.
The first, second, third and fourth letters can be taken as an outcome of any exam.
The fifth, sixth, seventh and eighth letter combine to form a high end typing software.

Can you tell who am I ?

If Japan and Panama decided to merge into a single country, probably people will name it Japanama.

Can you think of two more such country's unions that could produce similar names like Japanama by overlapping their three letters?

In the four images below, can you find the odd one out?

What is the next number in this matchsticks series riddle?

Complete the given grid with valid words. You can only use the letters AAEEIIMMPPTT.

Hint: The grid reads the same across as down.

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?

Most people think of me as money. But when they find me in the water, they won’t get any money out of me. What am I?

A game is being played where eight players can last for thirty-five minutes. Six substitutes alternate with each player in this game. Thus, all players are on the pitch for the same amount of time including the substitutes.

For how long is each player on the pitch?

Can you solve this picture maths equation?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?