<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>Next dream</title>
    <link>https://skysign.tistory.com/</link>
    <description>코딩 테스트 풀어보는 블로그</description>
    <language>ko</language>
    <pubDate>Sat, 25 Jul 2026 08:54:52 +0900</pubDate>
    <generator>TISTORY</generator>
    <ttl>100</ttl>
    <managingEditor>건이두</managingEditor>
    <item>
      <title>2024 KAKAO WINTER INTERNSHIP 산 모양 타일링</title>
      <link>https://skysign.tistory.com/403</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;문제&amp;nbsp;링크:&amp;nbsp;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/258705&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/258705&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1706352567980&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;프로그래머스&quot; data-og-description=&quot;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&quot; data-og-host=&quot;programmers.co.kr&quot; data-og-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/258705&quot; data-og-url=&quot;https://programmers.co.kr/&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/cQ9Njj/hyU81wHk5S/dANNkm2foTay4gyXis8dS0/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/bpW4BH/hyVb0JEkVB/CT5KY7jPi4RO6Z4mLTwUmK/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630&quot;&gt;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/258705&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/258705&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/cQ9Njj/hyU81wHk5S/dANNkm2foTay4gyXis8dS0/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/bpW4BH/hyVb0JEkVB/CT5KY7jPi4RO6Z4mLTwUmK/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;프로그래머스&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;programmers.co.kr&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;파이썬&amp;nbsp;소스:&amp;nbsp;&lt;a href=&quot;https://bit.ly/48NJf2p&quot;&gt;https://bit.ly/48NJf2p&lt;/a&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;유튜브&amp;nbsp;문제&amp;nbsp;풀이:&amp;nbsp;&lt;a href=&quot;https://youtu.be/Rac9bK930IA&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://youtu.be/Rac9bK930IA&lt;/a&gt;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=Rac9bK930IA&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/dao3lI/hyU8VcaBW1/pMU9jvgKz0jiKl5JTwKW81/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;2024 KAKAO WINTER INTERNSHIP 산 모양 타일링&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/Rac9bK930IA&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>카카오 기출문제</category>
      <category>2024 KAKAO WINTER INTERNSHIP</category>
      <category>산 모양 타일링</category>
      <category>파이썬</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/403</guid>
      <comments>https://skysign.tistory.com/403#entry403comment</comments>
      <pubDate>Sat, 27 Jan 2024 19:50:11 +0900</pubDate>
    </item>
    <item>
      <title>programmers.co.kr 코딩테스트 연습 Summer/Winter Coding(~2018) 방문 길이</title>
      <link>https://skysign.tistory.com/402</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;a href=&quot;https://youtu.be/NxuwEbjoEQ0?si=eyAh6t81jUFjbSbF&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://youtu.be/NxuwEbjoEQ0?si=eyAh6t81jUFjbSbF&lt;/a&gt;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=NxuwEbjoEQ0&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/ca7Myj/hyUFdxeak8/4C7Cu5kQwFeqCaTYZVNFjK/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;programmers co kr 코딩테스트 연습 SummerWinter Coding~2018 방문 길이&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/NxuwEbjoEQ0&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;파이썬&amp;nbsp;소스:&amp;nbsp;&lt;a href=&quot;https://bit.ly/3N84H9e&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://bit.ly/3N84H9e&lt;/a&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;문제&amp;nbsp;링크:&amp;nbsp;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/49994&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/49994&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1701596075430&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;프로그래머스&quot; data-og-description=&quot;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&quot; data-og-host=&quot;programmers.co.kr&quot; data-og-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/49994&quot; data-og-url=&quot;https://programmers.co.kr/&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/Vdt49/hyUFbzqkz0/AkkHX0QDkfXfzoySvC9I81/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/b7j4yA/hyUIrN8nUC/sraIM3t2yG2KQD6mtbfPik/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630&quot;&gt;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/49994&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/49994&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/Vdt49/hyUFbzqkz0/AkkHX0QDkfXfzoySvC9I81/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/b7j4yA/hyUIrN8nUC/sraIM3t2yG2KQD6mtbfPik/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;프로그래머스&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;programmers.co.kr&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>방문길이</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/402</guid>
      <comments>https://skysign.tistory.com/402#entry402comment</comments>
      <pubDate>Sun, 3 Dec 2023 18:35:03 +0900</pubDate>
    </item>
    <item>
      <title>2019 KAKAO BLIND RECRUITMENT 실패율</title>
      <link>https://skysign.tistory.com/401</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;유튜브&amp;nbsp;문제&amp;nbsp;풀이:&amp;nbsp;&lt;a href=&quot;https://youtu.be/Zo8hECJa_ms?si=cB0vo11Izy5wCjSE&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://youtu.be/Zo8hECJa_ms?si=cB0vo11Izy5wCjSE&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1700992871193&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;- YouTube&quot; data-og-description=&quot;&quot; data-og-host=&quot;www.youtube.com&quot; data-og-source-url=&quot;https://youtu.be/Zo8hECJa_ms?si=cB0vo11Izy5wCjSE&quot; data-og-url=&quot;https://www.youtube.com/watch?si=cB0vo11Izy5wCjSE&amp;amp;v=Zo8hECJa_ms&amp;amp;feature=youtu.be&quot; data-og-image=&quot;&quot;&gt;&lt;a href=&quot;https://youtu.be/Zo8hECJa_ms?si=cB0vo11Izy5wCjSE&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://youtu.be/Zo8hECJa_ms?si=cB0vo11Izy5wCjSE&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url();&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;- YouTube&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;www.youtube.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;파이썬&amp;nbsp;소스:&amp;nbsp;&lt;a href=&quot;https://bit.ly/47wagqb&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://bit.ly/47wagqb&lt;/a&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;문제&amp;nbsp;링크:&amp;nbsp;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/42889&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/42889&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1700992886741&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;프로그래머스&quot; data-og-description=&quot;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&quot; data-og-host=&quot;programmers.co.kr&quot; data-og-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/42889&quot; data-og-url=&quot;https://programmers.co.kr/&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/sCrK6/hyUE8ViI2u/cBidh3uKzdfkwONZ4iwGO0/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/mlGlB/hyUE8OxKqv/9OqOZi7Xucy35rmK1I0TKK/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630&quot;&gt;&lt;a href=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/42889&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://school.programmers.co.kr/learn/courses/30/lessons/42889&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/sCrK6/hyUE8ViI2u/cBidh3uKzdfkwONZ4iwGO0/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630,https://scrap.kakaocdn.net/dn/mlGlB/hyUE8OxKqv/9OqOZi7Xucy35rmK1I0TKK/img.png?width=1200&amp;amp;height=630&amp;amp;face=0_0_1200_630');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;프로그래머스&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;programmers.co.kr&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>카카오 기출문제</category>
      <category>2019KAKAOBLINDRECRUITMENT</category>
      <category>Python</category>
      <category>실패율</category>
      <category>파이썬</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/401</guid>
      <comments>https://skysign.tistory.com/401#entry401comment</comments>
      <pubDate>Sun, 26 Nov 2023 19:02:16 +0900</pubDate>
    </item>
    <item>
      <title>집에 책상이 두개나 있지만, 책읽을 집중은 안될 때...</title>
      <link>https://skysign.tistory.com/400</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;책읽자&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;책읽자&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;하지만... 쉽게 책이 손에 잡히지는 안는다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;그러면 집이라는 공간에서 벗어나서, 다른 곳으로 가보자~!&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;원본글링크는 여기 &lt;a href=&quot;https://onemoreweekend.co.kr/feed/?q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;bmode=view&amp;amp;idx=16756448&amp;amp;t=board&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://onemoreweekend.co.kr/feed/?q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;bmode=view&amp;amp;idx=16756448&amp;amp;t=board&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1699038911158&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;article&quot; data-og-title=&quot;집중이 필요한 날, 무인서재 : 주말에 뭐하지? 주말랭이 뉴스레터&quot; data-og-description=&quot;#무인서재 #책방 #몰입어릴 적 서점에 가면 책장에 기대앉아 집에서는 안 나오던 집중력으로 하염없이 책을 읽었던 기억이 나. 책이 있는 공간은 유난히 집중이 더 잘되는 것 같아. 책을 읽거나 &quot; data-og-host=&quot;onemoreweekend.co.kr&quot; data-og-source-url=&quot;https://onemoreweekend.co.kr/feed/?q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;bmode=view&amp;amp;idx=16756448&amp;amp;t=board&quot; data-og-url=&quot;https://onemoreweekend.co.kr/feed/?bmode=view&amp;amp;idx=16756448&amp;amp;q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;t=board&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/kxa58/hyUnWbvysC/ig8HIrR8yvJFJABnErXm0K/img.jpg?width=630&amp;amp;height=630&amp;amp;face=0_0_630_630,https://scrap.kakaocdn.net/dn/mu34C/hyUrtFtZsY/YR4C4ynIHhfx5Umjc1yKE1/img.jpg?width=630&amp;amp;height=630&amp;amp;face=0_0_630_630,https://scrap.kakaocdn.net/dn/eCURJ4/hyUrxA6KAL/KtyhexMho2jv2HFJbSwoG0/img.jpg?width=2080&amp;amp;height=1040&amp;amp;face=1257_708_1393_854&quot;&gt;&lt;a href=&quot;https://onemoreweekend.co.kr/feed/?q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;bmode=view&amp;amp;idx=16756448&amp;amp;t=board&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://onemoreweekend.co.kr/feed/?q=YToxOntzOjEyOiJrZXl3b3JkX3R5cGUiO3M6MzoiYWxsIjt9&amp;amp;bmode=view&amp;amp;idx=16756448&amp;amp;t=board&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/kxa58/hyUnWbvysC/ig8HIrR8yvJFJABnErXm0K/img.jpg?width=630&amp;amp;height=630&amp;amp;face=0_0_630_630,https://scrap.kakaocdn.net/dn/mu34C/hyUrtFtZsY/YR4C4ynIHhfx5Umjc1yKE1/img.jpg?width=630&amp;amp;height=630&amp;amp;face=0_0_630_630,https://scrap.kakaocdn.net/dn/eCURJ4/hyUrxA6KAL/KtyhexMho2jv2HFJbSwoG0/img.jpg?width=2080&amp;amp;height=1040&amp;amp;face=1257_708_1393_854');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;집중이 필요한 날, 무인서재 : 주말에 뭐하지? 주말랭이 뉴스레터&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;#무인서재 #책방 #몰입어릴 적 서점에 가면 책장에 기대앉아 집에서는 안 나오던 집중력으로 하염없이 책을 읽었던 기억이 나. 책이 있는 공간은 유난히 집중이 더 잘되는 것 같아. 책을 읽거나&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;onemoreweekend.co.kr&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;집에서 가까운순으로 찾아 보면,&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;서울 관악구 &lt;a href=&quot;https://naver.me/F2wpCgAX&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot;&gt;회전문서재&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1699038827969&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;article&quot; data-og-title=&quot;회전문서재 : 네이버 &quot; data-og-description=&quot;방문자리뷰 36 &amp;middot; 블로그리뷰 11&quot; data-og-host=&quot;m.place.naver.com&quot; data-og-source-url=&quot;https://naver.me/F2wpCgAX&quot; data-og-url=&quot;https://m.place.naver.com/place/1671428703/home&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/dx5Wbx/hyUnLVlPZj/7b0EE92yBkvWOJ3kZRgPr0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/cDWiqz/hyUrsNkZvd/mUcrHYdIzKaJIXVZ2tSeF1/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380&quot;&gt;&lt;a href=&quot;https://naver.me/F2wpCgAX&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://naver.me/F2wpCgAX&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/dx5Wbx/hyUnLVlPZj/7b0EE92yBkvWOJ3kZRgPr0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/cDWiqz/hyUrsNkZvd/mUcrHYdIzKaJIXVZ2tSeF1/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;회전문서재 : 네이버 &lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;방문자리뷰 36 &amp;middot; 블로그리뷰 11&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;m.place.naver.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;ul style=&quot;list-style-type: disc;&quot; data-ke-list-type=&quot;disc&quot;&gt;
