Welcome to Coding Interview
===

Intro
---
- [Google | 인터뷰 과정](/4EWMVAAIRWiypmiCA-6f9w)
- [Google | DSA 문제 대비하는 방법](/t3Es96gBSoOJFBul18QVKg)

Data Structure
---
- [Array & Linked List](/LUCn8cT_TFm2OKbEouuApA)
- [Stack & Queue](/ExVyzPGDRLGqA2mJvCh80A)
- [Binary Tree & Binary Search Tree](/3ARk5o_cQMeqlBeRE8HNBQ)
- [B Tree & B+ Tree](/vFJzILdES-WSB1XVU4Xa4w)
- [Heap (Priority Queue)](/xMCyYORsTyCR7B6vEyj88w)
- [Hash](/7ZF46zQXSUG7qKEvEjVVWw)
- [Graph](/DR7t40OMTmGYGybBHPTLmw)
- [Trie](/cgnevlq-RpeN5xAue3oXbw)
- [Segment Tree](/UuanzIF3Q0CKmju__pn-xQ)
- [Union-Find](/dfAaq0u9Q5CAw_xWkXLT7Q)

Algorithm
---
- [Sorting](/Fyc1pN_FRY2KgzAJw-oGSQ)
- [Searching](/ig_8tkGAQMebp7kRbGkssg)
- [String](/wCdL-GIvSTKmckKH73yZUg)
- [DFS & BFS](/gqsSJvrqSByLsZ15GXudXA)
- [Shortest Path](/niTJmA2BS1iLqq6f2uIkDg)
- [Greedy Algorithm](/TPODIxGlRcuGLVtBQEAEDA)
- [Dynamic Programming](/gFXp9bMkRHKdOyu-Yk7uhQ)

Tricks
---
- [Two Pointers](/ezWEmtqrTAaWeMUzXqJX9A)
- [Kadane's Algorithm](/oeuEPmQBS9-T5n66u0FDBQ)
- [Bit Manipulation](/vs2xuFpISmOTVPTeH_jC5w)
- [Binary Search](/_U8LcikxQwiq6a_QiRlLPQ)
- [Monotonic Stack](/uRKMrOA2TfGiBL8w2OMbaw)

Python
---
- [Basics](/92EYXXMLQsWyY-Ek4bjJEw)
- [Advanced](/mJlA_yN5QQqWh6N6W0OeOg)
- [Data Structures](/jye_lqY3RPyHn-a_gwMdsQ)
- [Techniques](/V68zHZDKSeekqIAu6OEUSQ)
- [Interview Questions](/TCNvZrX0RGOG32AtKf4aGw)

Leet Code
---
- [Problems](/VWOCU2krRQWTUccACa0A5g)

Others
---
- [Amazon Solution Architect](/YSfi-V_yRfesWZlkmwjbuA)