Word Ladder, 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 Word Ladder at LeetCode


the same as end word, then the path should be the shortest one.

Time Complexity: O(nm), Space Complexity: O(nm)

             n stands for # of words, m stands for length of a word

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu