Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 582 |

@rdakka | 534 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given a number **N**, generate bit patterns from 0 to 2^N-1 such that successive patterns differ by one bit.

**Input:**
N = 2
**Output: **
00 01 11 10
**Explanation: **
00 and 01 differ by one bit.
01 and 11 differ by one bit.
11 and 10 also differ by one bit.

**Input:**
N=3
**Output:**
000 001 011 010 110 111 101 100
**Explanation:**
000 and 001 differ by one bit.
001 and 011 differ by one bit.
011 and 010 differ by one bit.
Similarly, every successive pattern
differs by one bit.

You don't need to read input or print anything. Your task is to complete the function **graycode() **which takes an integer N as input and returns a la list of patterns.

1<=N<=16

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Gray Code

...