> [!info]- Update 내역 📣
> > [!summary]+ 8월
> > - Theme 리뉴얼 및 게시글 이전 중
>
> [!warning] 주의
> - 본 페이지는 메모들을 체계적으로 모아놓은 *저장소이자 블로그*입니다.
> - 현재 리뉴얼로 인해 *지속적인 업데이트 중*입니다.
> - ==hover== 기능으로 간단히 확인하실 수 있으며, ==click==하면 스택 방식으로 표시됩니다.
---
# 목차
1. [[#^leetcode|Leetcode 학습 내역]]
2. Projects
- [[#^N2T1|밑바닥부터 만드는 컴퓨팅 시스템 Part 1(HW)]]
- [[#^N2T2|밑바닥부터 만드는 컴퓨팅 시스템 Part 2(SW)]]
- [[#^ostepbook |OS Projects]]
- Django Project
- [[#^odin|Odin Project]]
3. [[이력서.pdf|이력서.pdf]]
4. 증명서류
- [[성적증명서.pdf|성적증명서]]: 전체 수석(4.5/4.5) 3회
- [[TOEIC-성적표.pdf|어학 증명서]]: TOEIC 850
- [[사회봉사-증명서(vms).pdf|사회봉사 인증서]]: 약 600시간
---
## Projects
### 1. Algorithms Journeys(Leetcode Handwriting) ✍️ ^leetcode
> [!success]+ (==Click== 👇) Problem Sets Handwriting
> > [!example]+ 1-D Dynamic Programming 💫
> > - [[746. Min Cost Climbing Stairs.jpg]] 🌟
> > - [[647. Palindromic Substring.jpg]]
> > - [[416. Partition Equal Subset Sum.jpg]]
> > - [[322. Coin Change.jpg]]
> > - [[300. Longest Increasing Subsequence.jpg]]
> > - [[213. House Robber II.jpg]] 🌟
> > - [[198. House Robber.jpg]]
> > - [[152. Maximum Product Subarray.jpg]]
> > - [[139. Word Break.jpg]]
> > - [[91. Decode Ways.jpg]], [[91. Decode Ways(2).jpg]]
> > - [[70. Climbing Stairs.jpg]] 🌟
> > - [[5. Longest Palindromic Substring.jpg]]
>
> > [!example]+ 2-D Dynamic Programming
> > - [[1143. Longest Common Subsequence-1.jpg]] 🌟
> > - [[518. Coin Change II.jpg]] 🌟
> > - [[494. Target Sum.jpg]]
> > - [[309. Best Time To Buy And Sell Stock With Cooldown.jpg]]
> > - [[62. Unique Paths.jpg]]
>
> > [!example]+ Trees
> > - [[1448. Count Good Nodes in Binary Tree.jpg]], [[1448. Count Good Nodes In Binary Tree-1.jpg]]
> > - [[572. Subtree of Another Tree.jpg]]
> > - [[543. Diameter Of Binary Tree.jpg]]
> > - [[297. Serialize And Deserialize Binary Tree.jpg]]
> > - [[235. Lowest Common Ancestor Of A Binary Search Tree.jpg]]
> > - [[230. Kth Smallest Element in a BST.jpg]]
> > - [[226. Invert Binary Tree.jpg]] 🌟
> > - [[199. Binary Tree Right Side View-1.jpg]], [[199. Binary Tree Right Side View(1).jpg]], [[199. Binary Tree Right Side View(2).jpg]]
> > - [[124. Binary Tree Maximum Path Sum.jpg]]
> > - [[110. Balanced Binary Tree.jpg]]
> > - [[105. Construct Binary Tree from Inorder and Preorder Traversal.jpg]], [[105. Construct Binary Tree From Preorder And Inorder Traversal-1.jpg]]
> > - [[104. Maximum Depth of Binary Tree.jpg]] 🌟
> > - [[102. Binary Tree Level Order Traversal.jpg]], [[102. Binary Tree Level Order Traversal-1.jpg]]
> > - [[100. Same Tree.jpg]]
> > - [[98. Validate Binary Search Tree.jpg]]
>
> > [!example]+ Backtracking
> > - [[131. Palindrome Partitioning.jpg]]
> > - [[79. Word Search.jpg]]
> > - [[78. Subsets.jpg]], [[78. Subsets-1.jpg]]
> > - [[51. N-Queens-1.jpg]] 🌟
> > - [[46. Permutations.jpg]]
> > - [[40. Combination Sum2.jpg]]
> > - [[39. Combination Sum.jpg]]
> > - [[17. Letter Combination Of A Phone Number.jpg]]
>
> > [!example]+ Graphs 💫
> > - [[994. Rotting Oranges.jpg]] 🌟
> > - [[695. Max Area of Island.jpg]]
> > - [[684. Redundant Connection.jpg]]
> > - [[417. Pacific Atlantic Water Flow.jpg]] 🌟
> > - [[323. Number Of Connected Components In An Undirected Graph.jpg]]
> > - [[286. Walls And Gates-1.jpg]]
> > - [[261. Graph Valid Tree.jpg]]
> > - [[210. Course Schedule II.jpg]] 🌟
> > - [[207. Course Schedule.jpg]] 🌟
> > - [[200. Number of Islands.jpg]]
> > - [[133. Clone Graph.jpg]]
> > - [[130. Surrounded Regions.jpg]]
>
> > [!example]+ Arrays & Hashing
> > - [[347. Top K Frequent Elements.jpg]]
> > - [[271. Encode and Decode Strings-1.jpg]]
> > - [[242. Valid Anagram.jpg]]
> > - [[217. Contains Duplicate.jpg]]
> > - [[128. Longest Consecutive Sequence.jpg]]
> > - [[49. Group Anagrams.jpg]] 🌟
> > - [[36. Valid Sudoku-1.jpg]] 🌟
> > - [[1. Two Sum.jpg]]
> > - [[238. Product of Array Except Self]]
>
> > [!example]+ Two Pointers
> > - [[167. Two Sum 2 Input Array Is Sorted.jpg]]
> > - [[125. Valid Palindrome.jpg]]
> > - [[42. Trapping Rain Water.jpg]]
> > - [[15. 3Sum.jpg]] 🌟
> > - [[11. Container With Most Water.jpg]]
>
> > [!example]+ Sliding Window
> > - [[567. Permutation in String.jpg]]
> > - [[424. Longest Repeating Character Replacement.jpg]] 🌟
> > - [[121. Best Time to Buy and Sell Stock.jpg]]
> > - [[76. Minimum Window Substring.jpg]]
> > - [[3. Longest Substring Without Repeating Characters.jpg]]
>
> > [!example]+ Stack
> > - [[853. Car Fleet.jpg]] 🌟
> > - [[739. Daily Temperatures.jpg]]
> > - [[155. Min Stack.jpg]]
> > - [[150. Evaluate Reverse Polish Notaion.jpg]]
> > - [[22. Generate Parentheses.jpg]]
> > - [[20. Valid Parentheses.jpg]] 🌟
>
> > [!example]+ Binary Search
> > - [[981. Time Based Key-Value Store.jpg]]
> > - [[875. Koko Eating Bananas.jpg]] 🌟
> > - [[704. Binary Search.jpg]] 🌟
> > - [[153. Find Minimum in Rotated Sorted Array.jpg]]
> > - [[74. Search a 2D Matrix.jpg]]
> > - [[33. Search in Rotated Sorted Array.jpg]]
>
> > [!example]+ Linked List 💫
> > - [[287. Find The Duplicate Number.jpg]]
> > - [[206. Reverse Linked List.jpg]]
> > - [[146. LRU cache(1).jpg]], [[146. LRU cache(2).jpg]], [[146. LRU Cache(3).jpg]] 🌟
> > - [[143. Reorder List.jpg]]
> > - [[138. Copy List with Random Pointer.jpg]]
> > - [[92. Reverse Linked List 2.jpg]]
> > - [[23. Merge K Sorted Lists.jpg]]
> > - [[21. Merge Two Sorted Lists.jpg]]
> > - [[19. Remove Nth Node From End of List.jpg]], [[19. Remove Nth Node From End Of List-1.jpg]] 🌟
> > - [[2. Add Two Numbers.jpg]], [[2. Add Two Numbers-1.jpg]]
>
> > [!example]+ Heap / Priority Queue
> > - [[1046. Last Stone Weight.jpg]], [[1046. Last Stone Weight-1.jpg]] 🌟
> > - [[703. Kth Largest Element in a Stream.jpg]]
> > - [[621. Task Scheduler.jpg]] 🌟
> > - [[355. Design Twitter.jpg]]
> > - [[215. Kth Largest Element In An Array.jpg]]
>
> > [!example]+ Intervals
> > - [[57. Insert Interval.jpg]]
>
> > [!example]+ Math & Geometry
> > - [[202. Happy Number.jpg]] 🌟
> > - [[73. Set Matrix Zeros.jpg]]
> > - [[66. Plus One.jpg]]
> > - [[54. Spiral Matrix.jpg]]
> > - [[50. Pow(x, n).jpg]]
> > - [[48. Rotate Image.jpg]]
> > - [[43. Multiply Strings.jpg]]
>
---
### From Nand To Tetris Part A(Hardware) 👾 ^N2T1
> [!info]+ 💁 About This Project
>- [From Nand To Tetris](https://www.nand2tetris.org/)는 컴퓨터 과학의 근본 원리를 Hands-On 방식으로 배울 수 있는 유명한 오픈소스 교육 프로젝트입니다.
>- 가장 기본적인 논리 게이트 'NAND'부터 출발하여 Tetris와 같은 프로그램을 실행할 수 있는 완전한 컴퓨터 시스템의 구축을 목표로 하는 기나 긴 여정입니다.
>- 총 12개의 프로젝트로 구성되었으며, 크게 전반부(하드웨어 구축)와 후반부(소프트웨어 계층) 두 부분으로 나뉩니다.
>[!quote]+ 💁♂️ ==기계어로 작성된 프로그램을 실행할 수 있는 하드웨어 플랫폼("Hack") 만들기==
>
>>[!memo]+ Project1 - Boolean Functions and Gate Logic
>>- [[project1 - Boolean Logic(1)|NOT, AND, 16-bit NOT, 16-bit-AND]]
>>- [[project1 - Boolean Logic(2)|MUX, Mux4Way16, Mux8Way16, Mux16, DMUX, DMUX4Way, DMUX8Way]]
>>- [[project1 - Boolean Logic(3)|OR, OR8Way, OR16, XOR]]
>
>>[!memo]+ Project2 - Boolean Arithmetic and the ALU
>>- [[project2 - Boolean Arithmetic(1)|HalfAdder, FullAdder, Add16, Inc16]]
>>- [[project2 - Boolean Arithmetic(2)|ALU]]
>
>>[!memo]+ Project3 - Memory
>>- [[project3 - Memory(1)|DFF, Bit, 16-bit Register]]
>>- [[project3 - Memory(2)|RAM, RAM8, RAM64, RAM512, RAM4K, RAM16K, PC]]
>
>>[!memo]+ Project4 - Machine Language
>
>>[!memo]+ Project5 - [[project5 - summary|summary]] - Computer Architecture
>>- [[project5 - solution(Computer.hdl)|Computer]]
>>- [[project5 - solution(CPU.hdl)|CPU]]
>>- [[project5 - solution(Memory.hdl)|Memory]]
>
>>[!warning]- Project6 - Assembler(업데이트 예정)
>>- [[project6 solution(Assembler1-Parser module)|Parser module]]
>>- Code module
>>- Basic Assembler
>>- Hack Assembler
>
---
### 👾 From Nand To Tetris Part B(Software) ^N2T2
> [!quote]+ 💁♂️ ==Project 1..6 동안 구축한 하드웨어 플랫폼 "Hack" 위에서 동작할 소프트웨어 스택을 쌓아올립니다.==
>> [!warning]- Project7 - Virtual Machine I: Stack Arithmetic
>> -
>
>>[!warning]- Project8 - Virtual Machine II: Program Control
>
>>[!warning]- Project9 - High-Level Language
>
>>[!warning]- Project10 - Compiler I: Syntax Analysis
>
>>[!warning]- Project11 - Compiler II: Code Generation
>
>>[!warning]- Project12 - Operating System
>
---
### 🪐 OSTEP(운영체제) projects ^ostepbook
> [!info]+ 소개글
> - [Operating Systems: Three Easy Pieces](https://pages.cs.wisc.edu/~remzi/OSTEP/)
>[!warning]- 💁♂️ 본문 정리 및 Homeworks: 보류, SUSPENDED
>>[!summary]+ Virtualization(가상화)
>>- CPU Virtualization
>> - [[4(simulation)]]
>> - [[5(simulation)]], [[5(code)]]
>> - [[6(Measurement-system call)]], [[6(Measurement-context switch)]]
>> - [[7(simulation)]], [[7(questions)]]
>> - [[8(simulation)]], [[8(questions)]]
>> - [[9(simulation)]], [[9(questions)]]
>>- Memory Virtualization
>> - [[13(code)]] - Address Space
>> - [[14(code)]] - VM API
>> - [[15(simulation)]] - Relocation
>> - [[16(simulation)]] - Segmentation
>> - [[17(simulation)]] - Free Space
>> - [[18(simulation)]] - Paging
>> - [[19(Measurement)]] - TLBs
>> - [[20(simulation)]] - Multi-level Paging
>> - [[21(Measurement)]] - Paging Mechanism
>> - [[22(Simulation)]] - Paging Policy
>
>>[!warning]- Concurrency(병행성)
>>- [[26(simulation)]] - Threads Intro
>>- [[27(code)]] - Thread API
>>- [[28(simulation)]] - Locks
>>- [[29(code)]] - Lock Usage
>>- [[30(code)]] - Condition Variables
>>- [[31(code)]] - Semaphores
>>- [[32(code)]] - Concurrency Bugs
>>- [[33(code)]] - Event-based Concurrency
>
>>[!warning]- Persistence(영속성)
>>- [[37(simulation)]] - Hard Disk Drives
>>- [[38(simulation)]] - RAID
>>- [[39(code)]] - FS Intro
>>- [[40(simulation)]] - FS Implementation
>>- [[41(simulation)]] - Fast File System
>>- [[42(simulation)]] - Crash Consistency and Journaling
>>- [[43(simulation)]] - Log-Structured File Systems
>>- [[44(simulation)]] - Solid-State Disk Drives
>>- [[45(simulation)]] - Data Integrity and Protection
>
> [!warning]- 💁♂️ projects: 보류, SUSPENDED
> 💁♂️ [[✅ Lets Build My Own X/📚OSTEP(OS-Three Easy Pieces)/projects/README.md|README.md]] [(ref)](https://github.com/remzi-arpacidusseau/ostep-projects)
> - C/Linux Projects
> - Unix Utilities
> - Initial-utilities - [[Discussion1(lecture_note)|note]],
> - Kernel Hacking Projects(xv6)
> - Intro To xv6 - [[Discussion2(lecture_note)|note]]
>
> OSTEP
> - C/Linux Projects
> - [Unix Utilities](https://github.com/remzi-arpacidusseau/ostep-projects/blob/master/initial-utilities) (cat, grep, zip/unzip)
> - [Shell](https://github.com/remzi-arpacidusseau/ostep-projects/blob/master/processes-shell)
> - Kernel Hacking Projects (xv6)
> - [Intro To xv6](https://github.com/remzi-arpacidusseau/ostep-projects/blob/master/initial-xv6)
> - [Scheduling (Lottery)](https://github.com/remzi-arpacidusseau/ostep-projects/blob/master/scheduling-xv6-lottery)
>
### 🔨 The Odin project ^odin
> [!info] 소개글
> - 본 프로젝트는 유명한 [Open Source Project](https://github.com/theodinproject)입니다.
> - 개발자들이 자기주도적인 방식으로 full-stack 웹 개발을 Hands-On 방식으로 학습할 수 있도록 가이드를 제시합니다.
> - 궁극적으로 Javascript 또는 Ruby를 사용하여 front-end와 back-end 프로세스를 숙달하는 것을 목표로 합니다.
> - 현재 진행 중입니다.
- [[🤩 1번 서랍장]] - 메모 더미, 프로젝트 완료 후 정리 및 구조화 예정