Unique paths covering every non-obstacle block exactly once in a grid.Print all possible paths from top left to bottom right of a mXn matrix.Count all possible paths from top left to bottom right of a mXn matrix.Count number of ways to reach destination in a Maze.The Knight’s tour problem | Backtracking-1.Warnsdorff’s algorithm for Knight’s tour problem.Printing all solutions in N-Queen Problem.Insertion in a Binary Tree in level order. Handshaking Lemma and Interesting Tree Properties.Binary Tree | Set 3 (Types of Binary Tree).Overview of Data Structures | Set 2 (Binary Tree, BST, Heap and Hash).Overview of Data Structures | Set 1 (Linear Data Structures).Check whether the number has only first and last bits set | Set 2.ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |