## BALANCED PARENTHESIS COUNT

CONCEPTS USED: Recursion and Backtracking. DIFFICULTY LEVEL: Medium. PROBLEM STATEMENT\$(\$SIMPLIFIED\$)\$: Rohan is now fond of balanced sequences, but suddenly he realized that he is in love with balanced parenthesis. Now...

## Tug of War

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a set of n integers, divide the set in two subsets of n/2 sizes each such that the difference...

## Unique Power Set

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given N integers print all the distinct power sets of the sequence in lexicographical order. See original problem statement here...

## Possible Numbers

Concepts Used Back Tracking Difficulty Level Easy Problem Statement : Given a string, we have to find total number of different sequences that can be formed using the letters in...

## Phone Number

Concepts Used Backtracking Difficulty Level Easy Problem Statement : Given a string containing numeric digits from 2 to 9 inclusive, return all possible letter combinations that the number could represent...

## Possible Attack-2

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given N integers print all distinct combinations. See original problem statement here Solution Approach : Introduction : Idea is to...

## Grey Code

Concepts Used Back Tracking Difficulty Level Hard Problem Statement : Given a non-negative integer n representing the total number of bits , we need to print the sequence of gray...

## Time Bits

Concepts Used Back Tracking Difficulty Level Easy Problem Statement : Given n set bits, we have to determine all the time that can be represented by those number of set...

## 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

Concepts Used Back Tracking Difficulty Level Medium Problem Statement : Given an undirected graph and M colors, the problem is to find if it is possible to color the graph...