{"id":1834,"date":"2020-07-01T09:37:46","date_gmt":"2020-07-01T09:37:46","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=1834"},"modified":"2022-03-22T06:09:49","modified_gmt":"2022-03-22T06:09:49","slug":"binary-queue","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/binary-queue\/","title":{"rendered":"Binary Queue"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used:<\/h3>\n
\n

Queues.<\/p>\n<\/blockquote>\n

Difficulty Level:<\/h3>\n
\n

Medium.<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

Given a number N, print all possible binary numbers with decimal values from 1 to N, but the catch is you have to do this using queue data structure and not recursion. <\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

Test Case:<\/h4>\n
Input:\n2\n4\n5\n\nOutput:\n1 10 11 100\n1 10 11 100 101<\/code><\/pre>\n
Solving Approach:<\/h3>\n
Bruteforce Approach:<\/strong><\/p>\n
\n
    \n
  1. Run a loop from 1 to N and call decimal to binary inside the loop.<\/li>\n
  2. Print all the binary numbers in a single line.<\/li>\n<\/ol>\n<\/blockquote>\n
    Efficient Approach(Using queue):<\/strong><\/p>\n
    \n
      \n
    1. Create an empty queue of strings.<\/li>\n
    2. Enqueue 1,since it is the first binary number.<\/li>\n
    3. Deque the value a and print it.<\/li>\n
    4. Initialize string temp with a.<\/li>\n
    5. Append "0" to string a and enqueue it to the queue.<\/li>\n
    6. Append "1" to string temp and enqueue it to the queue.<\/li>\n
    7. Repeat steps 3 to 8 until the end value.<\/li>\n<\/ol>\n<\/blockquote>\n
      Solutions<\/h3>\n
      \t\t\t\t\t\t