Champagne Tower - Leetcode 799 - Python

[@akash-kumar737]

I coded after following your explaination and my code is exactly similar. Thanks dude. I have recently started doing Leedcode daily for last 5 days.

[@bundiderp5109]

Great explanation as always. But I found the 44.5 overflow at 4:40 to be very confusing. I am pretty sure it should be 49.5 as 2x 49.5 = 99.

[@NeetCodeIO]

Yep, my math was way off, sorry about that!

[@kelvinology4]

highly recommend all of you to do leetcode 118 - 120 (neetcode has all explanation videos) the structure is pretty similar that all of them are dealing with triangles btw great explanation and your solutions always inspire me, thanks a lot🙏🏻

[@il5083]

I was worrying about some champagne will reach the end first. Didn’t think of processing it row by row is possible. Great explanation, thanks!

[@akhma102]

Great Explanation. Thank you, Neet!

[@王瀚君-c3j]

It's literally NEET CODE! Thank you

[@J1MKAKA1N]

Simple and elegant, thanks for the effort! Keep it going :)

[@tenzin8773]

Don't think I'll ever be able to solve this in a real interview if I never did this question before :(

[@anantom251]

You are the saviour.

[@Harish-rz4gv]

Kinda Pascal's triangle

[@VidyaBhandary]

Superb Explanation ...

[@AmanRaj-yn5pj]

nice way of explaining👍

[@SD-vk3ko]

Thanks lord, we have you!!🙂

[@memeproductions4182]

did the same, but i basically consider this a BFS where each row is a level of the tree

[@satviksrinivas8764]

If poured was fixed could there be a DP solution? I'm thinking along the lines that you would have a base case since you know the total amount of champagne.

[@darkcaper703]

847. Shortest Path Visiting All Nodes :(

[@themagickalmagickman]

bfs with bitmask instead of set. Look up how to do a bitmask, its actually surprisingly easy. The intuitive approach is to bfs because we want a shortest path, each bfs node will need to maintain a visited set though. Instead of an actual set, we use an integer bitmask. As you know, integers are represented as binary, ex: 00101. If we assign each node to a position in the binary representation, we can mark it visited by flipping the digit from 0 to 1. This yields a unique integer for each visited set. So If I want to mark the 0th node as visited my bitmask looks like this: 0001 (4 nodes total, 0,1,2,3). This yields the integer 1. Set the 0 and 3rd visited? 1001, int = 9. Here is the operation for setting a given bit as visited, bitmask |= (1

[@boisaulit]

Genius.

[@anshror2583]

Bro please upload leetcode video daily

[@phpostrich]

this one was pretty cool

[@phpostrich]

another one already wowz

[@aazzrwadrf]

pretty hard for a med

[@vishnusunil9610]

99/2 = 49.5

[@StellasAdi18]

Guess you meant 49.5 and not 44.5 at 5.08 for 100 example.

[@danielsun716]

looks like the dp problem

[@SeanBow-fs7rj]

ebat' traxatel

[@silent7152]

i thought it was a dp problem

[@haroldobasi2545]

Same, spent forever trying to think of a base case. I guess sometimes the most straightforward solutions are the right ones

[@MrKB_SSJ2]

lol