InterviewBit Problems   Power Of Two Integers : Solved

Hope this helps! (1)
Simple c++ solution optimised (1)
Most Simple Solution (6)
Simple JAVA solution - AC (1)
Simple C++ solution using prime factorization (1)
Another short and simple solution if anyone needs (1)
Another C++ solution (1)
Solution in C language, got accepted (1)
Java O(sqrt(n)) algo with Prime factorization (7)
Easiest approach using log of eg x = a^b (2)
My solution in C++ without using pow() (1)
Solution not working for large integers(runtime error) (1)
Datatype confusion (1)
SIMPLEST C++ approach (1)
My approach : I found and stored all the prime numbers till the square root of A (5)
Another Approach : Prime Factorization (2)
Fastest of all using JAVA (1)
Very easy c++ solution (1)
Different Approach, using logarithms (1)
Different Approach by Division and Modulo (5)
TLE occurred without a condition (1)
For large integers (1)
How can 536870912, 823543 be expressed as power of two integers? (1)
Short and Crisp (1)
Why does not this solution work..? (2)
Using limits on both power and base, python (1)
Is not this one more optimized? (2)
My log(A) solution (1)
Why does the use of pow() causes a tle? (1)
Why not just try to pow the factor instead of every number? (2)