- 242
- 824 709
Sai Anish Malla
เข้าร่วมเมื่อ 5 ม.ค. 2012
I upload daily videos solving interview questions along with weekly projects and tutorials, specifically in Python.
A day trip to Vizag (Visakhapatnam).
I have lived in Vizag for some time. It is one of the prettiest places out there with beautiful hills on one side and beaches on the other. I only had one day and wasn't even close to covering everything the city has to offer.
มุมมอง: 1 279
วีดีโอ
A Monday Morning Visit to Charminar for some chai.
มุมมอง 37211 หลายเดือนก่อน
I've always found Charminar to be a lot more enjoyable in the morning compared to the crowded evenings, for sure its one of my favourite parts of Hyderabad.
Recyclable and Low Fat Products | LeetCode 1757 | SQL | SQL 50 study plan
มุมมอง 794ปีที่แล้ว
This video is a solution to LeetCode 1757, Recyclable and Low Fat Products. I explain the question, go over the logic / theory behind solving the question and then solve it using SQL. This is part of the SQL 50 Study plan. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! SQL 50 study plan playlist: t...
Find Customer Referee | LeetCode 584 | SQL | SQL 50 study plan
มุมมอง 938ปีที่แล้ว
This video is a solution to LeetCode 584, Find Customer Referee. I explain the question, go over the logic / theory behind solving the question and then solve it using SQL. This is part of the SQL 50 Study plan. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! SQL 50 study plan playlist: th-cam.com/p...
Big Countries | LeetCode 595 | SQL | SQL 50 study plan
มุมมอง 405ปีที่แล้ว
This video is a solution to LeetCode 595, Big Countries. I explain the question, go over the logic / theory behind solving the question and then solve it using SQL. This is part of the SQL 50 Study plan. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! SQL 50 study plan playlist: th-cam.com/play/PLr9...
Article Views I | LeetCode 1148 | SQL | SQL 50 study plan
มุมมอง 1.4Kปีที่แล้ว
This video is a solution to LeetCode 1148, Article Views I. I explain the question, go over the logic / theory behind solving the question and then solve it using SQL. This is part of the SQL 50 Study plan. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! SQL 50 study plan playlist: th-cam.com/play/P...
Invalid Tweets | LeetCode 1683 | SQL | SQL 50 study plan
มุมมอง 1.1Kปีที่แล้ว
This video is a solution to LeetCode 1683, Invalid Tweets. I explain the question, go over the logic / theory behind solving the question and then solve it using SQL. This is part of the SQL 50 Study plan. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! SQL 50 study plan playlist: th-cam.com/play/PL...
Intuitively understanding Bond Yields [Yield to Maturity (YTM)]
มุมมอง 1.5Kปีที่แล้ว
This video explains bond yields specifically the Yield to maturity (YTM). This video gives a more intuitive understanding of the concept using a simple scenario and visualizing the same with a graph.
Largest Rectangle in Histogram | LeetCode 84 | Theory + Python code
มุมมอง 1.3Kปีที่แล้ว
This video is a solution to LeetCode 84, Largest Rectangle in Histogram. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 1:00 Solution explained 14:30 P...
Daily Temperatures| LeetCode 739 | Theory + Python code
มุมมอง 687ปีที่แล้ว
This video is a solution to LeetCode 739, Daily Temperatures. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Monotonic stack explained Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 1:50 Solution ex...
Min Stack | LeetCode 155 | Theory + Python code
มุมมอง 473ปีที่แล้ว
This video is a solution to LeetCode 155, Min Stack. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 0:36 Solution explained 7:21 Python code 8:47 Alter...
Generate Parentheses | LeetCode 22 | Theory + Python code
มุมมอง 1Kปีที่แล้ว
This video is a solution to LeetCode 22, Generate Parentheses. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 1:20 Solution explained 8:31 Another exam...
Longest Consecutive Sequence | LeetCode 128 | Theory + Python code
มุมมอง 400ปีที่แล้ว
This video is a solution to LeetCode 128, Longest Consecutive Sequence. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 1:31 Solution explained 7:38 Pyt...
Additive Number | LeetCode 306 | Theory + Python code
มุมมอง 1.4Kปีที่แล้ว
This video is a solution to LeetCode 306, Additive Number. I explain the question, go over the logic / theory behind solving the question and then solve it using Python. Comment below if you have a better solution to this problem! Let me know if you have any feedback and don't forget to subscribe for more videos! Time stamps: 0:00 Question explained 2:09 Solution explained 7:28 Python code expl...
Automatically Generate YouTube shorts (Python) (No coding knowledge needed to run)
มุมมอง 3.8Kปีที่แล้ว
Below is the link to the Python notebook discussed in the video: colab.research.google.com/drive/1P7am_XjJ9KF2tcCR0rnbznAdOgFQb8mX?usp=sharing Let me know if you have any feedback and don't forget to subscribe for more videos! Timestamps 0:00 Intro 2:30 How to run notebook 3:50 How it works Code explained 13:55 Future scope and improvements
Count Primes | LeetCode 204 | Theory + Python code (Sieve of Eratosthenes explained)
มุมมอง 1Kปีที่แล้ว
Count Primes | LeetCode 204 | Theory Python code (Sieve of Eratosthenes explained)
Flip String to Monotone Increasing | LeetCode 926 | Theory + Python code
มุมมอง 645ปีที่แล้ว
Flip String to Monotone Increasing | LeetCode 926 | Theory Python code
Minimum Rounds to Complete All Tasks | LeetCode 2244 | Theory + Python code
มุมมอง 726ปีที่แล้ว
Minimum Rounds to Complete All Tasks | LeetCode 2244 | Theory Python code
Rotate Image | LeetCode 48 | Theory + Python code
มุมมอง 900ปีที่แล้ว
Rotate Image | LeetCode 48 | Theory Python code
Valid Parentheses | LeetCode 20 | Theory + Python code
มุมมอง 1.4Kปีที่แล้ว
Valid Parentheses | LeetCode 20 | Theory Python code
Find Median from Data Stream | LeetCode 295 | Theory + Python code
มุมมอง 519ปีที่แล้ว
Find Median from Data Stream | LeetCode 295 | Theory Python code
4Sum | LeetCode 18 | Theory + Python code
มุมมอง 6402 ปีที่แล้ว
4Sum | LeetCode 18 | Theory Python code
Two Sum | LeetCode 1 | Theory + Python code
มุมมอง 2.8K2 ปีที่แล้ว
Two Sum | LeetCode 1 | Theory Python code
Last Stone Weight | LeetCode 1046 | Theory + Python code
มุมมอง 2792 ปีที่แล้ว
Last Stone Weight | LeetCode 1046 | Theory Python code
Container With Most Water | LeetCode 11 | Theory + Python code
มุมมอง 7952 ปีที่แล้ว
Container With Most Water | LeetCode 11 | Theory Python code
Find Pivot Index | LeetCode 724 | Theory + Python code
มุมมอง 1.2K2 ปีที่แล้ว
Find Pivot Index | LeetCode 724 | Theory Python code
N-Repeated Element in Size 2N Array | LeetCode 961 | Theory + Python code
มุมมอง 5442 ปีที่แล้ว
N-Repeated Element in Size 2N Array | LeetCode 961 | Theory Python code
StickLengths | CSES problem set | Solution explained and C++ code
มุมมอง 9932 ปีที่แล้ว
StickLengths | CSES problem set | Solution explained and C code
Dice Probability | CSES problem set | Solution explained and Python code
มุมมอง 1.5K2 ปีที่แล้ว
Dice Probability | CSES problem set | Solution explained and Python code
Missing Number | CSES problem set | All approaches explained and C++ code
มุมมอง 9542 ปีที่แล้ว
Missing Number | CSES problem set | All approaches explained and C code
you explain very well but i think it can be more optimise- def reverseBits(self, n: int) -> int: result=0 for i in range(32): result = result << 1 | (n>>i)&1 return result
Where did $20 come from?
Thanks for this. Wouldn't this return the same result regardless of whether you're using inorder, postorder or preorder? You're sorting the result at the end.
Bro don't u got any friends?
Pedo glasses lol
This solution does not pass the time complexity test anymore in leetcode
perfecto
Really good explanation! Thank you so much!
That was super helpful and easy to understand
At 6:59 shouldn't the minimum value be 0 why was it at 6?
Really good video summary. Shouldn’t Year 3 cash flow be the face value and coupon i.e. 100+20?
Yes it should
Bravooooooo! I cannot thank you enough. I finally understand. Subbed & Liked! Keep up the gr8 vids bro
Nice explanation, cleared up a lot of questions. Thanks bro
Hey Sai, it's 2024 and this video just did wonders for me!
So do I!!!
wow very good approahc. thanks man
good explanation brother.
This is medium on Leetcode
damn you made it too easy bro
made it much simple to understand!!! thanks :)
Very very very very very nice explanation man! Keep up the good work!
Amazing video, thanks
Thank you Sai Anish. Great video and explanation.
Very good, but would it work in java?
Fantastic explanation all round
Best explanation out there. I was stuck on this problem for so long before watching your video.
You just earned a subscriber, was so explanatory
Are you gay?
best explanation thank s
really helpful explanation and drawings, thanks Sai!
Nice. BUT HOW AM I SUPPOSED TO REALIZE THAT???
This was really helpfil
well explained!!! Thank you so much !
well explained!!! Thanks!
loved the explanation
❤
Omg, bro, thank you so much this is the best solution i have ever seen!!!! Really ez and optimal i do really like it!
Very useful this for me and all beginners... Thanks so much....
Very clear voice, and how beautifully explained. I'm impressed. Thank you so much.☺☺ Again, I liked your way of speaking a lot.
getting wrong answer for test case - [20,1,16,2,17,16,8,15,7]
which compiler she is using
great explanation!
Nice explanation
Suggestion, add the intuition next time as well. Otherwise, the explanation to the solution was amazing and helped me get the intuition behind the problem.
Well explained. Thank you!!
Next level broo
I really don't understand the why we increment the current sum frequency and then decrement it. Also, when we find x in freq, why don't we just increment self.count by one, since we've found just one additional path? Why do we increment by freq[x]? Thanks.
Bro this is brilliant I struggled with this question for days and now I got the logic. Your explanations are just phenomenal, thank you
beautiful explanation🥰
great vid
THANK YOU