Given an array of integers, find the largest prime number present in it. If no prime number is found, return -1. Example Input: [10, 5, 8, 17, 3, 21] Example Output: 17 Solution Approach (Python):
Input: 13 (1101) → Output: 3. while(n) count++; n = n & (n-1); Tcs Coding Questions 2021