We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Tripartite Matching
  5. Discussions

Tripartite Matching

Sort by

recency

|

14 Discussions

|

  • yashparihar729
     + 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Tripartite Matching Problem Solution

  • mineman1012221
     + 0 comments

    Here is the solution of Tripartite Matching Click Here

  • thecodingsoluti2
     + 0 comments

    Here is problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-tripartite-matching-problem-solution.html

  • bhautikbhalala41
     + 1 comment

    https://zeroplusfour.com/tripartite-matching-hackerrank-solution/

    Here's how I did in all languages Java 8 , C++ , C , Python 3, Python 2.

  • TChalla
     + 0 comments
    import sys

def main():
    N = int(sys.stdin.readline())
    M = []
    G = []
    for i in range(3):
        M.append(int(sys.stdin.readline()))
        G.append([set() for _ in range(N)])
        for _ in range(M[i]):
            u, v = map(int, sys.stdin.readline().split())
            u, v = u - 1, v - 1
            G[i][u].add(v)
            G[i][v].add(u)
    cpt = 0
    for a in range(N):
        for b in G[0][a]:
            for c in G[1][b]:
                if a in G[2][c]:
                    #print a,b,c
                    cpt += 1
    print(cpt)

main()