title: Finding combinations of binary numbers (matching 1's digits)
body: <p>Given a binary number, 
  What would be the algorithm to find all the matching binary numbers where all the 1's are corresponded to the given number.</p>
  
  <p>For example:
  Input: 10010
  output: [10010, 10011, 10110, 10111, 11010, 11011, 11110, 11111]</p>