🎓 This is part 4 of a series where I show you how to come up with the solutions to CodeFight’s arcade challenges. If you would like to join CodeFights then follow this link:

⏭ Video:

⏮ Video:

In this video we solve the adjacentElementsProduct challenge in the Intro Arcade section (challenge #4). We do this but looping through all the elements in the array and finding the products of the adjacent elements. Every time a product is higher than our current largest product, that becomes the new highest product. In the end we return the highest product.

🔴🎤

🌍

💰

👍 Like 📢 Subscribe 🔔 Hit The Bell for more content!

Nguồn: https://tintucgame.net

Xem thêm bài viết khác: https://tintucgame.net/giai-tri/

LEAVE A REPLY

Please enter your comment!
Please enter your name here