Minimum Rounds to Complete All Tasks | LeetCode 2244 | Theory + Python code

[@mohit8299]

Nice thanks for the solution

[@ishayadav5221]

🎉🎉

[@mallasatyanarayana1942]

Hi Sai Anish Mall, can you post Python interview questions for preparation all in 1 video, Thx

[@midhileshmomidi3120]

if val == 1: return -1 else: val = ceil(val/3) This will cover the cases of 3k + 1 and 3k + 2