Analytics Case

Given pairs of characters, evaluate if all the characters could be split into two sets so that the graph is a bipartite

Data Scientist

Microsoft

SAP Concur

ServiceNow

Nubank

Etsy

Envoy

Did you come across this question in an interview?

Loading step...
Your answer

Try Free AI Interview

Google logo

Google

Product Manager

Prepare for success with realistic, role-specific interview simulations.

Product Strategy
Meta logo

Meta

Product Manager

Prepare for success with realistic, role-specific interview simulations.

Product Sense
Meta logo

Meta

Engineering Manager

Prepare for success with realistic, role-specific interview simulations.

System Design
Amazon logo

Amazon

Data Scientist

Prepare for success with realistic, role-specific interview simulations.

Behavioral
  • Given pairs of characters, evaluate if all the characters could be split into two sets so that the graph is a bipartite
  • Could we possibly split characters X and Y into two different sets so that the graph becomes a bipartite? X is connected to Z. Y is connected to Z. X is connected to Y.
  • W, X, Y, Z are characters that are linked together. W is linked to X. W is linked to Y. Y is linked to Z. X is linked to Z. Is it possible to split all four characters into two sets so that the graph creates a bipartite?
  • M is linked to N. M is linked to O. N is linked to O. P is not connected to any other characters. Can the four characters be organized into two different sets, separating connected pairs and forming a bipartite graph?
  • Characters A, B, C, D are linked in pairs. A is linked to C. B is linked to D. A and D share a connection. Can all four characters be separated into two sets so that the graph is bipartite?
  • T and U are connected by a link. U and V are connected by a link. V and W are connected by a link. Is it possible to separate these four characters into two sets where the graph will be bipartite?
  • K, L, M, and N are linked to each other in such a way that K is linked to L, L is linked to M, M is linked to N, and N is linked to K. Can K, L, M, and N be separated into two sets where the graph will be bipartite?
  • Characters A, B, C, D are linked such that A is linked to B, A is linked to C, C is linked to D, and B is linked to D. Can these four characters be separated into two sets such that the graph is bipartite?
  • E, F, G, H, and I are all characters linked together. E is linked to F, E is linked to G, G is linked to H, G is linked to I. Can these characters be separated into two sets so that the graph will be a bipartite?
  • S, T, U, V, and W are characters linked together. S is linked to T. T is linked to U. U is linked to V. V is linked to W. Can these five characters be separated into two sets so that the graph is bipartite?
  • Characters A and B are connected. Characters C and D are connected. Characters B and C are connected. Can all the characters be split into two sets so that the graph is a bipartite?

Interview question asked to Data Scientists interviewing at Coursera, Twitter, Citrix and others: Given pairs of characters, evaluate if all the characters could be split into two sets so that the graph is a bipartite.