Gary Code, is a LeetCode problem from math subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem Gary Code at LeetCode


the order and prepending 1 to each number's binary representation

Time Complexity: O(n), Space Complexity: O(2^n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu