Max Consecutive Ones (LeetCode 485) | Full Solution w/ Kadane's Algorithm | Visuals and Animations
Vložit
- čas přidán 14. 07. 2024
- Join this channel to get access to perks: / @nikoo28
Actual Problem: leetcode.com/problems/max-con...
Chapters:
00:00 - Intro
00:46 - Problem Statement and Description
02:13 - Efficient Approach
07:52 - Dry-run of Code
10:20 - Applications of the problem
13:03 - Final Thoughts
📚 Links to topics I talk about in the video:
Kadane's Algorithm: • Maximum Sub-Array Sum ...
Dynamic Programming: • Dynamic Programming ea...
What is Time Complexity: • What is the Time Compl...
📘 A text based explanation is available at: studyalgorithms.com
Code on Github: github.com/nikoo28/java-solut...
Test-cases on Github: github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: amzn.to/3sJm8Wl
Favorite book to understand algorithms: amzn.to/4848xJH
Favorite book for data structures: amzn.to/3P96YBv
Get started for interview preparation: amzn.to/44Nn5du
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: amzn.to/3PdsViT
Microphone: amzn.to/3Exv83x
Recording Camera: amzn.to/3PwyN8e
Tablet to sketch and draw: amzn.to/3ZdKVy7
Sketching Tool: amzn.to/45XJEgY
Laptop to edit videos: amzn.to/460ofDu
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#leetcode #programming #interview
Don't stop posting a video man!
Great explanation on problem solving and kadane's Algorithm
GREAT WORK NIKHIL , HATS OFF FOR YOUR EFFORTS...🔥🔥🔥
Thank you soo much 👑👑
Hi Nikhil. Thanks a lot for explaining leet code problems. Can you please do videos on codewars problems like Equal sides of Array, Human Readable Time etc... am attending interviews in Europe. They are asking codewars problems
Very good explanation of Kadane's algorithm in Java, thank you !
Glad you liked it
Nitin, please start some course. Your explanation is crystal clear.
Thanks for your efforts.❤
For some reason whenever I see a name of an algorithm I feel that the algorithm is the most complicated one, though it is efficient.
Good
❤❤❤