SDE - 1

You are given an integer, all you have to do is to find whether this number is a Fibonacci number or not.

Fn is said to be a Fibonacci sequence such that each number in Fn is the sum of its two preceding numbers, starting with 0 and 1.

Fn = F(n-1) + F(n-2)

fn is said to be a Fibonacci number if it is a part of the Fn/Fibonacci sequence.

You’re given a board of length 'L' and width 'W'. Your task is to break this board into 'L' * 'W' smaller squares, such that the total cost involved in breaking is the minimum possible.

NOTE:

The breaking cost of each edge for the board will be given.

Ninja has started a social networking site, Ninjas Space. There are a total of ‘N’ users and ‘M’ different types of languages on the social network in which users can communicate with each other if they know a common language. There are a total of ‘L’ friendships between users on the social network.

You have given a 2-dimensional array ‘LANGUAGES’ with ‘N’ rows and ‘M’ columns, where LANGUAGES[i][j] is equal to 1 if the user 'i+1' knows the language 'j+1'. Otherwise, LANGUAGES[i][j] is equal to 0. The friendships are given in a 2-dimensional array ‘FRIENDS’ of size ‘L’, in which FRIENDS[i] contains two users who are friends with each other on the social network. Ninja has decided to teach the same language to some users so all friends can communicate with each other. Your task is to find the minimum number of users Ninja needs to teach.

For example:

'LANGUAGES' = [[1,0,1],[0,0,1],[0,1,0]] and 'FRIENDS' =[[1,3],[2,3]], Ninja can teach the third language to the third user so all friends can communicate with each other. Hence, the answer is 1 in this case. 

What is virtual memory? 
Related questions on virtual memory , follow up questions on each answer.

What are Locks ?
What is transaction? Types, Uses

Design Facebook like application