👉 I am a 7 letter word.
👉 I like mornings
👉 If you remove my 1st letter you can drink me
👉 If you remove my 1st & 2nd letters 👉 you may not like me
👉 If you remove my last letter, you will see me on television
👉Answer is really very interesting
Let us see who solves this....
A girl rode into a tourist spot out of the city on Thursday. She loved the place and decided to stay for a few days. She stayed for four days and then she left for back home on Thursday.
There was once a troop of 5 elves. The 5 elves were very dedicated on finding the magical treasure of 1000 coins. However, being elves, they were super geniuses, very greedy and they did not hesitate in taking lives of other elves. The 5 elves were named Aye, Bee, Cee, Dee and Ee, ranked from high to low respectively, from Aye to Ee. One fine day, their efforts brought results and they found 1000 coins. Now they had to split it in between them as per their ranks. The lowest ranked elf has to make the proposal. If the proposal is accepted by majority, it is agreed, or the suggesting elf is killed.
If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.
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
