From 2a4f28bc6e6be2d8dbc4a3c6bda54fa5e1f1dc48 Mon Sep 17 00:00:00 2001
From: Megha1209 <51127835+Megha1209@users.noreply.github.com>
Date: Mon, 14 Oct 2019 11:50:31 +0530
Subject: [PATCH 1/2] WordSearch Leetcode

---
 Wordsearch.java | 49 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 Wordsearch.java

diff --git a/Wordsearch.java b/Wordsearch.java
new file mode 100644
index 0000000..5280599
--- /dev/null
+++ b/Wordsearch.java
@@ -0,0 +1,49 @@
+package sheetquestions;
+
+import java.util.Scanner;
+
+public class Wordsearch {
+	static int c = 0;
+
+	public static void main(String[] args) {
+		Scanner s = new Scanner(System.in);
+		char[][] arr = { { 'A', 'B', 'C', 'E' }
+		               , { 'S', 'F', 'C', 'S' },
+		                 { 'A', 'D', 'E', 'E' } };
+		String word = s.next();
+		char ch=word.charAt(0);
+		
+		for(int i=0;i<arr.length;i++) {
+			for(int j=0;j<arr[0].length;j++) {
+				if(arr[i][j]==ch) {
+					boolean[][] visited = new boolean[arr.length][arr[0].length];
+					wordsearch(arr, "", i, j, word, visited);
+				}
+			}
+		}
+		
+		
+		if (c == 1)
+			System.out.println("true");
+		else
+			System.out.println("false");
+	}
+
+	public static void wordsearch(char[][] board, String ans, int row, int col, String word, boolean[][] visited) {
+		if (ans.equals(word)) {
+			c = 1;
+			return;
+		}
+		if (row == board.length || col == board[0].length || row < 0 || col < 0 || visited[row][col]) {
+			return;
+		}
+		visited[row][col] = true;
+		char ch = board[row][col];
+		wordsearch(board, ans + ch, row + 1, col, word, visited);
+		wordsearch(board, ans + ch, row - 1, col, word, visited);
+		wordsearch(board, ans + ch, row, col + 1, word, visited);
+		wordsearch(board, ans + ch, row, col - 1, word, visited);
+		visited[row][col] = false;
+	}
+}
+

From 531a73477aae5a714fca6c070fa948d0721a48d2 Mon Sep 17 00:00:00 2001
From: Megha1209 <51127835+Megha1209@users.noreply.github.com>
Date: Mon, 14 Oct 2019 23:17:17 +0530
Subject: [PATCH 2/2] Word Search