Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Largest Odd Number in String

Explore how to identify the largest odd-valued substring within a numeric string by applying a greedy algorithm. Learn to traverse the string from the end, find the last odd digit, and extract the substring efficiently with O(n) time and O(1) space complexity.

We'll cover the following...

Statement

You are given a string, num, which represents a large integer. Your task is to find the largest odd-valued integer that can be formed as a non-empty substring of num. Return this odd integer as a string. If no odd integer exists, return an empty string ("").

Note: A substring is a continuous sequence of characters within a string.

Constraints:

  • 1≤1 \leq num.length ≤104\leq 10^4 ...