Keep Only the Highest Set Bit

Code

#include <stdio.h>
#include <stdint.h>

// Complete the function
uint16_t highest_set_bit(uint16_t reg) {
    // Your logic here
    uint8_t target_bit = 0;

    if (reg ==0) return 0;

    for(uint8_t i = 0; i < 16; i++){
        if(reg & ( 1u << i)) target_bit = i;
    }
    return (uint16_t)(1u<< target_bit);
}

int main() {
    uint16_t reg;
    scanf("%hu", &reg);

    uint16_t result = highest_set_bit(reg);
    printf("%hu", result);
    return 0;
}

Solving Approach

handled the special 0 case and used uint8 for minimum bit size of integers needed to solve the qn