Convert to Palindromic Number

Problem Statement

Convert to Palindromic Number Problem Statement You are given an integer array A of length N. Your task is to count and print the total number of majestic numbers present in the array. A majestic number is the one that could be converted to a palindromic number by using at most K operations. In one operation, you can perform +1 or -1 to the number. A palindromic number is one that reads the same forwards and backwards. Note: A number containing only a single digit is considered a palindromic number. If there is no majestic number in the array, print 0. If a number is already a palindromic number, you don't require any operation, and it will be considered a majestic number directly. You can apply K operations independently for each element of the array, i.e., the K operations applied on the first element can differ from the K operations applied on the second element. Input Format The input consists of two lines: The first line contains two space-separated integers, N and K, the length o