When using Python3 for the "Flipping Cards" problem 2SAT solution could work but since python has a recurison limit it might overflow the memory limit when compleating DFS. Its best to use DSU (Disjoin Set Union) data structure and check if at any moment when creating the graph the number of edges is higher than the number of vertices considering the cards as edges and pictures as vertices.