Pull Request Template

Description

Given an m x n grid of characters board and a string word, return true if 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. Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED" Output: true My Approach - Using backtracking and DFS to solve the problem. As soon as we find the first letter of the word in any cell. We will start moving forward recursively until we find the entire word, otherwise we will backtrack and traverse other possible paths.

Put check marks:

Have you made changes in README file ?

• [x] Added problem & solution under correct topic.
• [x] Specified Space & Time complexity.
• [x] Specified difficulty level, tag & Note(if any).

How Has This Been Tested?

Please describe the tests that you ran to verify your changes. Please also note any relevant details for your test configuration.

• [x] Test A
• [x] Test B

Make sure all below guidelines are followed else PR will get Reject:

• [x] My code follows the style guidelines of this project
• [x] I have performed a self-review of my own code
• [x] I have commented my code so that it is easy to understand
• [x] I have made corresponding changes to the documentation
• [x] My changes generate no new warnings
• [x] Any dependent changes have been merged and published in downstream modules

I can tell this is your first pull request! Thank you I'm so honored. :tada::tada::tada: I'll take a look at it ASAP!