Wordboggle.cpp

Question description added

Author: paurush11

Data Structures/Graphs/WordBoggle.cpp

@@ -1,3 +1,40 @@
+// Given a dictionary of distinct words and an M x N board where every cell has one character. Find all possible words from the dictionary that can be formed by a sequence of adjacent characters on the board. We can move to any of 8 adjacent characters, but a word should not have multiple instances of the same cell.
+// Example 1:
+
+// Input:
+// N = 1
+// dictionary = {"CAT"}
+// R = 3, C = 3
+// board = {{C,A,P},{A,N,D},{T,I,E}}
+// Output:
+// CAT
+// Explanation:
+// C A P
+// A N D
+// T I E
+// Words we got is denoted using same color.
+// Example 2:
+
+// Input:
+// N = 4
+// dictionary = {"GEEKS","FOR","QUIZ","GO"}
+// R = 3, C = 3
+// board = {{G,I,Z},{U,E,K},{Q,S,E}}
+// Output:
+// GEEKS QUIZ
+// Explanation:
+// G I Z
+// U E K
+// Q S E
+// Words we got is denoted using same color.
+
+// Companies
+// Amazon Directi Facebook Google MakeMyTrip Microsoft Nvidia Yahoo
+
+// Expected Time Complexity: O(NW + RC^2)
+// Expected Auxiliary Space: O(NW + RC)
+------------------------------------------------------------
+
 #include<bits/stdc++.h>
 using namespace std;