&lt;li style=&quot;text-align: justify;&quot;&gt;가격: 입장권 2,000원 / 1인 1시간 1,000원 / 나만의 서재 2시간 30분 5,000원&lt;/li&gt;
&lt;li style=&quot;text-align: justify;&quot;&gt;&lt;a href=&quot;https://naver.me/FVBeQMQF&quot;&gt;&lt;b&gt;&lt;u&gt;예약하기&lt;/u&gt;&lt;/b&gt;&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;서울 송파의 &lt;a href=&quot;https://naver.me/FfWRe2ug&quot;&gt;&lt;u&gt;&lt;b&gt;요즘서재&lt;/b&gt;&lt;/u&gt;&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1699038871637&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/MRypp/hyUnOqYL3Z/Zm62nDtw0weyPrUqaQter0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/L53fz/hyUnLHObgv/V0tQrHcKPV86LKZj0tkaK0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380&quot; data-og-url=&quot;https://m.place.naver.com/place/1265398630/home&quot; data-og-source-url=&quot;https://naver.me/FfWRe2ug&quot; data-og-host=&quot;m.place.naver.com&quot; data-og-description=&quot;방문자리뷰 70 &amp;middot; 블로그리뷰 22&quot; data-og-title=&quot;요즘서재 : 네이버 &quot; data-og-type=&quot;article&quot; data-ke-align=&quot;alignCenter&quot; data-ke-type=&quot;opengraph&quot;&gt;&lt;a href=&quot;https://naver.me/FfWRe2ug&quot; data-source-url=&quot;https://naver.me/FfWRe2ug&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/MRypp/hyUnOqYL3Z/Zm62nDtw0weyPrUqaQter0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/L53fz/hyUnLHObgv/V0tQrHcKPV86LKZj0tkaK0/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;요즘서재 : 네이버 &lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;방문자리뷰 70 &amp;middot; 블로그리뷰 22&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;m.place.naver.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;ul style=&quot;list-style-type: disc;&quot; data-ke-list-type=&quot;disc&quot;&gt;
&lt;li style=&quot;text-align: left;&quot;&gt;가격: 1인용 테이블 1시간 1,700원 / (주말 기준) 단독 대관 시 2시간 13,000원&lt;/li&gt;
&lt;li style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://naver.me/xpaMtzWT&quot;&gt;&lt;u&gt;&lt;b&gt;예약하기&lt;/b&gt;&lt;/u&gt;&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;서울 용산 &lt;a href=&quot;https://naver.me/FpXZ0WRq&quot;&gt;&lt;b&gt;&lt;u&gt;후암서재&lt;/u&gt;&lt;/b&gt;&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1699038871638&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/JaVQy/hyUrqWivbm/jdpGD76Q5finDlodMYWKw1/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/gWJ9v/hyUnS1bROX/6defC8MxpHCpRhk52rgv9k/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380&quot; data-og-url=&quot;https://m.place.naver.com/place/1550410042/home&quot; data-og-source-url=&quot;https://naver.me/FpXZ0WRq&quot; data-og-host=&quot;m.place.naver.com&quot; data-og-description=&quot;방문자리뷰 268 &amp;middot; 블로그리뷰 45&quot; data-og-title=&quot;후암서재 : 네이버 &quot; data-og-type=&quot;article&quot; data-ke-align=&quot;alignCenter&quot; data-ke-type=&quot;opengraph&quot;&gt;&lt;a href=&quot;https://naver.me/FpXZ0WRq&quot; data-source-url=&quot;https://naver.me/FpXZ0WRq&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/JaVQy/hyUrqWivbm/jdpGD76Q5finDlodMYWKw1/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380,https://scrap.kakaocdn.net/dn/gWJ9v/hyUnS1bROX/6defC8MxpHCpRhk52rgv9k/img.jpg?width=640&amp;amp;height=380&amp;amp;face=0_0_640_380');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;후암서재 : 네이버 &lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;방문자리뷰 268 &amp;middot; 블로그리뷰 45&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;m.place.naver.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;ul style=&quot;list-style-type: disc;&quot; data-ke-list-type=&quot;disc&quot;&gt;
&lt;li style=&quot;text-align: left;&quot;&gt;가격: 낮 1인 8시간 18,000원 / 밤 1인 7시간 25,200원&lt;/li&gt;
&lt;li style=&quot;text-align: left;&quot;&gt;&lt;a href=&quot;https://naver.me/Gozp3qav&quot;&gt;&lt;u&gt;&lt;b&gt;예약하기&lt;/b&gt;&lt;/u&gt;&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description>
      <category>기타</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/400</guid>
      <comments>https://skysign.tistory.com/400#entry400comment</comments>
      <pubDate>Sat, 4 Nov 2023 04:17:23 +0900</pubDate>
    </item>
    <item>
      <title>leetcode com 42  Trapping Rain Water</title>
      <link>https://skysign.tistory.com/399</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;a href=&quot;https://youtu.be/a4mjOFMEDQk?si=uKMBVuRG1SaEn3Jl&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://youtu.be/a4mjOFMEDQk?si=uKMBVuRG1SaEn3Jl&lt;/a&gt;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=a4mjOFMEDQk&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/h9J3G/hyUkaMAX1v/ZSX9CGv4j3uXLUvIMtZSEk/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;leetcode com 42  Trapping Rain Water&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/a4mjOFMEDQk&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;문제: &lt;a href=&quot;https://leetcode.com/problems/trapping-rain-water/description/&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://leetcode.com/problems/trapping-rain-water/description/&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1697942406557&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;Trapping Rain Water - LeetCode&quot; data-og-description=&quot;Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. &amp;nbsp; Example 1: [https://assets.leetcode.com/upl&quot; data-og-host=&quot;leetcode.com&quot; data-og-source-url=&quot;https://leetcode.com/problems/trapping-rain-water/description/&quot; data-og-url=&quot;https://leetcode.com/problems/trapping-rain-water/description&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/dSJvA6/hyUgRnz0om/DD0S2p3pkCwXnRRpnCxTM0/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260&quot;&gt;&lt;a href=&quot;https://leetcode.com/problems/trapping-rain-water/description/&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://leetcode.com/problems/trapping-rain-water/description/&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/dSJvA6/hyUgRnz0om/DD0S2p3pkCwXnRRpnCxTM0/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;Trapping Rain Water - LeetCode&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;Can you solve this real interview question? Trapping Rain Water - Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. &amp;nbsp; Example 1: [https://assets.leetcode.com/upl&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;leetcode.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span&gt;&lt;span style=&quot;color: #131313;&quot;&gt;파이썬 소스: &lt;/span&gt;&lt;span style=&quot;color: #065fd4;&quot;&gt;&lt;a href=&quot;https://bit.ly/3rJOrUK&quot;&gt;https://bit.ly/3rJOrUK&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>Leetcode.com</category>
      <category>LeetCode 42</category>
      <category>Trapping Rain Water</category>
      <category>파이썬</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/399</guid>
      <comments>https://skysign.tistory.com/399#entry399comment</comments>
      <pubDate>Sun, 22 Oct 2023 11:40:47 +0900</pubDate>
    </item>
    <item>
      <title>leetcode.com 11. Container With Most Water</title>
      <link>https://skysign.tistory.com/398</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;유튜브&amp;nbsp;문제&amp;nbsp;풀이:&amp;nbsp;&lt;a href=&quot;https://youtu.be/Nq0DV7dn7So?si=LjAW9kqp2s5uNNfP&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://youtu.be/Nq0DV7dn7So?si=LjAW9kqp2s5uNNfP&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1697871800386&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;- YouTube&quot; data-og-description=&quot;&quot; data-og-host=&quot;www.youtube.com&quot; data-og-source-url=&quot;https://youtu.be/Nq0DV7dn7So?si=LjAW9kqp2s5uNNfP&quot; data-og-url=&quot;https://www.youtube.com/watch?si=LjAW9kqp2s5uNNfP&amp;amp;v=Nq0DV7dn7So&amp;amp;feature=youtu.be&quot; data-og-image=&quot;&quot;&gt;&lt;a href=&quot;https://youtu.be/Nq0DV7dn7So?si=LjAW9kqp2s5uNNfP&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://youtu.be/Nq0DV7dn7So?si=LjAW9kqp2s5uNNfP&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url();&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;- YouTube&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;www.youtube.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;​문제&amp;nbsp;링크:&amp;nbsp;&lt;a href=&quot;https://leetcode.com/problems/container-with-most-water/&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://leetcode.com/problems/container-with-most-water/&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1697871727676&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;Container With Most Water - LeetCode&quot; data-og-description=&quot;Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget&quot; data-og-host=&quot;leetcode.com&quot; data-og-source-url=&quot;https://leetcode.com/problems/container-with-most-water/&quot; data-og-url=&quot;https://leetcode.com/problems/container-with-most-water/description&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/cLIp91/hyUgUdfmyn/191mCT0Cbuvzhe6VkV7W40/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260&quot;&gt;&lt;a href=&quot;https://leetcode.com/problems/container-with-most-water/&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://leetcode.com/problems/container-with-most-water/&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/cLIp91/hyUgUdfmyn/191mCT0Cbuvzhe6VkV7W40/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;Container With Most Water - LeetCode&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;leetcode.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;div style=&quot;background-color: #ffffff; color: #080808;&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div style=&quot;background-color: #ffffff; color: #080808;&quot;&gt;파이썬&amp;nbsp;소스:&amp;nbsp;&lt;a href=&quot;https://bit.ly/3S0Lsly&quot; target=&quot;_blank&quot; rel=&quot;noopener&amp;nbsp;noreferrer&quot;&gt;https://bit.ly/3S0Lsly&lt;/a&gt;&lt;/div&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>Leetcode.com</category>
      <category>Container With Most Water</category>
      <category>leetcode.com 11</category>
      <category>파이썬</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/398</guid>
      <comments>https://skysign.tistory.com/398#entry398comment</comments>
      <pubDate>Sat, 21 Oct 2023 16:02:45 +0900</pubDate>
    </item>
    <item>
      <title>leetcode com 15.  3Sum</title>
      <link>https://skysign.tistory.com/397</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;a href=&quot;https://youtu.be/RCa2xJFDUIg?si=N24DhCYSeAVqB5Po&quot;&gt;https://youtu.be/RCa2xJFDUIg?si=N24DhCYSeAVqB5Po&lt;/a&gt;&amp;nbsp;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=RCa2xJFDUIg&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/bMjLdG/hyUdOwN3fw/4fIl4JBVmGNBKM2VFOP1a1/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;leetcode com 15  3Sum&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/RCa2xJFDUIg&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;a href=&quot;https://leetcode.com/problems/3sum/&quot;&gt;https://leetcode.com/problems/3sum/&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1697329233049&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;3Sum - LeetCode&quot; data-og-description=&quot;Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain du&quot; data-og-host=&quot;leetcode.com&quot; data-og-source-url=&quot;https://leetcode.com/problems/3sum/&quot; data-og-url=&quot;https://leetcode.com/problems/3sum/description&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/PCbuT/hyUdWInytd/KRoOHqN3ATFqt0uXnN6khk/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260&quot;&gt;&lt;a href=&quot;https://leetcode.com/problems/3sum/&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://leetcode.com/problems/3sum/&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/PCbuT/hyUdWInytd/KRoOHqN3ATFqt0uXnN6khk/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;3Sum - LeetCode&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain du&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;leetcode.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;파이썬 소스: &lt;a href=&quot;https://bit.ly/3LRMvQR&quot;&gt;https://bit.ly/3LRMvQR&lt;/a&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>Leetcode.com</category>
      <category>3sum</category>
      <category>소스</category>
      <category>파이썬</category>
      <category>풀이</category>
      <category>해설</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/397</guid>
      <comments>https://skysign.tistory.com/397#entry397comment</comments>
      <pubDate>Sun, 15 Oct 2023 09:20:58 +0900</pubDate>
    </item>
    <item>
      <title>leetcode.com 167. Two Sum II - Input Array Is Sorted</title>
      <link>https://skysign.tistory.com/396</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;문제&amp;nbsp;링크:&amp;nbsp;&lt;a href=&quot;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot;&gt;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/&lt;/a&gt;&lt;/p&gt;
