LeetCode Questions
- 51 n queens
- 52 n queens ii
- 53 maximum subarray
- 54 spiral matrix
- 55 jump game
- 56 merge intervals
- 57 insert interval
- 58 length of last word
- 59 spiral matrix ii
- 60 permutation sequence
- 61 rotate list
- 62 unique paths
- 63 unique paths ii
- 64 minimum path sum
- 65 valid number
- 66 plus one
- 67 add binary
- 68 text justification
- 69 sqrtx
- 70 climbing stairs
- 71 simplify path
- 72 edit distance
- 73 set matrix zeroes
- 74 search a 2d matrix
- 75 sort colors
- 76 minimum window substring
- 77 combinations
- 78 subsets
- 79 word search
- 80 remove duplicates from sorted array ii
- 81 search in rotated sorted array ii
- 82 remove duplicates from sorted list ii
- 83 remove duplicates from sorted list
- 84 largest rectangle in histogram
- 85 maximal rectangle
- 86 partition list
- 87 scramble string
- 88 merge sorted array
- 89 gray code
- 90 subsets ii
- 91 decode ways
- 92 reverse linked list ii
- 93 restore ip addresses
- 94 binary tree inorder traversal
- 95 unique binary search trees ii
- 96 unique binary search trees
- 97 interleaving string
- 98 validate binary search tree
- 99 recover binary search tree
- 100 same tree
79. Word Search
Given an m x n board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where 'adjacent' cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Example 1: Input: board = [['A','B','C','E'],['S','F','C','S'],['A','D','E','E']], word = 'ABCCED' Output: true Example 2: Input: board = [['A','B','C','E'],['S','F','C','S'],['A','D','E','E']], word = 'SEE' Output: true Example 3: Input: board = [['A','B','C','E'],['S','F','C','S'],['A','D','E','E']], word = 'ABCB' Output: false Constraints: - m == board.length - n = board[i].length - 1 <= m, n <= 200 - 1 <= word.length <= 103 - board and word consists only of lowercase and uppercase English letters.
Word Count: 0
