Скачать или смотреть Find Closest Person | LeetCode 3516 | Sep Day 4 | Math ✅✌️

Hi Everyone 👨‍💻
Today, we're solving the “Find Closest Person” problem. In this problem we are given given three integers x, y, and z representing positions on a number line. Person 1 is at x, Person 2 at y, and Person 3 at z (fixed). Both Person 1 and 2 move toward Person 3 at equal speed. We have to return 1 if Person 1 reaches first, return 2 if Person 2 reaches first and return 0 if they reach at the same time.




🔥 Problem Link: https://leetcode.com/problems/find-cl...

📁 GitHub Code: https://github.com/Harini-Kannaiyan/L...

Connect with me:
LinkedIn:   / harini-kannaiyan-698603168  
Instagram: https://www.instagram.com/code.with.h...

Do comment if you have any suggestions or need help with solution.
If you like the solution then please leave a star(*) on my GitHub repository 🤩