K-th Smallest in Lexicographical Order, 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 K-th Smallest in Lexicographical Order at LeetCode

Solution

of children for each node, and keep minus until we get the right one

Note: Swift does not have a way to access a character in a string with O(1), 

  thus we have to first transfer the string to a character array

Time Complexity: O(n), Space Complexity: O(1)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu