Category Archives: Advanced Data Structure

Boggle | Set 2 (Using Trie)

Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character. Find all possible words that can be formed by a sequence of adjacent characters. Note that we can move to any of 8 adjacent characters, but a word should not have multiple instances… Read More »

Weighted Prefix Search

Given n strings and a weight associated with each string. The task is to find the maximum weight of string having the given prefix. Print “-1” if no string is present with given prefix. Examples: Input : s1 = “geeks”, w1 = 15 s2 = “geeksfor”, w2 = 30 s3 = “geeksforgeeks”, w3 = 45… Read More »