&lt;figure id=&quot;og_1697192817447&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;Two Sum II - Input Array Is Sorted - LeetCode&quot; data-og-description=&quot;Can you solve this real interview question? Two Sum II - Input Array Is Sorted - Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two n&quot; data-og-host=&quot;leetcode.com&quot; data-og-source-url=&quot;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/&quot; data-og-url=&quot;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/description&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/bzOAA5/hyUdXfXhEt/IsK7P2E6mWsa9S7StkB88K/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260&quot;&gt;&lt;a href=&quot;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/bzOAA5/hyUdXfXhEt/IsK7P2E6mWsa9S7StkB88K/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;Two Sum II - Input Array Is Sorted - LeetCode&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;Can you solve this real interview question? Two Sum II - Input Array Is Sorted - Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two n&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;leetcode.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;유튜브&amp;nbsp;문제&amp;nbsp;풀이:&amp;nbsp;&lt;a href=&quot;https://youtu.be/5Nu8kzohGDM?si=vQB2YD-V27iGuuBH&quot;&gt;https://youtu.be/5Nu8kzohGDM?si=vQB2YD-V27iGuuBH&lt;/a&gt;&amp;nbsp;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=5Nu8kzohGDM&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/iJSuH/hyUdQHUH0j/jDM8M0Cl0GHBbOowrqKbf1/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;leetcode com 167  Two Sum II   Input Array Is Sorted&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/5Nu8kzohGDM&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;파이썬&amp;nbsp;소스:&amp;nbsp;&lt;a href=&quot;https://bit.ly/45kKBio&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot;&gt;https://bit.ly/45kKBio&lt;/a&gt;&lt;/p&gt;</description>
      <category>Leetcode.com</category>
      <category>leetcode.com 167</category>
      <category>Two Sum II - Input Array Is Sorted</category>
      <category>소스</category>
      <category>파이썬</category>
      <category>풀이</category>
      <category>해설</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/396</guid>
      <comments>https://skysign.tistory.com/396#entry396comment</comments>
      <pubDate>Fri, 13 Oct 2023 19:28:58 +0900</pubDate>
    </item>
    <item>
      <title>개발자 면접 유형, 6가지 면접 유형 정리</title>
      <link>https://skysign.tistory.com/395</link>
      <description>&lt;div id=&quot;SE-1cbc322b-5fc4-40f2-808e-fa8c383598c8&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-1cbc322b-5fc4-40f2-808e-fa8c383598c8&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-1cbc322b-5fc4-40f2-808e-fa8c383598c8&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-e0289c23-480f-4fe3-abf0-6181af196f11&quot;&gt;
