Word Search II, is a LeetCode problem from graphs subdomain. This problem has also been asked in companies like Airbnb during the interview. 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 Search II at LeetCode


with the help of Trie

Time Complexity: O(mn^2), m is the longest length fo a word in words

Space Complexity: O(n^2)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu