SDE - Intern

We know that the address of the Internet resource has format:

<protocol>://<domain>.ru[/<context>]
where,

1. <protocol> can either be equal to "http" (without the quotes) or "ftp" (without the quotes)
2. <domain> is a non-empty string, consisting of lowercase English letters,  
3. The /<context> part may not be present. If it is present, then <context> is a non-empty string, consisting of lowercase English letters. 

If string isn't present in the address, then the additional character "/" isn't written. Thus, the address has either two characters "/" (the ones that go before the domain), or three (an extra one in front of the context).

For example,

'http://sun.ru/sunm', and 'ftp://guj.ru' are the valid address.

Given a string S, which contains all lower case characters without any punctuation marks (":", "/", "."), you have to find out and print the internet resource address.

You are given an undirected graph as an adjacency matrix consisting of 'v' vertices and an integer 'm'.

You need to return 'YES' if you can color the graph using at most 'm' colors so that no two adjacent vertices are the same. Else, return 'NO'.

For example:

Input:
If the given adjacency matrix is:
[0 1 0]
[1 0 1]
[0 1 0] and 'm' = 3.

Output: YES

Explanation:
The given adjacency matrix tells us that 1 is connected to 2 and 2 is connected to 3. We can use three different colors and color all three nodes.
Hence we return true.

You are given ‘N’ fences. Your task is to find the total number of ways to paint fences using 2 colors only such that at most 2 adjacent fences are painted with the same color.

As the answer can be too large, return the answer modulo 10^9 + 7.

For Example:

Consider If N = 2, then there can be 4 different ways to color fences such that at most 2 adjacent fences have the same color-:
[ [0, 1],
  [1, 0],
  [1, 1],
  [0, 0] ]
Hence, the answer is 4.