&lt;p id=&quot;SE-e7da1fd8-b3b7-4742-8936-2935d65c1f1c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;개발자 면접에 대한 6가지 유형을 살펴 보겠습니다. 제가 작성한 글은 아니구요, 원본은 아래 링크 이구요, 해당 내용에 저의 뇌피셜을 포함해서 작성한 글입니다.&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-84ae13b6-ead7-4dc0-9c82-ff47214e459a&quot; data-a11y-title=&quot;인용구&quot; data-compid=&quot;SE-84ae13b6-ead7-4dc0-9c82-ff47214e459a&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-84ae13b6-ead7-4dc0-9c82-ff47214e459a&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div&gt;
&lt;div id=&quot;SE-8773b1cb-83e6-49ec-b148-5b5dea4e7361&quot;&gt;
&lt;p id=&quot;SE-9400ffde-d5a5-48f9-a104-2709974115b1&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&amp;lt;&lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt; &amp;zwj; &lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt; 개발자 면접 유형 총정리&amp;gt;&lt;/i&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-191a88de-d0fc-42af-acdb-74baf89850b8&quot;&gt;
&lt;p id=&quot;SE-20c636bf-053d-43cd-a24a-fa153598ef8e&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #777777;&quot;&gt;&lt;a href=&quot;https://careerly.co.kr/comments/66132&quot;&gt;https://careerly.co.kr/comments/66132&lt;/a&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-c38d5a5c-dcda-4592-a506-6324725e0bb2&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-c38d5a5c-dcda-4592-a506-6324725e0bb2&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-c38d5a5c-dcda-4592-a506-6324725e0bb2&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-5722b077-e2c5-49d2-8c75-b61bbdae8cc2&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-d002cca9-bdc4-4797-a1b4-5ab08530eeb0&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-d002cca9-bdc4-4797-a1b4-5ab08530eeb0&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-d002cca9-bdc4-4797-a1b4-5ab08530eeb0&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-10992627-d9e7-484d-a1ed-481463ae9a36&quot;&gt;
&lt;p id=&quot;SE-2463c3b0-17aa-4b4c-a45a-71307504e497&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-65cdb62e-cb62-4c23-9158-4165138e7eb7&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;1. 온라인 코딩 테스트&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-8667db40-3420-4210-958c-b62410d8bd42&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-ff462ed2-f3b5-4c2e-ad9c-f8d8b9b5e1ee&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이메일로 문제를 주기도 하지만, 요즘은 특정 웹사이트에 로그인해서 문제를 풀게 됩니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-f23fb8b1-9386-4b65-96b7-bcff9247e730&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;크게 2가지 유형으로 테스트가 치뤄 지는 대요.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-bead91b1-b4f0-4924-8d50-70f0f0d9dac0&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;1~2시간 2~3문제&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-e7b8ba89-cac3-48ae-9ebf-3d405d9df9d7&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;3~4시간 4~5문제&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-a30a79b3-cf77-410e-a57d-67aa6e37ee50&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;쉬운문제와 어려운 문제에 대한 시간 배분을 15~30분, 45분~1시간 정도로 놓고 문제 푸시면 적절한 시간 배분입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-60a98b8c-ce9d-43d9-9632-1e337233e5a1&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;가능하면 쉬운 문제는 빨리 푸는게, 시간을 버는 요령입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-a54b3273-bfc9-44bc-8647-a4532d48a1f8&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-c2257bdb-112c-4578-aba2-7af8f737be98&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-ef024efa-12ba-41dc-af22-277ea468b60f&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;2, 라이브 코딩 테스트&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-d8cb2b7d-e0bc-4ba5-8874-c9f5cf88a5ed&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-8d72d704-296b-41b8-9b2b-72e3129efc04&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;인터뷰어와 함께 보통 1:1로 진행되구요, 카메라가 켜진상태의 CC(conference call)을 하면서 코딩을 합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-afb868f7-aa07-4491-92c9-a5ea0af2b3eb&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;보통 1시간이구요, 인사및 서로 소개 등에 5~10분정도 사용하고, 나머지 시간 50분 정도에 풀 수 있는 문제가 나옮니다.&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-7a6bb0e4-f2ae-4d51-8100-f3e703507e0b&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;u&gt;여기서는 문제를 푸는 것도 중요하지만, 문제를 어떻게 접근해 가는지 인터뷰어가 보고 있다는 점을 염두해 두셔야 합니다.&lt;/u&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-e3dd1794-4f61-49b5-811f-c91c7b8e9477&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;따라서, 아무말 없이 하기 보다는, 문제를 푸는 어떤 단계별로 이야기를 하시는게 중요합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-5f760ace-ba0b-4ce4-878c-03c08b3e59c9&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&lt;b&gt;'인터뷰어한테 말한다.'&lt;/b&gt;&lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 라고 인지하고 말하려고 하면, 말이 잘 떨어지지 않기 때문에...&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-71e42c29-e5e1-4389-b1d9-a2e68dbf04e0&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&lt;b&gt;'혼자 문제에대해서 중얼거린다.'&lt;/b&gt;&lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 라고 생각하고 말하면 조금 말하기 쉬워 집니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-77eab703-e748-49ce-82cc-e493472ad3dc&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;대충 이런 것이죠. &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;u&gt;'입력값이 10^5이기 때문에, N^2 알고리즘은 쓰기 어렵겠네요.'&lt;/u&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-679a4edd-0767-437a-8bf5-5926c8087edd&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;u&gt;'통상적으로 10^9 넘어가는 complexity이면, 원하는 시간안에 실행되지 못할 것으로 가정하니까 ...'&lt;/u&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-6bbc36d6-823e-47c3-bcc8-a7d3c5230ebf&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이런 식으로 말하면서 푸는게 중요합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-9d1554b6-f7e0-4710-a385-a192311ac04d&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-7210482b-5237-49d8-9018-7a32e24bac9d&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-ebf731ac-32fe-49cc-9d81-1a5d17505d20&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;3. 코딩 과제&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-049781ce-b2a1-47eb-a439-b41ecc19d714&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-c7a2ad72-208d-46bf-9d5e-f6033e829966&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;어떤 서비스를 구현하거나, 특정 기능을 구현해 달라는 경우가, &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&lt;b&gt;#3번 코딩 과제&lt;/b&gt;&lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 에 해당합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-cc770d7b-3b5f-4c78-9ecf-c30a71e127e9&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;구현하는 시간만 보면 몇시간 정도면 코딩할 양이지만, 코딩의 내용및 알고리즘등을 모른다면,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-d1067d10-dc84-47fd-84e0-ea0dd158f98d&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;몇일 이상이 걸릴만한 과제를 내는 것이 일반적입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-7d4a1bb3-4c65-486b-84f3-2badc5a19df4&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;따라서, 코딩 과제를 내고, 몇일 이내에 답변을 달라고 하는 경우가 많습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-05cd4ac1-7c15-43e6-b9e3-ccefed5c9470&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;예를 들면, 금요일에 메일을 보내고, 월요일에 답변을 달라고 하는 것이죠.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-ba361085-a8fb-49b7-8207-d16a18972205&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 즉, 코딩 과제 내용을 알고 있다면, 기간 안에 코딩을 해서 보낼 수 있겠지만,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-5c7f8b41-2b74-4c2d-890b-a17727318c3a&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;알지 못한다면, 그 기간 동안 공부하거나, 배워서 개발하는것은 어려운 과제가 주어집니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-fe6822e9-e597-4804-8e34-21f3011e9d72&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-7b5874f7-11ab-4137-9d28-c7df1e3fc67a&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-687bb5c6-84cd-492f-a89d-88175a6b218c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;4. 기술면접 (이론 중심)&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-c2a6cb77-87a2-4231-9091-b945656b7f1b&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-b7d8a6e3-1c1e-4e7f-a3e4-ea2dfb19a139&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;여기까지 오면 앞의 인터뷰는 잘 통과하신 것이구요, 이제 면접의 중간 단계입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-1b6b8e94-4085-474b-9010-6bf713a9648d&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;컴퓨터 공학의 이론적인부분, 프로그래밍 언어의 조금 깊은 부분까지 아주 넓은 분야에서 다양한 질문이 나올 수 있습니다. 출체 범위는 Computer Science학부 과정의 거의 모든 내용입니다. 이렇게 말하면 너무 넓은 분야입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-6cb7e11b-8636-4e21-a7d1-967767b160ce&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;좀 좁혀가는 방법을 알려 드리면, 지원한 회사의 업무및 지원한 부서에서 주로 다루는 것에 대해서 미리 공부하시는 것을 추천드립니다. 웹서비스를 개발하는 부서 에 지원했다고 가정해 봅시다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-785af15e-f150-4eaa-a357-e0f14f46a36e&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;그러면 프로그래밍 언어대한 질문을 할 때, &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&lt;b&gt;'자바스크립트와 타입스크립트의 차이점및 관계에 대해서 설명해주세요'&lt;/b&gt;&lt;/i&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-e24a9034-2121-4fa9-b1db-f672c85f9a56&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이런 질문을 예상해 볼 수 있습니다. 원글에 있는 질문인 &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;i&gt;&lt;b&gt;'브라우저에 www.google.com을 치면 페이지가 로딩되기까지 어떤 과정을 거치나요?'&lt;/b&gt;&lt;/i&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 도 웹서비스를 하는 팀에서 할만한 좋은 질문입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-723c790a-0dd2-4062-8d48-61b128f38f5e&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-3d0ea909-62a6-40fb-b7c1-e8fb55b04829&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;div id=&quot;SE-a715bf6f-a993-4056-944b-123d8696b7e9&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-a715bf6f-a993-4056-944b-123d8696b7e9&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-a715bf6f-a993-4056-944b-123d8696b7e9&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-f0f9d1f7-2217-4827-9701-915077e4e5ef&quot;&gt;
&lt;p id=&quot;SE-1048d0dc-6463-4bec-8fb7-f20042c43d45&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;5. 기술면접 (시스템 설계 중심)&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-b5f5ead3-4553-446d-888f-21bcae89097c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 말그대로 어떤 시스템을 설계할 수 있는지, 알아 보는 면접입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-d4cd5963-fee0-46af-ab1b-6a935b28fcdb&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;기존에 널리 알려진 서비스(유튜브, 인스타그램)들을 설계해보라고 할 수도 있구요.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-43b715c4-70dd-45ca-9f4f-ca352fcf2145&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;잘 알려진 서비스라면, 해당 서비스의 특정 부분을 설계를 요구할 수도 있습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-03c35738-cebf-422e-9bed-225d621ad947&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 여기서는 면접관이 요구하는 바가 무엇인지를 파악하는 능력이 중요합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-b1d2b8e2-ffc5-4efe-b207-58295cc35a5c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;같은 문제 여도, 클라우드를 잘 활용해서 설계를 할지? 장애대응에 초점을 맞춰서 설계를 할지?&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-98559059-7403-46d1-8c84-ba89a9a66222&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이런 것들이 시스템 설계에 반영되어, 같은 질문이여도, 다른 설계를 할 수 있습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-eb04c773-3633-41d6-8ef4-633ea038cb04&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 이럴 때는 면접관과 적극적인 대화를 통해서, 의도를 파악하는 것이 중요합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-54e665a5-e018-4c77-9198-ca9709c6c145&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이런식을 대화를 면접관에게 시도해볼 수 있습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-38e4e0db-4f2d-4bbd-beed-579b48785f17&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;'정적파일의 경우 아마존 S3를 사용하는 것이 일반적이지만, 장애에 아주 민감한 경우&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-8de781f6-7063-4bcc-ba26-a8a897a8566c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;S3에만 의존하여 서비스를 어렵습니다. K8S를 통해서 멀티 클라우드(Google, Azure)를 함께 사용하는&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-09243801-bbaf-4835-b3da-0ea39903ce48&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;방법으로 시스템을 디자인하는 것이 좋아 보입니다. 이번 설계에서는 장애의 중요성을 어느정도 감안해서&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-640ec2d9-25e8-43d3-a954-29911b009944&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;시스템을 설계하는 것이 좋을 까요?' 이런 질문을 한다면, 면접관의 답변에 따라서,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-1096a437-adf4-489a-aa1f-e186abcdf28f&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;어떤 시스템 설계를 의도한 것인지, 알 수 있습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-c3e8bd5a-44ef-47f6-813f-a70bd5178775&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;즉 장애가 시스템 설계에서 매우 중요한지?&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-0e08507b-36c1-4dbe-bd20-83ab34c129e2&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;k8s의 멀티 클라우드 오케스트레인션에 대해서 알고 있는지 확인하고 싶은 것인지?&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-3292ebe0-ea30-4ac7-ac61-5746661329c5&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;기타 면접관의 질문의도를 파악할 수 있게 되구요.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-e89dd92e-1413-4e8a-9c4c-1935ef8535d9&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;파학된 질문 의도에 따라서, 시스템 설계를 계속해 나아간다면, 좋은 결과를 얻을 확률이 계속 올라가겠죠 :)&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-dd4f4d13-c3a4-4606-a499-1daa72c23963&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-135056b1-1f42-460c-b804-98d15fa1e29c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;시스템 설계 중심의 기술면접을 조금더 쳬계적으로 접근하려면, 아래글을 추천드립니다.&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-a9af9538-d3d5-4b70-80cd-0c1e54e91600&quot; data-a11y-title=&quot;인용구&quot; data-compid=&quot;SE-a9af9538-d3d5-4b70-80cd-0c1e54e91600&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-a9af9538-d3d5-4b70-80cd-0c1e54e91600&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div&gt;
&lt;div id=&quot;SE-d3b632b7-157d-41ec-87c7-d4cfddb55126&quot;&gt;
&lt;p id=&quot;SE-5348a46d-b465-4415-b865-6a3bde07cada&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;b&gt;&lt;i&gt;&amp;lt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;b&gt;&lt;i&gt;⚙️&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;b&gt;&lt;i&gt; 소프트웨어 시스템 설계 시 고려할 세 가지&amp;gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-8f081f17-6454-424a-924f-f4a1471b662a&quot;&gt;
&lt;p id=&quot;SE-5df86437-2243-4beb-ad09-9649d17d58d1&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #777777;&quot;&gt;&lt;a href=&quot;https://careerly.co.kr/comments/67065&quot;&gt;https://careerly.co.kr/comments/67065&lt;/a&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-3eb187cf-b58c-401a-bd01-9cfed667bd3b&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-3eb187cf-b58c-401a-bd01-9cfed667bd3b&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-3eb187cf-b58c-401a-bd01-9cfed667bd3b&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-458eda73-f637-4f5e-971a-a0bd9deb73eb&quot;&gt;
&lt;p id=&quot;SE-5334d4bc-9597-44e2-b855-070f6cc618ec&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;1️⃣&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 신뢰성(Reliability), &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;2️⃣&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 확장성(Scalability), &lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt;3️⃣&lt;/span&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 유지보수성(Maintainability) 에 대해서 잘 설명하고 있는 글입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-61b36c20-b104-4a4c-9e66-6908c89fc69c&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-15028783-368f-4a7d-8401-3dcf17f0a8e7&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;그러면 마지막으로 실제와 유사한 사례를 공유하겠습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-2379694d-a3ac-4665-8263-01a43ad53b41&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;bitly와 같은 URL shortening service를 위한 시스템을 설계해 보라는 질문을 받는 다면, 아래 링크에 잘 설명되어 있습니다. 유료자료이지만, 광고 아닙니다. 무료로 열려 있는 부분만 보셔도 충분합니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-97a1260b-19d3-4840-b902-245855c0396f&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot; data-href=&quot;https://www.designgurus.io/course/grokking-the-system-design-interview&quot;&gt;&lt;a href=&quot;https://www.designgurus.io/course/grokking-the-system-design-interview&quot;&gt;https://www.designgurus.io/course/grokking-the-system-design-interview&lt;/a&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-7e0dd116-6a98-4dba-b80e-7686e1968ab1&quot; data-a11y-title=&quot;링크&quot; data-compid=&quot;SE-7e0dd116-6a98-4dba-b80e-7686e1968ab1&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-7e0dd116-6a98-4dba-b80e-7686e1968ab1&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div&gt;
&lt;div&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;500&quot; data-origin-height=&quot;300&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/opfQr/btsyqvFiGtl/DNotdWlvRuqPZ8GxIIRV6k/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/opfQr/btsyqvFiGtl/DNotdWlvRuqPZ8GxIIRV6k/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/opfQr/btsyqvFiGtl/DNotdWlvRuqPZ8GxIIRV6k/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FopfQr%2FbtsyqvFiGtl%2FDNotdWlvRuqPZ8GxIIRV6k%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;500&quot; height=&quot;300&quot; data-origin-width=&quot;500&quot; data-origin-height=&quot;300&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;span&gt;이미지 썸네일 삭제&lt;/span&gt;&lt;/div&gt;
&lt;div&gt;
&lt;div&gt;&lt;b&gt;Grokking the System Design Interview | The #1 Online Course&lt;/b&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;Grokking the System Design Interview is a comprehensive course for system design interview. It provides a step-by-step guide to answering system design questions.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;www.designgurus.io&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-5327e84e-238a-46bf-b7a3-ff05888c926a&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-5327e84e-238a-46bf-b7a3-ff05888c926a&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-5327e84e-238a-46bf-b7a3-ff05888c926a&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-7140fcbe-25c4-499d-9232-04626b7401a1&quot;&gt;
&lt;p id=&quot;SE-544415de-5a0e-4fbc-9414-432eb41358a5&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot; data-href=&quot;https://www.designgurus.io/course/grokking-system-design-fundamentals&quot;&gt;&lt;a href=&quot;https://www.designgurus.io/course/grokking-system-design-fundamentals&quot;&gt;https://www.designgurus.io/course/grokking-system-design-fundamentals&lt;/a&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-81908c1d-1b72-45e3-830c-dd8920ea8337&quot; data-a11y-title=&quot;링크&quot; data-compid=&quot;SE-81908c1d-1b72-45e3-830c-dd8920ea8337&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-81908c1d-1b72-45e3-830c-dd8920ea8337&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div&gt;
&lt;div&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;500&quot; data-origin-height=&quot;300&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/bHOqTx/btsydnhP4FX/21tiMLjvf7SAP12b5Qvm71/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/bHOqTx/btsydnhP4FX/21tiMLjvf7SAP12b5Qvm71/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/bHOqTx/btsydnhP4FX/21tiMLjvf7SAP12b5Qvm71/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbHOqTx%2FbtsydnhP4FX%2F21tiMLjvf7SAP12b5Qvm71%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;500&quot; height=&quot;300&quot; data-origin-width=&quot;500&quot; data-origin-height=&quot;300&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;span&gt;이미지 썸네일 삭제&lt;/span&gt;&lt;/div&gt;
&lt;div&gt;
&lt;div&gt;&lt;b&gt;Grokking System Design Fundamentals&lt;/b&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;Grokking System Design Fundamentals is designed to equip software engineers with the essential knowledge and skills required to design large complex systems.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;www.designgurus.io&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-aa59cb9d-9275-419c-852e-d50eef8f8775&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-aa59cb9d-9275-419c-852e-d50eef8f8775&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-aa59cb9d-9275-419c-852e-d50eef8f8775&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-dde4ad71-9593-4dac-862e-dc52c254b98f&quot;&gt;
&lt;p id=&quot;SE-60f85e62-544c-4132-87d7-11c70b508e6e&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-16924708-7c9e-4dc3-8413-1a6de371ea46&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;시스템 설계에 대한 책들도 있지만, 개인적으로는 추천하지 않습니다. 책들은 좀 아카데믹한 면이 있구요.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-1bc39794-4d45-4e10-9e61-ecb823afd049&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;SaaS로 계속 새로운 서비스가 나오고 있는 상황이여서, 책은 올드한 서비스들을 주로 다룰 확률이 높습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-84872f77-6133-4f9b-a6d7-fcac5edb0187&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-c59a7968-1085-482d-833c-17483077019e&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;6. 인성면접&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-651f757b-9b4c-4a00-ae44-a0872c623f61&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 인성면접해서 사람의 인성을 평가 한다고 하지만, 사실은 요즘 경향은 우리팀과 이사람이 맞는 사람인지 확인하는 과정입니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-c3f28d77-1c68-4ea5-9b33-6a7747c26827&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;모든 면접이 그러하듯이, 면접에서 면접관이 하는 질문들은 그 팀(또는 회사)가 겪고 있는&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-1cecb5e2-f11d-4211-906f-e6b387db2e02&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;문제점이거나, 문제점과 관련이 높은 질문일 확률이 높습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-bcb45bcb-b735-4a9c-a167-fb8566795802&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-6bb3aeb3-ca81-44e6-93b4-754f53fbc222&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; '옆의 동료와 디자인을 함께 해야 하는대, 동료가 본인의 주장을 굽힐 생각이 없다면 어떻게 하시겠습니까?'&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-90e6d0f9-5c88-45a2-a5f0-e7b87f4f01bd&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-fd65f391-a295-43a9-b884-de4f1d9a7d1a&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;이런 질문을 한다고 하면, 이 팀은 이 팀이 하는 일을 총괄하는 사람이 한명있고,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-a7c9f055-6765-418e-8c23-d1cdd99fe0f5&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;나머지 사람들은 이사람의 설계및 디자인 등에 따라서, 구현하는 일을 할 수 도 있습니다.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-867ba612-4d58-4d54-b1f4-93f84ca69e4c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 이런 경우에 적절한 답변을 예시로 든다면 이렇게 대답할 수 있겠죠.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-cfa10730-aaf3-41a0-a729-ae08a65f4b0d&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p id=&quot;SE-adf4dab9-9f85-464b-bc6b-d69f3fe3f168&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; '해당 동료가 전체 프로젝트의 디자인을 감당할 수 있을 만큼 충분한 능력이 된다고 판단되면,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-e6f5e3b1-9b78-4e83-90d0-aeffce42a259&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;적극적으로 해당 동료를 지지해주어서, 프로젝트 디자인을 보다 빨리 끝낼 수 있게 도와주겠습니다.'&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-4eacb49a-fdad-41ee-a4fd-20f27d1f0827&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;'하지만, 해당 동료가 전체 프로젝트를 감당할 역량이 안되거나, 일부분에 대해서만,&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-a05a08ca-fb50-4f94-893c-d0d8e817e371&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;본인 주장을 펼친 다면, 팀장에게 리포트 하는 등, 다른 방법을 생각해 보겠습니다.'.&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-c2f4027d-2ce8-4a14-a4de-717e4d8e7e3f&quot; data-a11y-title=&quot;인용구&quot; data-compid=&quot;SE-c2f4027d-2ce8-4a14-a4de-717e4d8e7e3f&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-c2f4027d-2ce8-4a14-a4de-717e4d8e7e3f&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div&gt;
&lt;div id=&quot;SE-900cac51-efb0-4add-aa02-23dbc2700490&quot;&gt;
&lt;p id=&quot;SE-015018ad-4451-408d-b35b-9f7729c2b1f3&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;&lt;b&gt;&lt;i&gt;&amp;lt;✨ 면접에서 효과적으로 경험 어필하는 법&amp;gt;&lt;/i&gt;&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-b1dc8176-c79f-4d13-804b-0f31c874a24d&quot;&gt;
&lt;p id=&quot;SE-733bac62-c8a7-445f-af6e-030efdd14a3a&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #777777;&quot;&gt;&lt;a href=&quot;https://careerly.co.kr/comments/67573&quot;&gt;https://careerly.co.kr/comments/67573&lt;/a&gt;&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;div id=&quot;SE-173e563b-20d0-445c-ad5c-2958eaa37b84&quot; data-a11y-title=&quot;본문&quot; data-compid=&quot;SE-173e563b-20d0-445c-ad5c-2958eaa37b84&quot;&gt;
&lt;div&gt;
&lt;div data-direction=&quot;top&quot; data-compid=&quot;SE-173e563b-20d0-445c-ad5c-2958eaa37b84&quot; data-unitid=&quot;&quot;&gt;
&lt;div&gt;
&lt;div id=&quot;SE-ba6315e2-a51d-405c-9cf8-eccf131b1199&quot;&gt;
&lt;p id=&quot;SE-8d2e7f67-9e1c-48ee-8353-dc1d6106b35c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt; 인성면접은 사실 답이 없는 면접이기도 합니다. 사실 너무나도 케바케 이기 때문이죠.&lt;/span&gt;&lt;/p&gt;
&lt;p id=&quot;SE-688117f5-dbb6-42c9-9012-1e1d06fb0e7c&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;color: #000000;&quot;&gt;위의 글을 읽어 보신다면, 인성 면접을 보는대 많은 도움이 되실 꺼라고 생각합니다.&lt;/span&gt;&lt;/p&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;
&lt;/div&gt;</description>
      <category>기타</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/395</guid>
      <comments>https://skysign.tistory.com/395#entry395comment</comments>
      <pubDate>Fri, 13 Oct 2023 06:37:16 +0900</pubDate>
    </item>
    <item>
      <title>leetcode com 125 Valid Palindrome</title>
      <link>https://skysign.tistory.com/394</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span&gt;&lt;span&gt;&lt;span style=&quot;color: #131313;&quot;&gt;문제 링크: &lt;/span&gt;&lt;span style=&quot;color: #065fd4;&quot;&gt;&lt;a href=&quot;https://bit.ly/3rMr6l8&quot;&gt;https://bit.ly/3rMr6l8&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; &lt;/p&gt;
