index.xml

<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>&lt;cha2hyun /&gt;</title>
    <link>https://blog.cha2hyun.com/</link>
    <description>Recent content on &lt;cha2hyun /&gt;</description>
    <image>
      <title>&lt;cha2hyun /&gt;</title>
      <url>https://blog.cha2hyun.com/papermod-cover.png</url>
      <link>https://blog.cha2hyun.com/papermod-cover.png</link>
    </image>
    <generator>Hugo -- 0.153.2</generator>
    <language>ko</language>
    <lastBuildDate>Fri, 15 Mar 2024 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://blog.cha2hyun.com/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>아프리카TV 실시간채팅 크롤링</title>
      <link>https://blog.cha2hyun.com/content/dev/afreecatv-crawling/</link>
      <pubDate>Fri, 15 Mar 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/dev/afreecatv-crawling/</guid>
      <description>리버스엔지니어링 + 소켓연결 + 네트워크탭 분석. feat) 아프리카도우미</description>
    </item>
    <item>
      <title>FE 기술면접 준비</title>
      <link>https://blog.cha2hyun.com/content/algorithm/frontend-algorithm/</link>
      <pubDate>Sat, 24 Feb 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/frontend-algorithm/</guid>
      <description>&lt;blockquote&gt;
&lt;p&gt;💡 현재 글은 미완성 단계입니다.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;h2 id=&#34;브라우저&#34;&gt;브라우저&lt;/h2&gt;
&lt;h3 id=&#34;브라우저에-url을-입력하면-생기는-일&#34;&gt;브라우저에 URL을 입력하면 생기는 일&lt;/h3&gt;
&lt;ol&gt;
&lt;li&gt;URL해석
&lt;ol&gt;
&lt;li&gt;브라우저에 입력된 URL을 해석하여 해당하는 웹페이지의 호스트명, 프로토콜 정보를 추출&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;li&gt;DNS 조회 (분산형 DB)
&lt;ol&gt;
&lt;li&gt;호스트명을 IP주소로 변환하기 위해 DNS 서버에 쿼리를 보내고 DNS서버는 IP주소를 응답&lt;/li&gt;
&lt;li&gt;이때 PC의 host 파일 - DNS cache - 공유기(라우터)의 DNS - ISP의 DNS를 먼저 확인하고 없다면 DNS 서버에 질의&lt;/li&gt;
&lt;li&gt;접속자의 IP에 따라서 가장 가까운 CDN(GSBL)을 전달받을 수도 있음&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;li&gt;서버연결
&lt;ol&gt;
&lt;li&gt;브라우저는 DNS 서버로 부터 얻은 IP 주소를 이용하여 해당 서버에 TCP 연결을 시도 (TCP 연결이 성공하면 HTTP requests가 보내짐)&lt;/li&gt;
&lt;li&gt;이때 URL해석에서 얻은 프로토콜이 HTTPS 일 경우 TLS 핸드셰이크 과정을 거침.&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;li&gt;서버에 요청 전송 및 응답
&lt;ol&gt;
&lt;li&gt;TCP연결에 성공했다면 브라우저는 서버에 HTTP 요청을 보내고 서버는 해당하는 웹페이지의 내용에 포함된 HTTP응답 메세지를 전송 (HTML, CSS, JS 등의 파일을 받아옴)&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;li&gt;서버로받은 HTML파일을 렌더링&lt;/li&gt;
&lt;/ol&gt;
&lt;h3 id=&#34;브라우저-렌더링-과정&#34;&gt;브라우저 렌더링 과정&lt;/h3&gt;
&lt;p&gt;참고 : &lt;a href=&#34;https://www.youtube.com/watch?v=z1Jj7Xg-TkU&#34;&gt;https://www.youtube.com/watch?v=z1Jj7Xg-TkU&lt;/a&gt;&lt;/p&gt;</description>
    </item>
    <item>
      <title>next/image 그냥 쓰면 서버는 시한부입니다 💀</title>
      <link>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/nextimage/</link>
      <pubDate>Thu, 28 Dec 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/nextimage/</guid>
      <description>next/image 사용하다가 플aws 서버가 뻗었습니다. 모르고 쓰면 100% 서버 뻗습니다.</description>
    </item>
    <item>
      <title>자주사용되는 리액트 알고리즘, 라이브러리 정리</title>
      <link>https://blog.cha2hyun.com/content/algorithm/react-algorithm/</link>
      <pubDate>Wed, 29 Nov 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/react-algorithm/</guid>
      <description>&lt;h3 id=&#34;recoil&#34;&gt;Recoil&lt;/h3&gt;
&lt;p&gt;&lt;code&gt;yarn add recoil @types/recoil&lt;/code&gt;&lt;/p&gt;
&lt;h4 id=&#34;주요-api-호출방법&#34;&gt;주요 API 호출방법&lt;/h4&gt;
&lt;blockquote&gt;
&lt;p&gt;&lt;code&gt;useRecoilState()&lt;/code&gt; - Atom을 읽고 쓸 때 사용한다.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;div class=&#34;highlight&#34;&gt;&lt;div class=&#34;chroma&#34;&gt;
&lt;table class=&#34;lntable&#34;&gt;&lt;tr&gt;&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code&gt;&lt;span class=&#34;lnt&#34;&gt;1
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;2
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;3
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;4
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;5
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;6
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;7
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;8
&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;
&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code class=&#34;language-react&#34; data-lang=&#34;react&#34;&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;kr&#34;&gt;const&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;counterState&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;atom&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;({&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;  &lt;span class=&#34;nx&#34;&gt;key&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;s2&#34;&gt;&amp;#34;counterState&amp;#34;&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;  &lt;span class=&#34;k&#34;&gt;default&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;mi&#34;&gt;0&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;p&#34;&gt;});&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;kr&#34;&gt;const&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;[&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;counter&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;setCounter&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;]&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;useRecoilState&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;counterState&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;);&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;kr&#34;&gt;const&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;onIncrement&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;()&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;=&amp;gt;&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;setCounter&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;((&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;prev&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;)&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;=&amp;gt;&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;prev&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;+&lt;/span&gt; &lt;span class=&#34;mi&#34;&gt;1&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;);&lt;/span&gt; &lt;span class=&#34;c1&#34;&gt;// counter increases
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;
&lt;/div&gt;
&lt;/div&gt;&lt;blockquote&gt;
&lt;p&gt;&lt;code&gt;useRecoilValue()&lt;/code&gt; - Atom의 값을 반환하고 컴포넌트를 해당 atom에 구독한다.&lt;/p&gt;
&lt;/blockquote&gt;
&lt;div class=&#34;highlight&#34;&gt;&lt;div class=&#34;chroma&#34;&gt;
&lt;table class=&#34;lntable&#34;&gt;&lt;tr&gt;&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code&gt;&lt;span class=&#34;lnt&#34;&gt;1
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;2
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;3
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;4
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;5
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;6
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;7
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;8
&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;
&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code class=&#34;language-react&#34; data-lang=&#34;react&#34;&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;kr&#34;&gt;const&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;userState&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;atom&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;({&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;  &lt;span class=&#34;nx&#34;&gt;key&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;s2&#34;&gt;&amp;#34;userState&amp;#34;&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;  &lt;span class=&#34;k&#34;&gt;default&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;{&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;name&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;s2&#34;&gt;&amp;#34;moon&amp;#34;&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;age&lt;/span&gt;&lt;span class=&#34;o&#34;&gt;:&lt;/span&gt; &lt;span class=&#34;s2&#34;&gt;&amp;#34;20&amp;#34;&lt;/span&gt; &lt;span class=&#34;p&#34;&gt;},&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;p&#34;&gt;});&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;kr&#34;&gt;const&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;user&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;useRecoilValue&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;userState&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;);&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;nx&#34;&gt;console&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;.&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;log&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;user&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;.&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;name&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;nx&#34;&gt;user&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;.&lt;/span&gt;&lt;span class=&#34;nx&#34;&gt;age&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;);&lt;/span&gt; &lt;span class=&#34;c1&#34;&gt;// moon, 20
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;
&lt;/div&gt;
&lt;/div&gt;&lt;blockquote&gt;
&lt;p&gt;&lt;code&gt;useSetRecoilState()&lt;/code&gt; - 쓰기 가능한 Atom을 업데이트하기 위한 setter 함수를 반환한다.&lt;/p&gt;</description>
    </item>
    <item>
      <title>SSR를 이용한 SEO 최적화 (구글, 네이버 최상단 노출 성공)</title>
      <link>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/ssrandseo/</link>
      <pubDate>Fri, 17 Feb 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/ssrandseo/</guid>
      <description>Next.js의 꽃 SSR &amp;amp; SEO, Lighthouse, 네이버 서치어드바이저, 구글 웹마스터도구</description>
    </item>
    <item>
      <title>InfiniteScroll로 무한 스크롤 구현하기</title>
      <link>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/infinitescroll/</link>
      <pubDate>Wed, 04 Jan 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/projects/%ED%81%90%EC%B0%BE%EC%82%AC/infinitescroll/</guid>
      <description>무한 스크롤과 뒤로가기시 스크롤된 위치를 기억하기.</description>
    </item>
    <item>
      <title>자주사용되는 파이썬 알고리즘, 함수 정리</title>
      <link>https://blog.cha2hyun.com/content/algorithm/python-algorithms/</link>
      <pubDate>Fri, 28 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/python-algorithms/</guid>
      <description>&lt;br /&gt;
