Practice Hudson River Trading Coding Question | Real Coding Interviews

Quick Summary

Count positive integers strictly less than n that only contain digits 0 and 1 in base 4.
The problem requires analyzing the base-4 representation of n to efficiently compute the count.
A brute-force approach will fail due to large constraints, necessitating a logarithmic-time digit analysis.

What This Tests

Common Patterns

Bit Manipulation

Dynamic Programming

Test Cases

Input

Output

Expected