458. Poor Pigs || Leetcode 458

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Thank You for the explaination, ma'am. This question was also asked in SAP technical round.

risingstar
Автор

I seen many videos but not able to understand that t+1 made it so much easy thanks

aadityaagrawal
Автор

code which is actually getting accepted:

class Solution {
public:
int poorPigs(int buckets, int minutesToDie, int minutesToTest) {
int t=minutesToTest/minutesToDie;
return
}
};

AkshayRajSingh-wdfz
Автор

Hey, the solution is not working anymore

sypher
Автор

Can you give an intuitive explanation as why we are doing t+1 n times ?
As it felt to me as n * (t+1) initially.

raunakkumar
Автор

Thank you, yours is the only solution/explanation I understood. Subscribed !

MP-nyep
Автор

thank you so much for such nice content (better than adipurash)

rsmaddyfact
Автор

Hey you have started solving hard problems 👏

srijansingh
Автор

After saw the two video I got the my answer in this video good teaching style every one just simple learn and write the code no one tell the right logic behind the problem/

sahiljain
Автор

Thank you! You've made it so simple to understand..

pratikvaghasiya
Автор

You are great didi i was not able to understand from anyone else.

mrityunjoybarman
Автор

Thanks a lot !! simple & very easy to understand approach.

yashrajput
Автор

Thanks i was not able to understand this from anyone else

Codekage
Автор

how can 2 pigs find among 4 buckets in 1 test can you explain

soubhikghosh
Автор

ess question k chakar mai bechaare pig mar rhe :'(, btw nice explanation:) Thank you!

jethala
Автор

There is a request...don't show answer first..it distracts from approach :) Hope you consider it. :)

rahulsrivastava