First you build an undirected graph in which users are vertex and friendships are edges.
After that you just have to say if the graph is bipartite.
Is quite easy actually, a graph is bipartite if and only if it has not odd length cycles.
http://en.wikipedia.org/wiki/Bipartite_graph

Helpful Answer?

Yes | No

Inappropriate?

To comment on this question, Sign In with Facebook or Sign Up

You might also be interested in: Interview Questions, Software Engineer Intern Interview Questions, Facebook Interview

Employees' Choice Winner: 2011, 2012

Facebook Overview

Facebook – Palo Alto – “Mobile phone testing”

Website www.facebook.com

HQ Menlo Park, CA

Industry

Internet Content Providers

Size

3,200+ Employees

Competitors

Microsoft, Apple, Google

Facebook – Why Work for Us?

Millions of people use Facebook everyday to keep up with friends, upload an unlimited number of photos, share links and videos, and learn more about the people they meet. The web is being rebuilt around people and… — Full Overview

Provided by employer [?]

Interviews by Company

Salaries by Company

Tags are like keywords that help categorize interview questions that have something in common.

About Us | Feedback | Help

Glassdoor ® is a registered trademark of Glassdoor, Inc.

Overview

Salaries

Reviews

Interviews

Photos

Jobs

Connections

349 Interview Reviews |

Interview Question for Software Engineer Intern at Facebook:

given the utitlies getFriend(User u) and areFriends(User u1, User u2), write the function which takes as parameter the array of users and return a bool saying if you can divide the users in 2 groups s.t. if u1 and u2 both belong to a certain group, they are not friends.

Answers & Comments (1)

Flag this {0} as inappropriate

Thank you!

Oops!