Possible Attack-1
Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N integers print all possible combinations. See original problem statement here Solution Approach : Introduction : Idea is to...
M Coloring Problem
Given an undirected graph and M colors, the problem is to find if it is possible to color the graph with at most M colors or not. See original problem...
Furious Teacher
Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N, count all the numbers with unique digits less than 10n. See original problem statement here Solution Approach :...
Check SumTree
Concepts Used DFS , Recursion Difficulty Level Hard Problem Statement : "A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes...