Solving Cracking the Safe in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: n = 1, k = 2
Output: "01"
Note: "10" will be accepted too.

Example 2:

Input: n = 2, k = 2
Output: "00110"
Note: "01100", "10011", "11001" will be accepted too.

Note:

See the full details of the problem Cracking the Safe at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go