MENU

Fun & Interesting

Encuentra el Máximo Común Divisor de un Array - Leetcode 1979 - Java

Nico Salgado 377 lượt xem 3 weeks ago
Video Not Working? Fix It Now

Today I'm going to solve Leetcode problem #1979 with Java:

Given an array of integers `nums`, return the greatest common divisor of the smallest and largest numbers in `nums`.

The greatest common divisor of two numbers is the largest positive integer that divides both numbers evenly.

---

🚨 Sign up for my Bootcamp if you want to learn to program from scratch: https://bootcamp.aprenderjava.com/

📧 Join my email list: https://nicosalgado.com/

---

✍🏻 FREE Programming Resources:
- Roadmap to learn Java: https://nicosalgado.com/recursos
- Guide to becoming a Developer (in 6-12 months): https://youtu.be/0ioEnuH_ONE
- All the Java topics I would learn if I started from scratch: https://youtu.be/TNMMgFjK_l0
- Mini Java course if you want to start learning today: https://youtu.be/bi2NLbLYbic

----

👇🏻 FOLLOW ME ON OTHER SOCIAL MEDIA

Instagram: https://www.instagram.com/nicolassalgado8/
Instagram (Reels account): https://www.instagram.com/nicosalgadoclips/
Twitter: https://twitter.com/nicosalgado88
TikTok: https://www.tiktok.com/@nicosalgadoclips

Comment