Strobogrammatic Number II, is a LeetCode problem from graphs 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 Strobogrammatic Number II at LeetCode


starting from head and tail, and then move towards middle to cover all places.

Time Complexity: O(m^n), here m is 5; Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu