**Time Duration**: 50 Minutes\n**Assessment Type** : 2 DSA Questions\n**Cutt-off for next round:** 60 Points\n\n**Question 1 : (75 Points)**\n\nYou are given a binary maze where every cell has an obstacle (denoted by 1) or free ( denoted by 0). \nYou are standing at (0,0) and want to reach (n-1,m-1) which is the last cell of the maze. \nYou can move from current cell to four directionally adjacent cells at a magintude of atmost K iff all cells from\ncurrent cell to that cell doesn\'t have obstacles!\n\nFind Minimum number of moves required to reach last cell starting from origin!\nIf its not possible to go to last cell, return -1.\n\n**Example 1:**\nMaze =\n[ 0 0 0 0]\n[ 0 1 1 0]\n\nk = 3\n\n**Answer** : 2 (Jump from (0,0) ->(0,3) -> (1,3) whichi s last cell. \n\n**Example 2** :\nMaze = \n[ 0 1 0 0 0 0 0 0 0 ]\n[ 1 0 0 0 0 0 0 0 0 ]\n[ 0 0 0 0 0 0 0 0 0 ]\n[ 0 0 0 0 0 0 0 0 0 ]\n\nk = 4\n\n**Answer** = -1 (We will not be able to move to any of the adjacent cells since we have obstacles on all paths!)\n\n\n\n\n\n\n**Question 2 : (50 Points)**\nYou are given dictionary of words as strings and given set of queries strings. \nReturn all words in dictionary  which are anagrams for current query in sorted order!!\n\n**Example :**\n\nDictionary : ["duel" , "speed" , "dule", "cars"]\nQueries :     ["spede" , "deul"]\n\n**Answer:**\n\n[\n\t[ "speed"],\n\t["duel" , "dule"]\n]\n\n

Time Duration: 50 Minutes\nAssessment Type : 2 DSA Questions\nCutt-off for next round: 60 Points\n\nQuestion 1 : (75 Points)\n\nYou are given a binary maze wher