&lt;h2 id=&#34;알고리즘&#34;&gt;알고리즘&lt;/h2&gt;
&lt;h3 id=&#34;insertion-vs-merge-vs-heap-vs-quick&#34;&gt;Insertion vs Merge vs Heap vs Quick&lt;/h3&gt;
&lt;figure class=&#34;align-center &#34;&gt;
    &lt;img loading=&#34;lazy&#34; src=&#34;../img/1.png#center&#34;
         alt=&#34;상명대학교 컴퓨터과학과 동아리 파느쎄 스터디할때 찍어놨던 유물&#34;/&gt; &lt;figcaption&gt;
            &lt;p&gt;상명대학교 컴퓨터과학과 동아리 파느쎄 스터디할때 찍어놨던 유물&lt;/p&gt;
        &lt;/figcaption&gt;
&lt;/figure&gt;

&lt;h3 id=&#34;dfs-깊이우선탐색&#34;&gt;DFS (깊이우선탐색)&lt;/h3&gt;
&lt;blockquote&gt;
&lt;p&gt;모든 노드를 방문할때 이방법을 선택&lt;/p&gt;
&lt;/blockquote&gt;
&lt;ul&gt;
&lt;li&gt;최대한 깊이 내려간 뒤 더이상 깊이 갈 곳이 없을 경우 옆으로 이동&lt;/li&gt;
&lt;li&gt;다른 노드로 넘어가기 전에 해당 깊이를 완벽하게 탐색&lt;/li&gt;
&lt;li&gt;경로의 특징을 저장해야 하는 문제에서 유리&lt;/li&gt;
&lt;li&gt;스택 혹은 재귀함수 이용&lt;/li&gt;
&lt;/ul&gt;


&lt;div class=&#34;terminal space shadow&#34;&gt;
  &lt;div class=&#34;top&#34;&gt;
    &lt;div class=&#34;btns&#34;&gt;
      &lt;span class=&#34;circle red&#34;&gt;&lt;/span&gt;
      &lt;span class=&#34;circle yellow&#34;&gt;&lt;/span&gt;
      &lt;span class=&#34;circle green&#34;&gt;&lt;/span&gt;
    &lt;/div&gt;
    &lt;div class=&#34;title&#34;&gt;
      DFS
    &lt;/div&gt;
  &lt;/div&gt;
  &lt;div class=&#34;terminalbody&#34;&gt;&lt;div class=&#34;highlight&#34;&gt;&lt;div class=&#34;chroma&#34;&gt;
&lt;table class=&#34;lntable&#34;&gt;&lt;tr&gt;&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code&gt;&lt;span class=&#34;lnt&#34;&gt;1
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;2
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;3
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;4
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;5
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;6
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;7
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;8
&lt;/span&gt;&lt;span class=&#34;lnt&#34;&gt;9
&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;
&lt;td class=&#34;lntd&#34;&gt;
&lt;pre tabindex=&#34;0&#34; class=&#34;chroma&#34;&gt;&lt;code class=&#34;language-python&#34; data-lang=&#34;python&#34;&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;c1&#34;&gt;# DFS 메서드 정의&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;&lt;span class=&#34;k&#34;&gt;def&lt;/span&gt; &lt;span class=&#34;nf&#34;&gt;dfs&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;graph&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;v&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;visited&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;):&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    &lt;span class=&#34;c1&#34;&gt;# 현재 노드를 방문 처리&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    &lt;span class=&#34;n&#34;&gt;visited&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;[&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;v&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;]&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;kc&#34;&gt;True&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    &lt;span class=&#34;nb&#34;&gt;print&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;v&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;end&lt;/span&gt; &lt;span class=&#34;o&#34;&gt;=&lt;/span&gt; &lt;span class=&#34;s1&#34;&gt;&amp;#39;&amp;#39;&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    &lt;span class=&#34;c1&#34;&gt;# 현재 노드와 연결된 다른 노드를 재귀적으로 방문&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    &lt;span class=&#34;k&#34;&gt;for&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;i&lt;/span&gt; &lt;span class=&#34;ow&#34;&gt;in&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;graph&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;[&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;v&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;]:&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;    	&lt;span class=&#34;k&#34;&gt;if&lt;/span&gt; &lt;span class=&#34;ow&#34;&gt;not&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;visited&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;[&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;i&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;]:&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class=&#34;line&#34;&gt;&lt;span class=&#34;cl&#34;&gt;        	&lt;span class=&#34;n&#34;&gt;dfs&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;(&lt;/span&gt;&lt;span class=&#34;n&#34;&gt;graph&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;i&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;,&lt;/span&gt; &lt;span class=&#34;n&#34;&gt;visited&lt;/span&gt;&lt;span class=&#34;p&#34;&gt;)&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;
&lt;/div&gt;
&lt;/div&gt;&lt;/div&gt;
&lt;/div&gt;
&lt;br /&gt;

