Summary
Full Transcript
📘 Welcome to Part 219 of Code & Debug’s DSA in Python Course! In this quick strings-and-greedy exercise, the task is to return the largest-valued odd integer obtainable by deleting only trailing digits from a numeric string. The key observation: an integer is odd iff its last digit is odd, so scan from right to left to find the rightmost odd digit and return the prefix up to it; if none exists, return an empty string. This yields an O(n) one-pass solution with O(1) extra space. 🔗 LeetCode – Largest Odd Number in String: https://leetcode.com/problems/largest-odd-number-in-string/description/ 🔗 Companion Reading (Step-by-step with code): https://codeanddebug.in/blog/largest-odd-number-in-string/ 📄 FULL Playlist Sheet (All Videos in Order): https://docs.google.com/spreadsheets/d/1AWE15Fy3wD2iqu2vjK_R7cCiuvSsjYQclcdZmHpF66o/edit?usp=sharing 🎓 Enroll Free: Master Python DSA Course https://codeanddebug.in/course/master-dsa-with-leetcode 🚀 Advance Python DSA for FAANG (Zero to Hero Course) https://codeanddebug.in/course/zero-to-hero-python-dsa Stay focused and keep coding with Code & Debug. Like | Share | Subscribe | Hit the 🔔 #LargestOddNumber #LeetCode1903 #Strings #Greedy #RightToLeftScan #PythonDSA #CodeAndDebug #Part219 #InterviewPrep