&lt;figure id=&quot;og_1697067518470&quot; contenteditable=&quot;false&quot; data-ke-type=&quot;opengraph&quot; data-ke-align=&quot;alignCenter&quot; data-og-type=&quot;website&quot; data-og-title=&quot;Valid Palindrome - LeetCode&quot; data-og-description=&quot;Can you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric cha&quot; data-og-host=&quot;leetcode.com&quot; data-og-source-url=&quot;https://bit.ly/3rMr6l8&quot; data-og-url=&quot;https://leetcode.com/problems/valid-palindrome/description&quot; data-og-image=&quot;https://scrap.kakaocdn.net/dn/PCsjU/hyUdQ1VcCS/neVDrcnyyDLqa9rPxHudM1/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260&quot;&gt;&lt;a href=&quot;https://bit.ly/3rMr6l8&quot; target=&quot;_blank&quot; rel=&quot;noopener&quot; data-source-url=&quot;https://bit.ly/3rMr6l8&quot;&gt;
&lt;div class=&quot;og-image&quot; style=&quot;background-image: url('https://scrap.kakaocdn.net/dn/PCsjU/hyUdQ1VcCS/neVDrcnyyDLqa9rPxHudM1/img.png?width=500&amp;amp;height=260&amp;amp;face=0_0_500_260');&quot;&gt;&amp;nbsp;&lt;/div&gt;
&lt;div class=&quot;og-text&quot;&gt;
&lt;p class=&quot;og-title&quot; data-ke-size=&quot;size16&quot;&gt;Valid Palindrome - LeetCode&lt;/p&gt;
&lt;p class=&quot;og-desc&quot; data-ke-size=&quot;size16&quot;&gt;Can you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric cha&lt;/p&gt;
&lt;p class=&quot;og-host&quot; data-ke-size=&quot;size16&quot;&gt;leetcode.com&lt;/p&gt;
&lt;/div&gt;
&lt;/a&gt;&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;a href=&quot;https://youtu.be/vfebH2GbEdA?si=M5D1122XDaZDhcs5&quot;&gt;https://youtu.be/vfebH2GbEdA?si=M5D1122XDaZDhcs5&lt;/a&gt;&amp;nbsp;&lt;/p&gt;
&lt;figure data-ke-type=&quot;video&quot; data-ke-style=&quot;alignCenter&quot; data-video-host=&quot;youtube&quot; data-video-url=&quot;https://www.youtube.com/watch?v=vfebH2GbEdA&quot; data-video-thumbnail=&quot;https://scrap.kakaocdn.net/dn/bdoBUy/hyT9AzFGjY/to5tFe1tzBznT9Z3otmzi0/img.jpg?width=1280&amp;amp;height=720&amp;amp;face=0_0_1280_720&quot; data-video-width=&quot;860&quot; data-video-height=&quot;484&quot; data-video-origin-width=&quot;860&quot; data-video-origin-height=&quot;484&quot; data-ke-mobilestyle=&quot;widthContent&quot; data-video-title=&quot;leetcode com 125  Valid Palindrome&quot; data-original-url=&quot;&quot;&gt;&lt;iframe src=&quot;https://www.youtube.com/embed/vfebH2GbEdA&quot; width=&quot;860&quot; height=&quot;484&quot; frameborder=&quot;&quot; allowfullscreen=&quot;true&quot;&gt;&lt;/iframe&gt;
&lt;figcaption style=&quot;display: none;&quot;&gt;&lt;/figcaption&gt;
&lt;/figure&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span&gt;&lt;span&gt;&lt;span style=&quot;color: #131313;&quot;&gt;파이썬 소스: &lt;/span&gt;&lt;span style=&quot;color: #065fd4;&quot;&gt;&lt;a href=&quot;https://bit.ly/46hux2j&quot;&gt;https://bit.ly/46hux2j&lt;/a&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>Leetcode.com</category>
      <category>125 Valid Palindrome</category>
      <category>답</category>
      <category>소스</category>
      <category>코드</category>
      <category>파이썬</category>
      <category>풀이</category>
      <category>해설</category>
      <author>건이두</author>
      <guid isPermaLink="true">https://skysign.tistory.com/394</guid>
      <comments>https://skysign.tistory.com/394#entry394comment</comments>
      <pubDate>Thu, 12 Oct 2023 08:39:42 +0900</pubDate>
    </item>
  </channel>
</rss>