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


Time Complexity: O(mn * 4^(k - 1)), m and n stand for width and height of matrix, k is the word size, Space Complexity: O(mn)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu