## c program to generate all strings of n bits ( Backtracking problem)

Write a c program to generate all strings of n bits by using recursive backtracking method.. For example if given size of an array is 3 then the output...

## what is power set explain with example

what is power set explain it with example? Let me ask one question. What is set? Answer is “a set is collection of distinct objects”. Now let us define...

## Advance uses of bit manipulation in competitive programming

In this blog post we will discuss some advance uses of bit manipulation in competitive programming. Kindly follow my previous two blog post for some basic refresh. (1) bit-manipulation-in-c...

## Some uses of bit manipulation in c or c++ programming

Some uses of bit manipulation in c or c++ programming is second blog series of “bit manipulation in c or c++“. how to check whether nth bit is set...

## bit manipulation in c

bit manipulation in c or c++ programming is an operation where we manipulate the bits or pattern of bits. In competitive programming if anyone is expert of manipulating bits...

## Permuting Two Arrays hackerrank solution

Permuting Two Arrays hackerrank solution. The problem is simple given at https://www.hackerrank.com/challenges/two-arrays . It requires sorting. we can use qsort standard library function. To know more about qsort visit...

## find largest island area using dfs

Given a 2D matrix filled with 0 and 1, where 0 represents water and 1 represents a land. find largest island area using dfs. An island is defined as...

## How to take inputs from file using freopen and scanf

In this blog post we will know how to take inputs from file using freopen and scanf in c and c++ program. Taking inputs from file is a basic...

## c program to print all possible combinations of given characters

write a c program to print all possible combinations of given characters. For example if given characters are then ,its all possible combinations are as...

## find longest increasing subsequence using recursion

write a recursive function to find longest increasing subsequence using recursion. For example if we have sequence of { 6, 3, 4, 5, 6, 9, 8 }. The longest...