Given a string of digits and characters. Write a program to find the number with the maximum number of digits in a string.
Note: The number may not be the greatest number in the string. For example, if the string is “a123bc321” then the answer can be 123 or 321 as the problem is to find the number with the longest length and not the largest value.
Input: geeks100for1234geeks Output: 1234 Input: abx12321bst1234yz Output: 12321
Approach: The idea is to traverse the string and if a digit is encountered, store its position and from that position traverse further until a character occurs. Every time a continuous series of a digit is encountered, store its length and match it with the length previously find series of a digit to find out the maximum of all the continuous series of digits.
Below is the implementation of above approach.
Time Complexity: O(n)
Auxiliary Space Complexity: O(1)
- Find number of magical pairs of string of length L
- C program to find the length of a string
- Find the longest string that can be made up of other strings from the array
- Program to find Length of Bridge using Speed and Length of Train
- Length of the longest subsequence such that xor of adjacent elements is non-decreasing
- The length of a string using pointers
- Count of sub-strings of length n possible from the given string
- Longest string in non-decreasing order of ASCII code and in arithmetic progression
- Python program to print even length words in a string
- Reduce string to shortest length by deleting a pair of same adjacent characters
- Find the Diameter or Longest chord of a Circle
- Find length of Diagonal of Hexagon
- Find if a string starts and ends with another given string
- Given number of matches played, find number of teams in tournament
- Find the number of ways to divide number into four parts such that a = c and b = d
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.