Power of Four | LeetCode 342 | C++, Java, Python

LeetCode Solutions: • LeetCode Solutions | L...
August LeetCoding Challenge: • Playlist
Github Link: github.com/KnowledgeCenterYou...
*** Best Books For Data Structures & Algorithms for Interviews:*********
1. Cracking the Coding Interview: amzn.to/2WeO3eO
2. Cracking the Coding Interview Paperback: amzn.to/3aSSe3Q
3. Coding Interview Questions - Narasimha Karumanchi: amzn.to/3cYqjkV
4. Data Structures and Algorithms Made Easy - N. Karumanchi: amzn.to/2U8FrDt
5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: amzn.to/2U0qZgY
6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: amzn.to/2Wdp8rZ
*****************************************************************************
August LeetCoding Challenge | Problem 4 | Power of Four | 4 August,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Power of Four,
Power of Four c++,
Power of Four Java,
Power of Four python,
Power of Four solution,
342. Power of Four,
#CodingInterview #LeetCode #AugustCodingChallenge #Google #Amazon #bitmanipulation #PowerOfFour

[@crisag.2698]

Amazing, I've learned so much from you. Thank you so much for all of your content.

[@KnowledgeCenter]

Happy to hear that!

[@acxd]

Improved audio quality , presentation and explanation method. This man is on a roll. Keep Making !

[@KnowledgeCenter]

Thanks a ton

[@raviashwin1157]

Wake up at morning...watch knowledge center daily leetcode challenge videos..do extra questions on leetcode...go to sleep

[@KnowledgeCenter]

Good one

[@singhrav]

Very nicely explained!! Thank you so much.

[@KnowledgeCenter]

Glad it was helpful!

[@mohitarora8985]

use log function class Solution: def isPowerOfFour(self, num): import math if num>0: a=math.log(num)/math.log(4) b=a-int(a) else: return False if b==0: return True

[@praveenj3112]

Thank you so much

[@codestorywithMIK]

You are too good..

[@KnowledgeCenter]

Many many thanks

[@jacksonwahl1496]

very helpful! thank you for the great explanation

[@KnowledgeCenter]

Glad it was helpful!

[@codenchill5636]

Beautifully explained sir!!!!

[@KnowledgeCenter]

Thanks.

[@nopecharon]

Awesome explanation

[@KnowledgeCenter]

Thanks.

[@mohammadyahya78]

Thank you. None has reached your level at explaining leetcode so far.

[@KnowledgeCenter]

Glad to hear that!

[@akshatmathur278]

Thanks for this video. Great explanation.

[@KnowledgeCenter]

Glad it was helpful!

[@shyamprakashm6325]

Thanks you sir nice

[@Starfalll6783]

Please add #bitmanipulation so that searching all bit manipulation videos will be easy

[@manu-singh]

Bro where should I focus on codeforces or codechef

[@KnowledgeCenter]

If your goal is cracking interviews, focus on Leetcode. If you enjoy competitive programming, go with Codeforces/Codechef.

[@shivanktripathi4661]

can we take log (base 4) in c++....if yes then how

[@KnowledgeCenter]

Use this formula. log_a(b) = log_c(b)/log_c(a) => log base a of b = (log base c of b)/(log base c of a) => log_4 (x) = log(x)/log(4) Hence, this is the formula you are looking for.

[@shivanktripathi4661]

@@KnowledgeCenter thanks

[@RishiRaj-dl1mg]

log4(number) . This will work

[@midhileshmomidi2434]

try: return int(math.log(num,4)) == (math.log(num,4)) except ValueError: pass

[@pillabindu6661]

what is "x" in 0xaaaaaaaa dont mind im yet a beginner hoping for clarification of this doubt

[@KnowledgeCenter]

Hexadecimal numbers are preceded by 0x.

[@pillabindu6661]

@@KnowledgeCenter thanks for the answer

[@only_for_fun1234r]

I too had a doubt here , how it become 01010101010101??

[@rishisharma5249]

My Solution Time- O(1), Space- O(1) bool isPowerOfFour(int num) { if(num

[@KnowledgeCenter]

Correct.

[@rishisharma5249]

@@KnowledgeCenter Enjoying your videos Sir, keep going!!!

[@deepakkumarsahu4340]

class Solution { public: bool isPowerOfFour(int num1) { if(num1 == 1) return true; long long int num = num1; if((num & num - 1) == 0 && (num % 10 == 4 || num%10 == 6 )) return true; return false; } }; Explanation: each power of 4 has either 4 or 6 one's digit. And power(4) is a subset of power(2) and we can solve power(2) as (n & n-1) == 0 and check whether it has units digit 4 and 6

[@KnowledgeCenter]

Good.

[@deepakkumarsahu4340]

Thanks ... ur videos are really helpful

[@JardaniJovonovich192]

return (num>0 && (num & (num-1)) == 0 && (int)log2(num) % 2 == 0);

[@kenjiasuka3842]

return (num & (num-1) == 0) && (num & 0x55555554 != 0); // for 32-bit int

[@kenjiasuka3842]

return (num & (num-1) == 0) && (num & 0x5555555555555554 != 0); // for 64-bit int