Then map the number with its string of probable alphabets, i.e 2 with “abc”, 3 with “def” etc. So the idea is to form a recursive function. It can be observed that each digit can represent 3 to 4 different alphabets (apart from 0 and 1). Largest Sum Contiguous Subarray (Kadane's Algorithm)Īpproach: To solve the problem follow the below idea:.Write a program to reverse an array or string.Print Postorder traversal from given Inorder and Preorder traversals.Inorder Tree Traversal without recursion and without stack!.Inorder Tree Traversal without Recursion.Tree Traversals (Inorder, Preorder and Postorder).Breadth First Search or BFS for a Graph.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.Rat in a Maze | Backtracking using Stack.Java ArrayList to print all possible words from phone digits.Print all possible words from phone digits.Closest Palindrome Number (absolute difference Is min).Given a number, find the next smallest palindrome.Next higher palindromic number using the same set of digits. ![]() ![]() 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 |