// C++ program to find closest // tidy number smaller than the  // given number #include   using namespace std; char* tidyNum(char str[] int len) {  for (int i = len-2; i >= 0; i--)  {  // check whether string violates tidy property  if (str[i] > str[i+1])  {  // if string violates tidy property then  // decrease the value stored at that index by 1  // and replace all the value stored right to  // that index by 9  (char)str[i]--;  for (int j=i+1; j<len; j++)  str[j] = '9';  }  }  return str; } // Driver code int main() {  char str[] = '11333445538';  int len = strlen(str);    // num will store closest tidy number  char *num = tidyNum(str len);  printf('%sn' num);  return 0; }  

// Java program to find closest // tidy number smaller than the  // given number import java.io.*; class GFG { static String tidyNum(String str1  int len) {  char[] str = str1.toCharArray();  for (int i = len - 2; i >= 0; i--)  {  // check whether string   // violates tidy property  if (str[i] > str[i + 1])  {  // if string violates tidy   // property then decrease the  // value stored at that index   // by 1 and replace all the value   // stored right to that index by 9  str[i]--;  for (int j = i + 1; j < len; j++)  str[j] = '9';  }  }  return String.valueOf(str); } // Driver code public static void main(String[] args) {  String str = '11333445538';  int len = str.length();    // num will store closest tidy number  System.out.println(tidyNum(str len)); }  } // This code is contributed by mits 

# Python 3 program to find closest # tidy number smaller than the  # given number def tidyNum(str len): for i in range(len-2 -1 -1): # check whether string  # violates tidy property if (str[i] > str[i+1]): # if string violates tidy  # property then decrease the # value stored at that index by 1 # and replace all the value  # stored right to that index by 9 str[i] -= 1 for j in range(i+1 len): str[j] = 9 return str # Driver code str = [11333445538] len = len(str) # num will store closest tidy number num = tidyNum(str len) for i in range(0len): print(str[i] end = '') # This code is contributed by # Smitha Dinesh Semwal 

// C# program to find closest // tidy number smaller than the  // given number using System; class GFG { static String tidyNum(String str1 int len) {  char[] str = str1.ToCharArray();  for (int i = len - 2; i >= 0; i--)  {  // check whether string   // violates tidy property  if (str[i] > str[i + 1])  {  // if string violates tidy   // property then decrease the  // value stored at that index   // by 1 and replace all the value   // stored right to that index by 9  str[i]--;  for (int j = i + 1; j < len; j++)  str[j] = '9';  }  }  string s = new string(str);  return s; } // Driver code static void Main() {  String str = '11333445538';  int len = str.Length;    // num will store closest tidy number  Console.WriteLine(tidyNum(str len)); }  } // This code is contributed by mits 

 // PHP program to find closest // tidy number smaller than the  // given number function tidyNum($str $len) { for ($i = $len - 2; $i >= 0; $i--) { // check whether string // violates tidy property if ($str[$i] > $str[$i + 1]) { // if string violates tidy // property then decrease // the value stored at that // index by 1 and replace all  // the value stored right to // that index by 9 $x = ord($str[$i]); $x--; $str[$i] = chr($x); for ($j = $i + 1; $j < $len; $j++) $str[$j] = '9'; } } return $str; } // Driver code $str = '11333445538'; $len = strlen($str); // num will store  // closest tidy number $num = tidyNum($str $len); echo $num; // This code is contributed by mits ?> 

<script> // Javascript program to find closest // tidy number smaller than the  // given number function tidyNum(str1 len) {  var str = str1.split('');  for (i = len - 2; i >= 0; i--)  {    // Check whether string   // violates tidy property  if (str[i] > str[i + 1])  {    // If string violates tidy   // property then decrease the  // value stored at that index   // by 1 and replace all the value   // stored right to that index by 9  str[i]--;    for(j = i + 1; j < len; j++)  str[j] = '9';  }  }  return str.join(''); } // Driver code var str = '11333445538'; var len = str.length; // num will store closest tidy number document.write(tidyNum(str len)); // This code is contributed by Amit Katiyar  </script>