&lt;h3 id=&#34;bfs-너비우선탐색&#34;&gt;BFS (너비우선탐색)&lt;/h3&gt;
&lt;blockquote&gt;
&lt;p&gt;두 노드 사이의 최단 거리를 찾을 때 사용&lt;/p&gt;</description>
    </item>
    <item>
      <title>프로 개발자처럼 맥 세팅하기 명령어 모음 (설명X)</title>
      <link>https://blog.cha2hyun.com/content/daily/mac-brew-list/</link>
      <pubDate>Tue, 30 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/daily/mac-brew-list/</guid>
      <description>언젠가 다시 보기 위해 작성한 초기 셋업 가이드</description>
    </item>
    <item>
      <title>프로그래머스 12971] 스티커모으기(2) - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12971/</link>
      <pubDate>Thu, 18 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12971/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12980] 점프와 순간 이동</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12980/</link>
      <pubDate>Thu, 18 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12980/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12985] 예상 대진표</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12985/</link>
      <pubDate>Thu, 18 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12985/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 120876] 겹치는 선분의 길이 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/etc/120876/</link>
      <pubDate>Wed, 17 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/etc/120876/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 120956] 옹알이(1) - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/etc/120956/</link>
      <pubDate>Wed, 17 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/etc/120956/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>해킹] kioptrix-level-1</title>
      <link>https://blog.cha2hyun.com/content/hacking/kioptrix1/</link>
      <pubDate>Mon, 15 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/hacking/kioptrix1/</guid>
      <description>Setup</description>
    </item>
    <item>
      <title>해킹] M1맥에 Kali Linux 설치 (VMware Fusion 13)</title>
      <link>https://blog.cha2hyun.com/content/hacking/hacking1/</link>
      <pubDate>Sun, 14 Jan 2024 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/hacking/hacking1/</guid>
      <description>실리콘 맥에 칼리리눅스 가상환경으로 띄우고 초기 설정진행하기</description>
    </item>
    <item>
      <title>첫 Boilerplate 템플릿 (NestJS 카카오 OAuth 및 jwt토큰 이용하기)</title>
      <link>https://blog.cha2hyun.com/content/daily/nestjs-graphql-kakao-jwt/</link>
      <pubDate>Mon, 20 Nov 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/daily/nestjs-graphql-kakao-jwt/</guid>
      <description>NestJS + Grahpql + Prisma + Postgres + jwt</description>
    </item>
    <item>
      <title>Synology Chat 멘션 색상 바꾸기</title>
      <link>https://blog.cha2hyun.com/content/daily/synologychat/</link>
      <pubDate>Thu, 08 Jun 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/daily/synologychat/</guid>
      <description>CSS 변경하여 안읽은 메세지 강조하기</description>
    </item>
    <item>
      <title>유튜브에 댓글이 N분동안 달리지 않으면 승리하게 됩니다</title>
      <link>https://blog.cha2hyun.com/content/dev/youtube-comment-event/</link>
      <pubDate>Fri, 28 Apr 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/dev/youtube-comment-event/</guid>
      <description>유튜브 API를 이용한 댓글 오래 버티기 feat)팩토리</description>
    </item>
    <item>
      <title>유튜브 라이브 실시간채팅 크롤링</title>
      <link>https://blog.cha2hyun.com/content/dev/youtube-live-crawling/</link>
      <pubDate>Fri, 10 Mar 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/dev/youtube-live-crawling/</guid>
      <description>exe 실행파일로 추출하여 추첨까지 자동화</description>
    </item>
    <item>
      <title>처음으로 오픈소스 Collaborator가 되다</title>
      <link>https://blog.cha2hyun.com/content/daily/firstcollaborator/</link>
      <pubDate>Tue, 07 Mar 2023 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/daily/firstcollaborator/</guid>
      <description>오픈소스 생태계에 기여하기</description>
    </item>
    <item>
      <title>낭만스키 웹 배포 과정</title>
      <link>https://blog.cha2hyun.com/content/projects/%EB%82%AD%EB%A7%8C%EC%8A%A4%ED%82%A4/first_deploy/</link>
      <pubDate>Fri, 18 Nov 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/projects/%EB%82%AD%EB%A7%8C%EC%8A%A4%ED%82%A4/first_deploy/</guid>
      <description>Next.js + EC2 + Route53 + ACM&amp;amp;Loadbalancer(https) + CI/CD(github action).</description>
    </item>
    <item>
      <title>전국 스키장 슬로프 실시간 정보 (빠르게)크롤링 하기</title>
      <link>https://blog.cha2hyun.com/content/projects/%EB%82%AD%EB%A7%8C%EC%8A%A4%ED%82%A4/fastapi_aiohttp/</link>
      <pubDate>Thu, 10 Nov 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/projects/%EB%82%AD%EB%A7%8C%EC%8A%A4%ED%82%A4/fastapi_aiohttp/</guid>
      <description>서버에서 크롤링을하여 데이터를 가공하여 DB에 저장해야 할때 어떤 방법이 가장 적합했는지 기록합니다.</description>
    </item>
    <item>
      <title>프로그래머스 49189] 가장 먼 노드 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/49189/</link>
      <pubDate>Thu, 03 Nov 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/49189/</guid>
      <description>그래프</description>
    </item>
    <item>
      <title>프로그래머스 64062] 징검다리건너기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/64062/</link>
      <pubDate>Tue, 01 Nov 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/64062/</guid>
      <description>2019 카카오 개발자 겨울 인턴십</description>
    </item>
    <item>
      <title>프로그래머스 67258] 보석쇼핑 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/67258/</link>
      <pubDate>Mon, 31 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/67258/</guid>
      <description>2020 카카오 인턴십</description>
    </item>
    <item>
      <title>프로그래머스 64064] 불량 사용자 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/64064/</link>
      <pubDate>Thu, 27 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/64064/</guid>
      <description>2019 카카오 개발자 겨울 인턴십</description>
    </item>
    <item>
      <title>프로그래머스 12979] 기지국 설치 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12979/</link>
      <pubDate>Wed, 26 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12979/</guid>
      <description>Summer/Winter Coding(~2018)</description>
    </item>
    <item>
      <title>프로그래머스 12987] 숫자 게임 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12987/</link>
      <pubDate>Wed, 26 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12987/</guid>
      <description>Summer/Winter Coding(~2018)</description>
    </item>
    <item>
      <title>프로그래머스 12973] 짝지어 제거하기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12973/</link>
      <pubDate>Mon, 24 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12973/</guid>
      <description>2017 팁스타운</description>
    </item>
    <item>
      <title>프로그래머스 12981] 영어 끝말잇기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12981/</link>
      <pubDate>Mon, 24 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12981/</guid>
      <description>Summer/Winter Coding(~2018)</description>
    </item>
    <item>
      <title>프로그래머스 12927] 야근지수 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12927/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12927/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12938] 최고의 집합 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12938/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/12938/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 42579] 베스트앨범 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42579/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42579/</guid>
      <description>해시</description>
    </item>
    <item>
      <title>프로그래머스 42884] 단속카메라 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42884/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42884/</guid>
      <description>탐욕법(Greey)</description>
    </item>
    <item>
      <title>프로그래머스 42898] 등굣길 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42898/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/42898/</guid>
      <description>동적계획법(Dynamic Programing)</description>
    </item>
    <item>
      <title>프로그래머스 43162] 네트워크 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43162/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43162/</guid>
      <description>깊이/너비 우선 탐색(DFS/BFS)</description>
    </item>
    <item>
      <title>프로그래머스 43163] 단어변환 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43163/</link>
      <pubDate>Fri, 21 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43163/</guid>
      <description>깊이/너비 우선 탐색(DFS/BFS)</description>
    </item>
    <item>
      <title>프로그래머스 43105] 정수 삼각형 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43105/</link>
      <pubDate>Thu, 20 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43105/</guid>
      <description>동적계획법(Dynamic Programing)</description>
    </item>
    <item>
      <title>프로그래머스 43268] 이중우선순위큐 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43628/</link>
      <pubDate>Thu, 20 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv3/43628/</guid>
      <description>힙(Heap)</description>
    </item>
    <item>
      <title>프로그래머스 12911] 다음 큰 숫자 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12911/</link>
      <pubDate>Mon, 26 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12911/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12924] 숫자의 표현 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12924/</link>
      <pubDate>Sun, 25 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12924/</guid>
      <description>스택/큐</description>
    </item>
    <item>
      <title>프로그래머스 12945] 피보나치 수 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12945/</link>
      <pubDate>Sun, 25 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12945/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12909] 올바른 괄호 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12909/</link>
      <pubDate>Sat, 24 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12909/</guid>
      <description>스택/큐</description>
    </item>
    <item>
      <title>프로그래머스 12939] Python 최댓값과 최솟값 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12939/</link>
      <pubDate>Sat, 24 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12939/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12941] Python 최솟값 만들기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12941/</link>
      <pubDate>Sat, 24 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12941/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 12951] JadenCase 문자열 만들기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12951/</link>
      <pubDate>Sat, 24 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/12951/</guid>
      <description>연습문제</description>
    </item>
    <item>
      <title>프로그래머스 70129] 이진 변환 반복하기 - 파이썬</title>
      <link>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/70129/</link>
      <pubDate>Sat, 24 Sep 2022 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/algorithm/programmers/lv2/70129/</guid>
      <description>월간 코드 챌린지 시즌1</description>
    </item>
    <item>
      <title>Markdown Syntax Guide</title>
      <link>https://blog.cha2hyun.com/content/daily/markdown-syntac-guide/</link>
      <pubDate>Mon, 11 Mar 2019 00:00:00 +0000</pubDate>
      <guid>https://blog.cha2hyun.com/content/daily/markdown-syntac-guide/</guid>
      <description>마크다운 신택스 가이드 by Hugo Authors</description>
    </item>
  </channel>
</rss>