영어공부 겸 알고리즘 공부를 같이 해보자는 심정으로 캐리어컵 문제를 영어로 풀어야겠다고 마음먹은지가 6월 27일이니.. 벌써 3개월전이네요;;;

일단 질러봅니다.

After shocking dev-day in my company, I decided to practice algorithm with the other way. The way is that solve the career cup problem and (영어로 정리하다) shape the solution into blog.

http://m.blog.naver.com/angelpyj2/220538131846 에서 찾은 정리하다 관련 내용! 물건정리는 arragne, 방은 clean up, 생각이나 말을 정리하는것은 organize throughts

https://www.careercup.com/question?id=16759664

The definition of the problem

• There are k sorted lists (the elements are integers)
• Find smallest range including at least one number in all k lists.

Main Idea of the solution

Implementation

Check-lists

Searching space

• Loop invariants or
• pre-cond, in, post-cond and
• boundary of the space