Maximum Good People Based on Statements| Leeetcode 2151 | Contest 277 | Easy 🔥🔥🔥 | Leetcode Hard

[@anuragchakraborty7607]

superb approach !!!

[@prabrishamajumder4217]

Thank you for the solution and nice explanation.

[@rishabhsharma7261]

brother amazing 👏👏

[@CodeWithSunchitDudeja]

Weekly contest 277 playlist: kzbin.info/aero/PLEI-q7w3s9gSdtD9D4oX66HrsxmPjSMiX

[@aakashparmar560]

crystal clear explanation !! thank you so much!!

[@vk-vz8qo]

Cover biweekly contest this time. I was able to solve 2 problems only.

[@KousthubhaKumar]

Great explanation, appreciate posting weekly videos, please keep this up in every contest, thanks!

[@revathi0637]

Super.... Continue this regularly

[@gurucharan976]

Thanks for the answer. But how are you ignoring statements of a bad person as it's mentioned in the problem statement that a bad person can tell truth sometimes. Please explain how your solution handles this case

[@abhishekahlawat143]

can someone explain that why are we takings mask one less than the total combinations possible?

[@aravindkumaresan2747]

An extra Thanks for the cover picture that you posts based on the problem statement, Really good looking!

[@CodeWithSunchitDudeja]

Our pleasure!

[@Live-hh6li]

This question was nice I did using recursion. But masking approach is better as it requires less lines of code and it's easy to implement.

[@pittalaabhishek]

How to practice in leetcode to be able to solve 4 questions in contest.Currently i solve 3 questions?

[@CodeWithSunchitDudeja]

Practice is the only way out

[@harshitsaluja3493]

How do you come up thinking of Bit Masking algorithm.... while doing contest I was not able to think in such a way so asking this in order to improve my thinking direction.

[@ma7ksman]

Experience i guess

[@robbin7766]

"2

[@hoyinli7462]

finally i got 4 questions passes! I used simple DFS for Q4!!!

[@CodeWithSunchitDudeja]

Awesome