Скачать или смотреть Generate all binary strings solved in JS | Explanation | GfG | POTD | Streak 304 | Tue, 30 Sep 2025

Generate all binary strings
Difficulty: Medium Accuracy: 63.9% Submissions: 39K+ Points: 4 Average Time: 20m

Given an integer n. You need to generate all the binary strings of n characters representing bits.

Note: Return the strings in ascending order.

Examples:

Input: n = 2
Output: [00, 01, 10, 11]
Explanation: As each position can be either 0 or 1, the total possible combinations are 4.
Input: n = 3
Output: [000, 001, 010, 011, 100, 101, 110, 111]
Explanation: As each position can be either 0 or 1, the total possible combinations are 8.

Constraints:
1 ≤ n ≤ 20
Expected Complexities
Time Complexity: O(n * 2^n)
Auxiliary Space: O(n)

#coding #GeeksforGeeks #ProblemOfTheDay #JavaScript

---
introduction:
name: "Jagadeesh Kumar S"
contact: "+91 73972 85837 | [email protected]"
description: "A problem-solving enthusiast passionate about coding challenges."

technical_achievements:
"Solved 100+ daily coding challenges on GeeksforGeeks"
"Ranked in the top 130 on SRM Institute of Science and Technology's GeeksforGeeks leaderboard"
"Maintained a 100+ day streak for Problem of the Day"

github:
contributions: "Solutions available at https://github.com/JKS-sys/Solution-T..."
---