**1. Given a binary tree print it\'s vertical order traversal**\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/\n\n**2.Given a 2D matrix consisting of characters - \'#\', \'&\', \'S\' and \'D\'.**\n**S denotes the source, D denotes the destination, & denotes blocked areas and # denotes allowed areas. Find the shortest path from source to destination. UP / DOWN / LEFT / RIGHT moves are allowed.**\n\n```\nExample Matrix:-\n[[\'S\',\'#\',\'#\'],\n[\'#\',\'&\',\'#\'],\n[\'&\',\'#\',\'D\']]\n\nAnswer:- 4\n```

1. Given a binary tree print it\'s vertical order traversal\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/\n\n2.Given a 2D matrix consisti