In this video, we will solve Q3 of leetcode biweekly contest 181 i.e. Count Connected Subgraphs with Even Node Sum (Leetcode 3910) step by step.
📌 Approaches covered: Brute Force
Enumerate all subsets of nodes, and for each subset, check if it forms a connected subgraph using DFS and has an even sum.
Problem : Count Connected Subgraphs with Even Node Sum
My solutions on Github (C++ & JAVA) : https://github.com/pragya9460/Leetcode/blob/main/Leetcode_contest/Biweekly_Contest_181/3_Count_Connected_Subgraphs_with_Even_Node_Sum.java
Leetcode Link: https://leetcode.com/problems/count-connected-subgraphs-with-even-node-sum/
Lets code with pragya
3910. Count Connected Subgraphs with Even Node Sum
Count Connected Subgraphs with Even Node Sum
Leetcode today
My leetcode playlist: https://www.youtube.com/watch?v=kKswOr7jWpc&list=PL78swWyrkuHkUI9JVwJj_ltxxw_34MaIq&index=1
#leetcode #dsa #javaprogramming #cpp #softwareengineer #programming #array #leetcode #codewithpragya #codinginterview #practice #interview #contest #biweekly #beginners #dfs #bitmasking #graph
