![[Array] Find the Student that Will Replace the Chalk](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FMYROI%2FbtsJqd9aaZd%2Ffn0MZW8wAcxtb8QtWOo2F1%2Fimg.png)
https://github.com/Yellome-in-the-BOK/leetcode/blob/main/240902_Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/explanation.md leetcode/240902_Find the Student that Will Replace the Chalk/explanation.md at main · Yellome-in-the-BOK/leetcodeContribute to Yellome-in-the-BOK/leetcode development by creating an account on GitHub.github.com ✨ 인사이트처음에는 Binary Search를 생각했으나,, 그렇게 찾은 인덱스를 상대..
![[Array, Greedy, Sorting] Minimum Difference Between Largest and Smallest Value in Three Moves](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbnNTMr%2FbtsIk98bMhW%2FOb7kXJZzR57CSonaBkNfD1%2Fimg.png)
https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/description/?envType=daily-question&envId=2024-07-03 🔖 태그 🔖Array, Greedy, Sorting 🔮 문제 🔮정수 array가 있다.3개를 뺐을 때, max(array) - min(array)의 최댓값을 구하라. list와 array의 차이는? list는 여러 타입을, array는 단일 타입을 저장.대신, array는 메모리도 효율적이고 속도도 빠르다. ✨ 인사이트 ✨ max(array) - min(array)를 줄이기 위해서는 array의 최..