Uploaded February 2022 | Updated September 2026, 2 weeks ago

---

🚀 neetcode.io - A better way to prepare for Coding Interviews

🥷 Discord: discord.gg/ddjKRXPqtk
🐦 Twitter: twitter.com/neetcode1

🐮 Support the channel: patreon.com/NEETcode

⭐ BLIND-75 PLAYLIST: youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf
💡 CODING SOLUTIONS: youtube.com/playlist?list=PLot-Xpze53leF0FeHz2X0aG3zd0mr1AW_
💡 DYNAMIC PROGRAMMING PLAYLIST: youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1
🌲 TREE PLAYLIST: youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2
💡 GRAPH PLAYLIST: youtube.com/watch?v=EgI5nU9etnU&list=PLot-Xpze53ldBT_7QA8NVot219jFNr_GI
💡 BACKTRACKING PLAYLIST: youtube.com/watch?v=pfiQ_PS1g8E&list=PLot-Xpze53lf5C3HSjCnyFghlW0G1HHXo
💡 LINKED LIST PLAYLIST: youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=2
💡 BINARY SEARCH PLAYLIST: youtube.com/playlist?list=PLot-Xpze53leNZQd0iINpD-MAhMOMzWvO
📚 STACK PLAYLIST: youtube.com/playlist?list=PLot-Xpze53lfxD6l5pAGvCD4nPvWKU8Qo

Problem Link: leetcode.com/problems/largest-number

0:00 - Read the problem
1:25 - Drawing Explanation
5:13 - Coding Explanation

leetcode 179
This question was identified as an interview question from here: github.com/xizhengszhang/Leetcode_company_frequency


#amazon #interview #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.