Array Operations: Palindromic Binary Representation

Problem Statement

Array Operations: Palindromic Binary Representation Problem Description An array containing N integers is given. Find the count of numbers in the array whose binary representation (without leading zeros) is a palindrome. In the provided code snippet, implement the provided countOfBinaryPalindromes(...) to find the count of numbers in the array whose binary representation (without leading zeros) is a palindrome. You can write your code in the space below the phrase "WRITE YOUR LOGIC HERE". There will be multiple test cases running, so the Input and Output should match exactly as provided. The basic output variable result is set to a default value of -404, which can be modified. Additionally, you can add or remove these output variables. Input Format The first line contains a single integer N, denoting the number of elements in the array. The second line contains N space-separated integers, denoting the array elements. Examples Example 1: Input: 5 1 2 3 4 5 Explanation: N is 5. The array