It tells the computer to repeat the preceding character (or set of characters) for atleast one or more times(upto infinite). Example : The regular expression ab*c will give ac, abc, abbc, It tells the computer to match the preceding character (or set of characters) for 0 or more times (upto infinite). These symbols act as repeaters and tell the computer that the preceding character is to be used for more than just one time. vector::push_back() and vector::pop_back() in C++ STL.Overview of Data Structures | Set 1 (Linear Data Structures).Construct Tree from given Inorder and Preorder traversals.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.Top 10 algorithms in Interview Questions.A Step by Step Guide for Placement Preparation | Set 2.A Step by Step Guide for Placement Preparation | Set 1.ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.

Regex for number of a word