Every words stands for unique digit that makes the arithmetic equation true

SEVEN + SEVEN + SIX = TWENTY.

What are the digits ?

I am a type of food that is often found in the fridge and can be white in colour. What I am?
Hint 1: I am a dairy product.
Hint 2: You can spread me on the bread.

What common phrase is represented by the below lines

Easy going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Medium going:
Weak, 'I'm going.'
Tough, 'I'm staying.'

Tough going:
Weak, 'I can't do it, I'm staying!'
Tough, 'Let's get going.'

Can you solve this tricky maths equation problem by replacing it? mark with the correct symbol?

19834 -----: 187
15921 -----: 153
17561 -----: 139
13734 -----: ???

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?

You are given 16 witch hats. The hats are divided in four different colours – red, blue, green and yellow. Every colour has been assigned to four hats. Now each of the hat will be glued with a label of an arithmetic sign – ‘+’, ‘-‘, ‘x’ or ‘/’. But you can label one sign only once on one colour. In such an arrangement, the hats can be uniquely defined by its colour and symbol.

Can you arrange all the 16 hats in a 4x4 grid in a fashion that no two rows and columns have a repetition of colour or sign?
We have arranged four hats in the below picture to assist you.

You have a basket containing ten apples. You have ten friends, who each desire an apple. You give each of your friends one apple.
Now all your friends have one apple each, yet there is an apple remaining in the basket.
How?

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

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?

The husband and wife were jogging in the morning. To match every two steps of the husband, the wife required three steps. If Both of them start with the here right foot. After how many steps do their left foot be together?