Back to problems

Word Search II

Algorithm · Uber · Hard

Word Search II Coding interview, onsite software-engineering round, reported in April 2026. You are given a two-dimensional character array board along with an array of strings named words. Return every string from words that can be found in the board. A string is considered found when its letters can be traced through cells that share a horizontal or vertical edge. While building one word, no board position can be visited twice. Examples Example 1: Explanation: Each…

Checking your access…