μ μλ§ κΈ°λ€λ € μ£ΌμΈμ.
Philipp Lackner
2024. 9. 1.
The Kotlin Coroutines & Flows Masterclass went live and in this video I'll summarize what you can learn. And at the end you'll get a special offer! π Secure the new Kotlin Coroutines & Flows Masterclass with the code MASTERCLASS: https://pl-coding.com/coroutines-masterclass?utm_medium=video&utm_source=youtube&utm_campaign=coroutines_masterclass_launch&utm_content=launch_video π Save 30% on ALL premium courses & bundles (which contain the new Masterclass) with the code MASTERCLASS: https://pl-coding.com/premium-courses?utm_medium=video&utm_source=youtube&utm_campaign=coroutines_masterclass_launch&utm_content=launch_video Happy learning!
μμ€λ°μ΄μ€, μΉλ§€ μ‘°κΈ° μ§λ¨ κΈ°μ κ³Ό μΉλ£μ κ°λ° λμ°λ€ μνλͺ μμ€λ°μ΄μ€ λν βνμ±μ μ μ μΈν¬κΈ°λ₯μ‘°μ κΈ°μ κΈ°λ° νμλ§μΆ€ν μΉλ§€μ§λ¨ λ° μΉλ£μ κ°λ°β βμ μΈκ³ μΉλ§€ νμκ° 5500λ§λͺ μ΄μμΌλ‘ μΆμ λκ³ μκ³ , 2021λ κΈ°μ€ μΉλ§€νμ 1μΈλΉ μ°κ° κ΄λ¦¬λΉμ©μ 2000λ§μμ μννλ μμ€μ΄λ€. μΉλ§€λ νμ κ°μΈμ λ¬Έμ λ‘ λλμ§ μκ³ , κ°μ‘±κ³Ό μ¬νμ μ²΄κ° ν¨κ» λΉμ©μ μΉλ¬μΌλ§νλ μ¬νμ κ΄μ μμ ν΄κ²°λμ΄μΌλ§ νλ μμ§ ν΄κ²°μ μ΄ μλ μ§λ³μ΄λ€. λ°λΌμ, μΉλ§€ μ§λ¨/μΉλ£μλν μνμ λ―ΈμΆ©μ‘± μλ£μμλ λ§€μ° λλ€.β μνλͺ μμ€λ°μ΄μ€ λνλ βμΉλ§€λ νΉν μ‘°κΈ°μ λ°κ²¬νκ³ , μν©μ ν©λΉν μ μ ν μΉλ£λ₯Ό νλ κ²μ΄ λ§€μ° μ€μνλ€β λ©΄μ μμ€λ°μ΄μ€λ μ¦κ°νλ μΉλ§€ νμ λ¬Έμ λ₯Ό ν΄κ²°νκΈ° μν΄ λ Έλ ₯νλ, μ¬ν νμμ μ λ°μλ£λ₯Ό ν₯νμ¬ λ―Έλμ§ν₯μ λΉμ μ μΆκ΅¬νλ νμ¬λΌκ³ λ§νλ€. μνλͺ λνλ βνμ¬κΉμ§ μΉλ§€ μΉλ£μ λ μκ³ , μμ©νλμλ€κ³ μ΄μΌκΈ°ν μ μλ μΉλ§€ λΆμμ§λ¨λ²λ μλ€β λ©΄μ βμ΅κ·Ό μ¬λ¬ κΈλ‘λ² λΉ νλ¨Έλ€μ μμ μμ μμλ€μ΄ λ€λ €μ€κ³ μμ§λ§ μ€μ λ‘ λμ΄μΌ ν μ°μ΄ μμ§ λ§μ κ²μ΄ νμ€β μ΄λΌκ³ λ§νλ€. βνμ λ§μΆ€ν μΉλ§€ μ§λ¨κ³Ό μΉλ£ μ루μ μ μ μ λνκ° μ΄λ¬ν νμ€μ μΈ μν©μμ, νμ±μ μ μ μΈν¬κΈ°λ₯μ‘°μ κΈ°μ μ κΈ°λ°μΌλ‘ ν΄μ νμ λ§μΆ€ν μΉλ§€ μ§λ¨κ³Ό μ§λ£ μ루μ μ μ μνκ³ μ€λ¦½ν κ²μ΄ μμ€λ°μ΄μ€λ€. μ΄ νμ¬λ 2022λ 12μ νμλνκ΅ μ€νμ€ μ°½μ νλ‘μ νΈλ‘ μ겨λ κΈ°μ μΌλ‘ μ°½μ μ€μ¬λνμ μλΉμ°½μ ν¨ν€μ§, μ΄κΈ°μ°½μ ν¨ν€μ§μ λλ€λ μ¬μ λ±μ μμ£Όν΄ κΈ°μ κ°λ°μ μ§νν΄μ€κ³ μλ€. μμ€λ°μ΄μ€κ° μ μνλ μ§λ¨ κΈ°μ μ νμ±μ μ μ λμ¬ λΆμ κΈ°μ μ κΈ°λ°νλ€. μ΄λ κΈ°μ‘΄ κΈ°μ λ€μ΄ λλΆλΆ μ£Όλ‘ μλ°λ‘μ΄λ νλ‘μΈμ±μλ§ μ€μ μ λκ³ μλ κΈ°μ μ μ μ½μ 극볡νλ μ루μ μ΄ λμ΄μ€ κ²μ΄λΌκ³ νμ¬ μΈ‘μ μ€λͺ νλ€. μμ€λ°μ΄μ€μ μλ‘μ΄ μ§λ¨ κΈ°μ μ λμ λ―Όκ°λλ₯Ό κΈ°λ°μΌλ‘, μ‘°κΈ°μ§λ¨κ³Ό μ λμ λΆμμ΄ κ°λ₯νλλ‘ ν μ μμΌλ©°, νμ±μ μ μ‘°μ μ μ΄μ©ν νμλ§μΆ€ν νμ μΉλ£μ κ°λ°μ κ·Όλ³Έμ μΈν¬κΈ°λ₯ν볡과 μΈμ§κΈ°λ₯ ν볡μ ν¬ν¨μν€λ ν¨κ³Όλ₯Ό κΈ°λν μ μλ€κ³ λ§λΆμλ€. μνλͺ λνλ βμμ€λ°μ΄μ€κ° λ§λλ μ§λ¨ ν€νΈλ λμ¬μ²΄ κΈ°λ°μΌλ‘ μ‘°κΈ° μ§λ¨μ΄ κ°λ₯ν μΉλ§€ μ§λ¨κΈ°λ²μ νμ©λ μ μλ€βκ³ λ§νλ€. κ·Έλ μμ€λ°μ΄μ€μ λΉμ¦λμ€ λͺ¨λΈμ 3λ¨κ³λ‘ λΆλ₯νλ€. 1λ¨κ³λ μΉλ§€μ§λ¨ ν€νΈλ‘ ν΅μ¬ μμ₯μ μ°μ μ§μ νκ³ , 2λ¨κ³λ‘ μμ₯μ μ§λ¨ν€νΈ λ° μ§λ¨ μλΉμ€λ‘ νμ₯ν μμ μ΄λ€. λν κ³ λν 3λ¨κ³μμλ μΉλ§€μΉλ£μ λ₯Ό μμ±νκ³ μμμ μννλ κ²μΌλ‘ κ³ννκ³ μλ€. βλμ¬μ²΄ κΈ°λ° μ§λ¨ ν€νΈ νλ‘ν νμ κ°λ° μνλͺ λνλ μ΄ κ°μ μ€μ₯κΈ° κ³νμ΄ κ°λ₯νλλ‘ μμ μ μ΄λ ₯μ κΈ°λ°μΌλ‘ μΈμ , λ¬Όμ λ€νΈμν¬λ₯Ό μ΅λν νμ©ν μμ μ΄λ€. μνλͺ λνλ νμ¬ νμλ μ리카 μμ½μλͺ κ³Όνκ³Ό κ΅μ, νμλ§μΆ€μμ½μ°κ΅¬μ μμ₯μΌλ‘ μ¬μ§μ€μ΄λ©°, ν΄νμ± λμ§ν λ° μΈν¬μΉλ£ λΆμΌ μΈκ³ μ΅κ³ μμ€μ μ°κ΅¬μλ‘ νκ°λ°κ³ μλ€. μ€μ νμ± μ μ μ μΈν¬κΈ°λ₯μ‘°μ κΈ°μ μ 보μ νκ³ μμΌλ©°, SCIκΈ λ Όλ¬Έ 70μ¬νΈ μ΄μ μ μ νμΌλ©°, κ΅λ΄μΈ μ£Όμ λ³μκ³Ό μ λ¬Έκ° λ€νΈμν¬μ μ€μ¬μ μλ€. μμ€λ°μ΄μ€λ νμλ μ리카 μΊ νΌμ€ λ΄μ μλ λ§μΆ€μμ½μ°κ΅¬μκ³Ό μΊ νΌμ€ νμ νν¬μ ꡬλΉλμ΄μλ μλ λͺ¨λ μΈνλΌκ° νμ©νμ¬ μ°κ΅¬κ°λ° λ° λΉμ¦λμ€ νμ΄νλΌμΈ ꡬμΆμ νμΈ κ²μ΄λ€. νμλνκ΅ κ΅μμ°½μ κΈ°μ μΈ μμ€λ°μ΄μ€μ κΈ°μ λ ₯κ³Ό μ¬μ κ°λ₯μ±μ λμΈμ μΌλ‘λ μΈμ λ°κ³ μλ€. μ€μλ²€μ²κΈ°μ λΆκ° μ§μνκ³ νμλνκ΅κ° μ£Όκ΄νλ 2023λ μ°½μ μ€μ¬λν(μ€νμ€νΉν)μ μ μ λΌμ΄ μ°μν νκ°λ₯Ό λ°μ λ° μλ€. μνλͺ λνλ 2024/2025 μλ μ λ΅ν μ°κ΅¬κ°λ° (R&D) κ³Όμ , TIPS λ±μ μ§μν μμ μ΄λ€. λν μλ ν¬μλ₯Ό ν보ν κ³νμ΄λ©°, 2027λ μλ μ체 μμ΅κΈ°λ° κ°λ°μ κΈ°λ°μ κ°κ³ μ±μ₯νκ² λ€λ λ‘λ맡μ μΈμ°κ³ νμ°¬ λ°κ±Έμμ μμνκ³ μλ€. μνλͺ λνλ βμμ€λ°μ΄μ€λ μ€μ₯κΈ°μ μΌλ‘ μ§λ³ ν΄μΉλ₯Ό ν΅ν κ³ΌνκΈ°μ μ μ¬ννμκ³Ό μ λ°μλ£μ λ―Έλ μ λλ₯Ό μ΄λ£¨κ³ μ νλ λΉμ μ κ°κ³ μλ€βλ©΄μ βκΆκ·Ήμ μΌλ‘, μΉλ§€λ₯Ό μ΄κΈΈ μ μλ μ§λ³μΌλ‘ λ§λ€κ³ , λꡬλ μνλ€λ©΄ μ§λ¨κ³Ό μΉλ£μ ννλ°μ μ μλλ‘ μΆκ΅¬νλ κΈ°μ κ°λ°μ μ£Όλ ₯νκ² λ€βκ³ λ§νλ€.
2024. 2. 29.
2024. 10. 15.
#git #github #gitlab #bitbucket ⢠ꡬν΄μ€ SW βΆμ νλΈ μ±ν° κΈ°λ₯μΌλ‘ 보기 (λͺ©μ°¨) 00:00 κ°μ μ€λͺ 00:32 κΉμ λκ° μ λ§λ€μλ? 01:56 κΉ νΈμ€ν μΉμλΉμ€ 02:44 GitHub vs GitLab vs Bitbucket βΆκ²μ€νΈ: μ€μ±μ΄ λν / λλ¦Όνλ‘μ° βΆνΈμ€νΈ: κ³ μ°μ± PD / ν ν¬μμ΄ν° βΆνμμ : https://youtube.com/live/GFCXMVKv-K4?feature=share βΆμ€μ±μ΄ λν SW κ΅μ‘ κ³Όμ : https://bit.ly/test_automation_edu_page βΆλ¬Έμ λ©μΌ : sy.yun@dream-flow.com ITμ λ¬Έλ°©μ‘ ν ν¬μμ΄ν°μμλ λ§€μΌ ν ν¬λΆμΌ μ λ¬Έκ°μ μλ°©μ‘ μ¨λΉλκ° μ§νλ©λλ€. λꡬλ μ§ λ¬΄λ£λ‘ μ°Έμ¬νμ€ μ μμΌλ©°, λ¨κ²¨μ£Όμ μ§μμ λν μ λ¬Έκ°μ μ€μκ° μλ΅μ κ²½ννμ€ μ μμ΅λλ€. 2006λ λΆν° 2,000νμ΄μ μ§νλ λ€μν μ¨λΉλλ₯Ό ν΅ν΄ κ΅λ΄μΈ μ΅μ IT κΈ°μ μ νμΈνμΈμ. βΆ ν ν¬μμ΄ν° μ¨λΉλ μ°Έμ¬ λ° μλ£ λ€μ΄λ‘λ : https://talkit.tv [ν ν¬μμ΄ν° IT μ¨λΉλ λλ μ½ν μΈ λ§μΌν λ¬Έμ] : talkit@talkit.tv, 02-565-0012
2024. 8. 29.
Create a blog using the Next.js React framework, and Strapi CMS. Code: https://github.com/jgbijlsma/blog_next_strapi_project_video Discord: https://discord.gg/vNrm6g9r Sections: 00:00 - Intro 06:43 - Installing Next and Strapi 10:00 - Writing blog posts in Strapi 18:26 - Next overview 28:20 - Getting blog post data with next 44:14 - Navbar and routing 48:32 - Styling with Sass 01:01:05 - Building the homepage 01:10:18 - Building the posts overview 01:14:12 - Building the post preview links 01:20:05 - Building post pages 01:32:26 - Rendering markdown content
2021. 7. 26.
π https://neetcode.io/ - A better way to prepare for Coding Interviews π§βπΌ LinkedIn: https://www.linkedin.com/in/navdeep-singh-3aaa14161/ π¦ Twitter: https://twitter.com/neetcode1 β BLIND-75 PLAYLIST: https://www.youtube.com/watch?v=KLlXCFG5TnA&list=PLot-Xpze53ldVwtstag2TL4HQhAnC8ATf Problem Link: https://leetcode.com/problems/make-sum-divisible-by-p/description/ 0:00 - Read the problem 0:30 - Brute force Explanation 2:58 - Optimal Explanation 10:38 - Coding Explanation leetcode 1590 #neetcode #leetcode #python
2024. 10. 3.
Visit Our Website: https://interviewpen.com/?utm_campaign=shortenpath Join Our Discord: https://discord.gg/Qy85PT9wj6 Join Our Newsletter - The Blueprint: https://theblueprint.dev/subscribe Like & Subscribe: https://youtube.com/@interviewpen This is an example of a full video available on interviewpen.com. Check out our website to find more premium content like this! Problem Statement: Write a function that takes in a non-empty string representing a valid Unix-shell path and returns a shortened version of that path. A path is a notation that represents the location of a file or directory in a file system. A path can be an absolute path, meaning that it starts at the root directory in a file system, or a relative path, meaning that it starts at the current directory in a file system. In a Unix-like operating system, a path is bound by the following rules: The root directory is represented by a /. This means that if a path starts with /, it's an absolute path; if it doesn't, it's a relative path. The symbol / otherwise represents the directory separator. This means that the path /foo/bar is the location of the directory bar inside the directory foo, which is itself located inside the root directory. The symbol .. represents the parent directory. This means that accessing files or directories in /foo/bar/.. is equivalent to accessing files or directories in /foo. The symbol . represents the current directory. This means that accessing files or directories in /foo/bar/. is equivalent to accessing files or directories in /foo/bar. The symbols / and . can be repeated sequentially without consequence; the symbol .. cannot, however, because repeating it sequentially means going further up in parent directories. For example, /foo/bar/baz/././. and /foo/bar/baz are equivalent paths, but /foo/bar/baz/../../../ and /foo/bar/baz definitely aren't. The only exception is with the root directory: /../../.. and / are equivalent, because the root directory has no parent directory, which means that repeatedly accessing parent directories does nothing. Note that the shortened version of the path must be equivalent to the original path. In other words, it must point to the same file or directory as the original path. Sample Input path = "/foo/../test/../test/../foo//bar/./baz" Sample Output "/foo/bar/baz" // This path is equivalent to the input path Table of Contents: 0:00 - Introduction 0:35 - Absolute and Relative Paths 2:48 - Shortening Paths 3:23 - Rules of Unix Paths 4:22 - Edge Cases 6:23 - Examples 8:09 - Using a Stack 10:55 - Python Solution 14:17 - Time and Space Complexity Socials: Twitter: https://twitter.com/InterviewPen Twitter (The Blueprint): https://twitter.com/theblueprintdev LinkedIn: https://www.linkedin.com/company/interviewpen Website: https://interviewpen.com/?utm_campaign=shortenpath
2024. 4. 5.